%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL006-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 : n003.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 3.23s 1.79s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 27 unt; 5 def)
% Number of atoms : 96 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 39 ( 23 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 43 !; 0 ?; 36 :)
% 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,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ec_4) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,equivalent(X1,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ec_5) ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ec_1) ).
tcf(c_53,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_54,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,equivalent(X1,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_71,definition,
iPr_def_10 = equivalent(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_72,definition,
iPr_def_11 = equivalent(c,a),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_73,definition,
iPr_def_12 = equivalent(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_74,definition,
iPr_def_13 = equivalent(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_75,definition,
iPr_def_14 = equivalent(iPr_def_12,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_76,negated_conjecture,
~ is_a_theorem(iPr_def_14),
inference(demodulation,[status(thm)],[c_56,c_74,c_72,c_71,c_73,c_75]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_54,c_53]) ).
tcf(c_218,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(iPr_def_10,X0),equivalent(a,equivalent(b,X0)))),
inference(superposition,[status(thm)],[c_71,c_55]) ).
tcf(c_222,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(iPr_def_14,X0),equivalent(iPr_def_12,equivalent(iPr_def_13,X0)))),
inference(superposition,[status(thm)],[c_75,c_55]) ).
tcf(c_224,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,c),a),equivalent(X0,iPr_def_11))),
inference(superposition,[status(thm)],[c_72,c_55]) ).
tcf(c_228,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_55,c_53]) ).
tcf(c_433,plain,
is_a_theorem(equivalent(equivalent(iPr_def_10,c),equivalent(a,iPr_def_13))),
inference(superposition,[status(thm)],[c_74,c_218]) ).
tcf(c_460,plain,
is_a_theorem(equivalent(equivalent(a,iPr_def_13),equivalent(iPr_def_10,c))),
inference(superposition,[status(thm)],[c_433,c_184]) ).
tcf(c_654,plain,
is_a_theorem(equivalent(equivalent(equivalent(iPr_def_10,c),a),iPr_def_12)),
inference(superposition,[status(thm)],[c_73,c_224]) ).
tcf(c_767,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
inference(superposition,[status(thm)],[c_54,c_228]) ).
tcf(c_768,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X0,equivalent(X1,X2))))),
inference(superposition,[status(thm)],[c_55,c_228]) ).
tcf(c_778,plain,
! [X0: $i] : is_a_theorem(equivalent(iPr_def_14,equivalent(X0,equivalent(iPr_def_12,equivalent(iPr_def_13,X0))))),
inference(superposition,[status(thm)],[c_222,c_228]) ).
tcf(c_787,plain,
is_a_theorem(equivalent(a,equivalent(iPr_def_13,equivalent(iPr_def_10,c)))),
inference(superposition,[status(thm)],[c_460,c_228]) ).
tcf(c_919,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,equivalent(X1,X0)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_767,c_53]) ).
tcf(c_935,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_919,c_184]) ).
tcf(c_936,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_919,c_53]) ).
tcf(c_1535,plain,
is_a_theorem(equivalent(equivalent(iPr_def_13,equivalent(iPr_def_10,c)),a)),
inference(superposition,[status(thm)],[c_787,c_184]) ).
tcf(c_1800,plain,
is_a_theorem(equivalent(iPr_def_13,equivalent(equivalent(iPr_def_10,c),a))),
inference(superposition,[status(thm)],[c_1535,c_228]) ).
tcf(c_2823,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_935,c_53]) ).
tcf(c_4810,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,equivalent(X1,X2))))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_768,c_53]) ).
tcf(c_6863,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_14)
| ~ is_a_theorem(equivalent(X0,equivalent(iPr_def_12,equivalent(iPr_def_13,X0)))) ),
inference(superposition,[status(thm)],[c_778,c_2823]) ).
tcf(c_6868,plain,
! [X0: $i] : ~ is_a_theorem(equivalent(X0,equivalent(iPr_def_12,equivalent(iPr_def_13,X0)))),
inference(forward_subsumption_resolution,[status(thm)],[c_6863,c_76]) ).
tcf(c_6973,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(iPr_def_12,equivalent(iPr_def_13,X0))) ),
inference(superposition,[status(thm)],[c_936,c_6868]) ).
tcf(c_7023,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(iPr_def_13,X0))
| ~ is_a_theorem(equivalent(X0,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_4810,c_6973]) ).
tcf(c_7078,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(iPr_def_10,c),a),iPr_def_12)),
inference(superposition,[status(thm)],[c_1800,c_7023]) ).
tcf(c_7091,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7078,c_654]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL006-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.12/0.36 % Computer : n003.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Wed Sep 23 21:37:07 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 3.23/1.79 % SZS status Started for theBenchmark.p
% 3.23/1.79 % SZS status Unsatisfiable for theBenchmark.p
% 3.23/1.79
% 3.23/1.79 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.23/1.79
% 3.23/1.79 % ------ iProver source info
% 3.23/1.79
% 3.23/1.79 % git: date: 2026-07-19 20:42:38 +0200
% 3.23/1.79 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.23/1.79 % git: non_committed_changes: false
% 3.23/1.79
% 3.23/1.79 % ------ Parsing...% successful
% 3.23/1.79
% 3.23/1.79
% 3.23/1.79 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.23/1.79
% 3.23/1.79 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.23/1.79
% 3.23/1.79 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.23/1.79
% 3.23/1.79 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.23/1.79 % ------ Proving...
% 3.23/1.79 % ------ Problem Properties
% 3.23/1.79
% 3.23/1.79 %
% 3.23/1.79 % clauses 9
% 3.23/1.79 % conjectures 1
% 3.23/1.79 % EPR 1
% 3.23/1.79 % Horn 9
% 3.23/1.79 % unary 8
% 3.23/1.79 % binary 0
% 3.23/1.79 % lits 11
% 3.23/1.79 % lits eq 5
% 3.23/1.79 % fd_pure 0
% 3.23/1.79 % fd_pseudo 0
% 3.23/1.79 % fd_cond 0
% 3.23/1.79 % fd_pseudo_cond 0
% 3.23/1.79 % AC symbols 0
% 3.23/1.79
% 3.23/1.79 % ------ Schedule dynamic 5 is on
% 3.23/1.79
% 3.23/1.79 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.23/1.79
% 3.23/1.79
% 3.23/1.79 % ------
% 3.23/1.79 % Current options:
% 3.23/1.79 % ------
% 3.23/1.79
% 3.23/1.79
% 3.23/1.79 %
% 3.23/1.79
% 3.23/1.79 % ------ Proving...
% 3.23/1.79 %
% 3.23/1.79
% 3.23/1.79 % SZS status Unsatisfiable for theBenchmark.p
% 3.23/1.79
% 3.23/1.79 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.23/1.79
% 3.23/1.79
%------------------------------------------------------------------------------