%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL120-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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 3.01s 1.30s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 23 unt; 5 def)
% Number of atoms : 81 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 22 ~; 15 |; 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 : 35 ( 0 sgn 35 !; 0 ?; 30 :)
% 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(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qyf) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(c,a)),equivalent(b,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_xgj) ).
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(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X2,X1))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(c,a)),equivalent(b,c)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_66,definition,
iPr_def_10 = equivalent(c,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_67,definition,
iPr_def_11 = equivalent(b,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_68,definition,
iPr_def_12 = equivalent(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_69,definition,
iPr_def_13 = equivalent(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_70,definition,
iPr_def_14 = equivalent(a,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_71,negated_conjecture,
~ is_a_theorem(iPr_def_14),
inference(demodulation,[status(thm)],[c_54,c_68,c_66,c_67,c_69,c_70]) ).
tcf(c_194,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(iPr_def_10,equivalent(c,X0)),equivalent(X0,a))),
inference(superposition,[status(thm)],[c_66,c_53]) ).
tcf(c_196,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(iPr_def_11,equivalent(b,X0)),equivalent(X0,iPr_def_10))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_208,plain,
! [X0: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,iPr_def_13),equivalent(X0,a)),iPr_def_14)),
inference(superposition,[status(thm)],[c_70,c_53]) ).
tcf(c_209,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_257,plain,
! [X0: $i] :
( is_a_theorem(equivalent(X0,a))
| ~ is_a_theorem(equivalent(iPr_def_10,equivalent(c,X0))) ),
inference(superposition,[status(thm)],[c_194,c_52]) ).
tcf(c_352,plain,
is_a_theorem(equivalent(equivalent(iPr_def_11,iPr_def_12),equivalent(c,iPr_def_10))),
inference(superposition,[status(thm)],[c_68,c_196]) ).
tcf(c_356,plain,
is_a_theorem(equivalent(iPr_def_13,equivalent(c,iPr_def_10))),
inference(light_normalisation,[status(thm)],[c_352,c_69]) ).
tcf(c_576,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_14)
| ~ is_a_theorem(equivalent(equivalent(X0,iPr_def_13),equivalent(X0,a))) ),
inference(superposition,[status(thm)],[c_208,c_52]) ).
tcf(c_577,plain,
! [X0: $i] : ~ is_a_theorem(equivalent(equivalent(X0,iPr_def_13),equivalent(X0,a))),
inference(forward_subsumption_resolution,[status(thm)],[c_576,c_71]) ).
tcf(c_596,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
inference(superposition,[status(thm)],[c_53,c_209]) ).
tcf(c_622,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,equivalent(X1,X0)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_596,c_52]) ).
tcf(c_623,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
inference(superposition,[status(thm)],[c_596,c_209]) ).
tcf(c_624,plain,
is_a_theorem(equivalent(equivalent(c,iPr_def_10),a)),
inference(superposition,[status(thm)],[c_596,c_257]) ).
tcf(c_648,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_622,c_52]) ).
tcf(c_789,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,equivalent(X0,X1))) ),
inference(superposition,[status(thm)],[c_623,c_52]) ).
tcf(c_843,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_596,c_789]) ).
tcf(c_865,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_648,c_209]) ).
tcf(c_878,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(X0,iPr_def_13))
| ~ is_a_theorem(equivalent(X0,a)) ),
inference(superposition,[status(thm)],[c_648,c_577]) ).
tcf(c_991,plain,
~ is_a_theorem(equivalent(equivalent(c,iPr_def_10),iPr_def_13)),
inference(superposition,[status(thm)],[c_624,c_878]) ).
tcf(c_1577,plain,
! [X0: $i] :
( is_a_theorem(equivalent(equivalent(c,iPr_def_10),X0))
| ~ is_a_theorem(equivalent(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_356,c_865]) ).
tcf(c_2178,plain,
~ is_a_theorem(equivalent(iPr_def_13,iPr_def_13)),
inference(superposition,[status(thm)],[c_1577,c_991]) ).
tcf(c_2184,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2178,c_843]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL120-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.39 % Computer : n017.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Wed Sep 23 21:55:45 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.46 % Proving...
% 3.01/1.30 % SZS status Started for theBenchmark.p
% 3.01/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.01/1.30
% 3.01/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.01/1.30
% 3.01/1.30 % ------ iProver source info
% 3.01/1.30
% 3.01/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.01/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.01/1.30 % git: non_committed_changes: false
% 3.01/1.30
% 3.01/1.30 % ------ Parsing...% successful
% 3.01/1.30
% 3.01/1.30
% 3.01/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.01/1.30
% 3.01/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.01/1.30
% 3.01/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.01/1.30
% 3.01/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.01/1.30 % ------ Proving...
% 3.01/1.30 % ------ Problem Properties
% 3.01/1.30
% 3.01/1.30 %
% 3.01/1.30 % clauses 8
% 3.01/1.30 % conjectures 1
% 3.01/1.30 % EPR 1
% 3.01/1.30 % Horn 8
% 3.01/1.30 % unary 7
% 3.01/1.30 % binary 0
% 3.01/1.30 % lits 10
% 3.01/1.30 % lits eq 5
% 3.01/1.30 % fd_pure 0
% 3.01/1.30 % fd_pseudo 0
% 3.01/1.30 % fd_cond 0
% 3.01/1.30 % fd_pseudo_cond 0
% 3.01/1.30 % AC symbols 0
% 3.01/1.30
% 3.01/1.30 % ------ Schedule dynamic 5 is on
% 3.01/1.30
% 3.01/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.01/1.30
% 3.01/1.30
% 3.01/1.30 % ------
% 3.01/1.30 % Current options:
% 3.01/1.30 % ------
% 3.01/1.30
% 3.01/1.30
% 3.01/1.30 %
% 3.01/1.30
% 3.01/1.30 % ------ Proving...
% 3.01/1.30 %
% 3.01/1.30
% 3.01/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.01/1.30
% 3.01/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.01/1.31
% 3.01/1.31
%------------------------------------------------------------------------------