%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL013-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 : 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:05:25 PM UTC 2026
% Result : Unsatisfiable 1.73s 1.29s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 17 unt; 5 def)
% Number of atoms : 60 ( 5 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 21 ( 13 ~; 8 |; 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 : 16 ( 0 sgn 16 !; 0 ?; 11 :)
% 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(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xgf) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_um) ).
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(X0,equivalent(equivalent(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
inference(cnf_transformation,[],[f3]) ).
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(iPr_def_10,c),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_68,definition,
iPr_def_12 = equivalent(c,a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_69,definition,
iPr_def_13 = equivalent(b,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_70,definition,
iPr_def_14 = equivalent(iPr_def_11,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_69,c_66,c_67,c_70]) ).
tcf(c_195,plain,
! [X0: $i] : is_a_theorem(equivalent(c,equivalent(equivalent(X0,iPr_def_12),equivalent(a,X0)))),
inference(superposition,[status(thm)],[c_68,c_53]) ).
tcf(c_201,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(c,equivalent(X0,iPr_def_10)),iPr_def_11))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_203,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(iPr_def_13,equivalent(X0,iPr_def_11)),iPr_def_14))),
inference(superposition,[status(thm)],[c_70,c_53]) ).
tcf(c_262,plain,
is_a_theorem(equivalent(c,equivalent(equivalent(b,iPr_def_12),iPr_def_10))),
inference(superposition,[status(thm)],[c_66,c_195]) ).
tcf(c_264,plain,
is_a_theorem(equivalent(c,equivalent(iPr_def_13,iPr_def_10))),
inference(light_normalisation,[status(thm)],[c_262,c_69]) ).
tcf(c_380,plain,
! [X0: $i] :
( is_a_theorem(equivalent(equivalent(iPr_def_13,equivalent(X0,iPr_def_11)),iPr_def_14))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_203,c_52]) ).
tcf(c_551,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_14)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(iPr_def_13,equivalent(X0,iPr_def_11))) ),
inference(superposition,[status(thm)],[c_380,c_52]) ).
tcf(c_552,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(iPr_def_13,equivalent(X0,iPr_def_11))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_551,c_71]) ).
tcf(c_560,plain,
~ is_a_theorem(equivalent(c,equivalent(iPr_def_13,iPr_def_10))),
inference(superposition,[status(thm)],[c_201,c_552]) ).
tcf(c_561,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_560,c_264]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL013-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.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 21:37:09 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.73/1.29 % SZS status Started for theBenchmark.p
% 1.73/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/1.29
% 1.73/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.73/1.29
% 1.73/1.29 % ------ iProver source info
% 1.73/1.29
% 1.73/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.73/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.73/1.29 % git: non_committed_changes: false
% 1.73/1.29
% 1.73/1.29 % ------ Parsing...% successful
% 1.73/1.29
% 1.73/1.29
% 1.73/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.73/1.29
% 1.73/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.73/1.29
% 1.73/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.73/1.29
% 1.73/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.73/1.29 % ------ Proving...
% 1.73/1.29 % ------ Problem Properties
% 1.73/1.29
% 1.73/1.29 %
% 1.73/1.29 % clauses 8
% 1.73/1.29 % conjectures 1
% 1.73/1.29 % EPR 1
% 1.73/1.29 % Horn 8
% 1.73/1.29 % unary 7
% 1.73/1.29 % binary 0
% 1.73/1.29 % lits 10
% 1.73/1.29 % lits eq 5
% 1.73/1.29 % fd_pure 0
% 1.73/1.29 % fd_pseudo 0
% 1.73/1.29 % fd_cond 0
% 1.73/1.29 % fd_pseudo_cond 0
% 1.73/1.29 % AC symbols 0
% 1.73/1.29
% 1.73/1.29 % ------ Schedule dynamic 5 is on
% 1.73/1.29
% 1.73/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.73/1.29
% 1.73/1.29
% 1.73/1.29 % ------
% 1.73/1.29 % Current options:
% 1.73/1.29 % ------
% 1.73/1.29
% 1.73/1.29
% 1.73/1.29 %
% 1.73/1.29
% 1.73/1.29 % ------ Proving...
% 1.73/1.29 %
% 1.73/1.29
% 1.73/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/1.29
% 1.73/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/1.29
% 1.73/1.29
%------------------------------------------------------------------------------