%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n019.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:05:24 PM UTC 2026
% Result : Unsatisfiable 0.42s 1.29s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 23 unt; 3 def)
% Number of atoms : 97 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 62 ( 34 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',yql) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ec_4) ).
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(equivalent(a,b),equivalent(b,a))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_55,plain,
is_a_theorem(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a)))),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_66,definition,
iPr_def_10 = equivalent(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_67,definition,
iPr_def_11 = equivalent(b,a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_68,definition,
iPr_def_12 = equivalent(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_69,negated_conjecture,
~ is_a_theorem(iPr_def_12),
inference(demodulation,[status(thm)],[c_54,c_67,c_66,c_68]) ).
tcf(c_176,plain,
! [X0: $i] : is_a_theorem(equivalent(iPr_def_10,equivalent(equivalent(X0,b),equivalent(a,X0)))),
inference(superposition,[status(thm)],[c_66,c_53]) ).
tcf(c_180,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(X0,a),equivalent(iPr_def_11,equivalent(X0,b)))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_184,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(iPr_def_10,X0),equivalent(equivalent(iPr_def_11,X0),iPr_def_12))),
inference(superposition,[status(thm)],[c_68,c_53]) ).
tcf(c_185,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_198,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),X3)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_208,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X3,equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),X3)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X3,equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),X3)))) ),
inference(instantiation,[status(thm)],[c_198]) ).
tcf(c_209,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X3,equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),X3)))),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_336,plain,
is_a_theorem(equivalent(equivalent(a,a),equivalent(iPr_def_11,iPr_def_10))),
inference(superposition,[status(thm)],[c_66,c_180]) ).
tcf(c_341,plain,
( is_a_theorem(equivalent(iPr_def_11,iPr_def_10))
| ~ is_a_theorem(equivalent(a,a)) ),
inference(superposition,[status(thm)],[c_336,c_52]) ).
tcf(c_386,plain,
! [X0: $i] :
( is_a_theorem(equivalent(equivalent(iPr_def_11,X0),iPr_def_12))
| ~ is_a_theorem(equivalent(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_184,c_52]) ).
tcf(c_450,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_185,c_52]) ).
tcf(c_465,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(equivalent(iPr_def_11,X0))
| ~ is_a_theorem(equivalent(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_386,c_52]) ).
tcf(c_466,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(iPr_def_11,X0))
| ~ is_a_theorem(equivalent(iPr_def_10,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_465,c_69]) ).
tcf(c_490,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),equivalent(X0,X1))))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),equivalent(X0,X1))))) ),
inference(instantiation,[status(thm)],[c_208]) ).
tcf(c_491,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),equivalent(X0,X1)))) ),
inference(instantiation,[status(thm)],[c_198]) ).
tcf(c_492,plain,
( is_a_theorem(equivalent(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))),equivalent(equivalent(a,a),equivalent(a,a))))
| ~ is_a_theorem(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))),equivalent(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))),equivalent(equivalent(a,a),equivalent(a,a))))) ),
inference(instantiation,[status(thm)],[c_490]) ).
tcf(c_493,plain,
( is_a_theorem(equivalent(equivalent(a,a),equivalent(a,a)))
| ~ is_a_theorem(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))),equivalent(equivalent(a,a),equivalent(a,a)))) ),
inference(instantiation,[status(thm)],[c_491]) ).
tcf(c_525,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_450]) ).
tcf(c_817,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2))),equivalent(equivalent(X0,X1),equivalent(X0,X1))))),
inference(instantiation,[status(thm)],[c_209]) ).
tcf(c_818,plain,
is_a_theorem(equivalent(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))),equivalent(equivalent(equivalent(a,a),equivalent(equivalent(a,a),equivalent(a,a))),equivalent(equivalent(a,a),equivalent(a,a))))),
inference(instantiation,[status(thm)],[c_817]) ).
tcf(c_823,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(superposition,[status(thm)],[c_53,c_525]) ).
tcf(c_824,plain,
is_a_theorem(equivalent(equivalent(a,b),iPr_def_10)),
inference(superposition,[status(thm)],[c_176,c_525]) ).
tcf(c_837,plain,
is_a_theorem(equivalent(iPr_def_10,iPr_def_10)),
inference(light_normalisation,[status(thm)],[c_824,c_66]) ).
tcf(c_877,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_823,c_450]) ).
tcf(c_910,plain,
~ is_a_theorem(equivalent(iPr_def_11,iPr_def_10)),
inference(superposition,[status(thm)],[c_837,c_466]) ).
tcf(c_915,plain,
~ is_a_theorem(equivalent(a,a)),
inference(backward_subsumption_resolution,[status(thm)],[c_341,c_910]) ).
tcf(c_1467,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_877]) ).
tcf(c_1820,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_1467,c_52]) ).
tcf(c_1848,plain,
( is_a_theorem(equivalent(a,a))
| ~ is_a_theorem(equivalent(equivalent(a,a),equivalent(a,a))) ),
inference(instantiation,[status(thm)],[c_1820]) ).
tcf(c_1849,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1848,c_915,c_818,c_493,c_492,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 21:37:06 UTC 2026
% 0.14/0.38 % CPUTime :
% 0.14/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.43
% 0.14/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.43
% 0.14/0.43 % Detected problem language: tptp
% 0.14/0.45 % Proving...
% 0.42/1.29 % SZS status Started for theBenchmark.p
% 0.42/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/1.29
% 0.42/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/1.29
% 0.42/1.29 % ------ iProver source info
% 0.42/1.29
% 0.42/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/1.29 % git: non_committed_changes: false
% 0.42/1.29
% 0.42/1.29 % ------ Parsing...% successful
% 0.42/1.29
% 0.42/1.29
% 0.42/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/1.29
% 0.42/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.42/1.29
% 0.42/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.42/1.29
% 0.42/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.42/1.29 % ------ Proving...
% 0.42/1.29 % ------ Problem Properties
% 0.42/1.29
% 0.42/1.29 %
% 0.42/1.29 % clauses 6
% 0.42/1.29 % conjectures 1
% 0.42/1.29 % EPR 1
% 0.42/1.29 % Horn 6
% 0.42/1.29 % unary 5
% 0.42/1.29 % binary 0
% 0.42/1.29 % lits 8
% 0.42/1.29 % lits eq 3
% 0.42/1.29 % fd_pure 0
% 0.42/1.29 % fd_pseudo 0
% 0.42/1.29 % fd_cond 0
% 0.42/1.29 % fd_pseudo_cond 0
% 0.42/1.29 % AC symbols 0
% 0.42/1.29
% 0.42/1.29 % ------ Schedule dynamic 5 is on
% 0.42/1.29
% 0.42/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.42/1.29
% 0.42/1.29
% 0.42/1.29 % ------
% 0.42/1.29 % Current options:
% 0.42/1.29 % ------
% 0.42/1.29
% 0.42/1.29
% 0.42/1.29 %
% 0.42/1.29
% 0.42/1.29 % ------ Proving...
% 0.42/1.29 %
% 0.42/1.29
% 0.42/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.42/1.29
% 0.42/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.30
% 0.42/1.30
%------------------------------------------------------------------------------