%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL126-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 : n018.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:43 PM UTC 2026
% Result : Unsatisfiable 2.05s 1.28s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 33 ( 19 unt; 5 def)
% Number of atoms : 97 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 46 ( 26 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 36 ( 0 sgn 36 !; 0 ?; 28 :)
% 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(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_4) ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_2) ).
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,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,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,b),
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(a,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_207,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,iPr_def_14),equivalent(iPr_def_13,iPr_def_12)))),
inference(superposition,[status(thm)],[c_75,c_54]) ).
tcf(c_212,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(iPr_def_13,iPr_def_12)),iPr_def_14))),
inference(superposition,[status(thm)],[c_75,c_54]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_54,c_53]) ).
tcf(c_233,plain,
! [X0: $i] : is_a_theorem(equivalent(iPr_def_13,equivalent(equivalent(a,X0),equivalent(c,X0)))),
inference(superposition,[status(thm)],[c_74,c_55]) ).
tcf(c_368,plain,
! [X0: $i] :
( is_a_theorem(equivalent(equivalent(X0,iPr_def_14),equivalent(iPr_def_13,iPr_def_12)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_207,c_53]) ).
tcf(c_428,plain,
! [X0: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(iPr_def_13,iPr_def_12)),iPr_def_14))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_212,c_53]) ).
tcf(c_508,plain,
is_a_theorem(equivalent(iPr_def_13,equivalent(equivalent(a,b),iPr_def_11))),
inference(superposition,[status(thm)],[c_72,c_233]) ).
tcf(c_510,plain,
is_a_theorem(equivalent(iPr_def_13,iPr_def_12)),
inference(light_normalisation,[status(thm)],[c_508,c_71,c_73]) ).
tcf(c_566,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_213,c_53]) ).
tcf(c_889,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_14)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(iPr_def_13,iPr_def_12))) ),
inference(superposition,[status(thm)],[c_428,c_53]) ).
tcf(c_890,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(iPr_def_13,iPr_def_12))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_889,c_76]) ).
tcf(c_900,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,iPr_def_14)) ),
inference(superposition,[status(thm)],[c_368,c_890]) ).
tcf(c_1167,plain,
! [X0: $i] :
( is_a_theorem(equivalent(equivalent(iPr_def_13,iPr_def_12),equivalent(X0,iPr_def_14)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_207,c_566]) ).
tcf(c_2924,plain,
! [X0: $i] :
( is_a_theorem(equivalent(X0,iPr_def_14))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(iPr_def_13,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_1167,c_53]) ).
tcf(c_2925,plain,
! [X0: $i] :
( is_a_theorem(equivalent(iPr_def_14,X0))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(iPr_def_13,iPr_def_12)) ),
inference(superposition,[status(thm)],[c_1167,c_566]) ).
tcf(c_2926,plain,
! [X0: $i] :
( is_a_theorem(equivalent(iPr_def_14,X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2925,c_510]) ).
tcf(c_2929,plain,
! [X0: $i] :
( is_a_theorem(equivalent(X0,iPr_def_14))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2924,c_510]) ).
tcf(c_2953,plain,
! [X0: $i] : ~ is_a_theorem(X0),
inference(global_subsumption_just,[status(thm)],[c_2926,c_900,c_2929]) ).
tcf(c_2956,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_2953]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL126-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n018.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 22:03:32 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 2.05/1.28 % SZS status Started for theBenchmark.p
% 2.05/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.05/1.28
% 2.05/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.05/1.28
% 2.05/1.28 % ------ iProver source info
% 2.05/1.28
% 2.05/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.05/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.05/1.28 % git: non_committed_changes: false
% 2.05/1.28
% 2.05/1.28 % ------ Parsing...% successful
% 2.05/1.28
% 2.05/1.28
% 2.05/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.05/1.28
% 2.05/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.05/1.28
% 2.05/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.05/1.28
% 2.05/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.05/1.28 % ------ Proving...
% 2.05/1.28 % ------ Problem Properties
% 2.05/1.28
% 2.05/1.28 %
% 2.05/1.28 % clauses 9
% 2.05/1.28 % conjectures 1
% 2.05/1.28 % EPR 1
% 2.05/1.28 % Horn 9
% 2.05/1.28 % unary 8
% 2.05/1.28 % binary 0
% 2.05/1.28 % lits 11
% 2.05/1.28 % lits eq 5
% 2.05/1.28 % fd_pure 0
% 2.05/1.28 % fd_pseudo 0
% 2.05/1.28 % fd_cond 0
% 2.05/1.28 % fd_pseudo_cond 0
% 2.05/1.28 % AC symbols 0
% 2.05/1.28
% 2.05/1.28 % ------ Schedule dynamic 5 is on
% 2.05/1.28
% 2.05/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.05/1.28
% 2.05/1.28
% 2.05/1.28 % ------
% 2.05/1.28 % Current options:
% 2.05/1.28 % ------
% 2.05/1.28
% 2.05/1.28
% 2.05/1.28 %
% 2.05/1.28
% 2.05/1.28 % ------ Proving...
% 2.05/1.28 %
% 2.05/1.28
% 2.05/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.05/1.28
% 2.05/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.05/1.29
% 2.05/1.29
%------------------------------------------------------------------------------