%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL257-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:06:12 PM UTC 2026
% Result : Unsatisfiable 5.04s 1.58s
% Output : CNFRefutation 5.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 61 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yql) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_xhn) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_96,c_52]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X3,X2),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1)))) ),
inference(superposition,[status(thm)],[c_53,c_98]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_147,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_146,c_52]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(superposition,[status(thm)],[c_53,c_110]) ).
tcf(c_161,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_150,c_147]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),equivalent(X2,X1))),
inference(superposition,[status(thm)],[c_53,c_161]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_146,c_161]) ).
tcf(c_214,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0))) ),
inference(superposition,[status(thm)],[c_181,c_52]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_182,c_52]) ).
tcf(c_276,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X1),equivalent(X0,X3))))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_53,c_270]) ).
tcf(c_383,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(z,x),z),x)),
inference(superposition,[status(thm)],[c_276,c_54]) ).
tcf(c_385,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),X3))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),X3))) ),
inference(superposition,[status(thm)],[c_276,c_214]) ).
tcf(c_574,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
inference(superposition,[status(thm)],[c_53,c_385]) ).
tcf(c_645,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(superposition,[status(thm)],[c_574,c_385]) ).
tcf(c_668,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
inference(superposition,[status(thm)],[c_645,c_385]) ).
tcf(c_749,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),X1))),
inference(superposition,[status(thm)],[c_668,c_214]) ).
tcf(c_1038,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1)),
inference(superposition,[status(thm)],[c_749,c_214]) ).
tcf(c_1415,plain,
$false,
inference(superposition,[status(thm)],[c_1038,c_383]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL257-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.21/0.46 % Computer : n008.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Wed Sep 23 22:39:10 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.55
% 0.24/0.55 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.55
% 0.24/0.55 % Detected problem language: tptp
% 0.24/0.57 % Proving...
% 5.04/1.58 % SZS status Started for theBenchmark.p
% 5.04/1.58 % SZS status Unsatisfiable for theBenchmark.p
% 5.04/1.58
% 5.04/1.58 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.04/1.58
% 5.04/1.58 % ------ iProver source info
% 5.04/1.58
% 5.04/1.58 % git: date: 2026-07-19 20:42:38 +0200
% 5.04/1.58 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.04/1.58 % git: non_committed_changes: false
% 5.04/1.58
% 5.04/1.58 % ------ Parsing...% successful
% 5.04/1.58
% 5.04/1.58
% 5.04/1.58 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.04/1.58
% 5.04/1.58 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 5.04/1.58
% 5.04/1.58 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 5.04/1.58 % ------ Proving...
% 5.04/1.58 % ------ Problem Properties
% 5.04/1.58
% 5.04/1.58 %
% 5.04/1.58 % clauses 3
% 5.04/1.58 % conjectures 1
% 5.04/1.58 % EPR 0
% 5.04/1.58 % Horn 3
% 5.04/1.58 % unary 2
% 5.04/1.58 % binary 0
% 5.04/1.58 % lits 5
% 5.04/1.58 % lits eq 0
% 5.04/1.58 % fd_pure 0
% 5.04/1.58 % fd_pseudo 0
% 5.04/1.58 % fd_cond 0
% 5.04/1.58 % fd_pseudo_cond 0
% 5.04/1.58 % AC symbols 0
% 5.04/1.58
% 5.04/1.58 % ------ Input Options Time Limit: Unbounded
% 5.04/1.58
% 5.04/1.58
% 5.04/1.58 % ------
% 5.04/1.58 % Current options:
% 5.04/1.58 % ------
% 5.04/1.58
% 5.04/1.58
% 5.04/1.58 %
% 5.04/1.58
% 5.04/1.58 % ------ Proving...
% 5.04/1.58 %
% 5.04/1.58
% 5.04/1.58 % SZS status Unsatisfiable for theBenchmark.p
% 5.04/1.58
% 5.04/1.58 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.04/1.58
% 5.04/1.58
%------------------------------------------------------------------------------