%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL009-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 : n014.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.58s 1.18s
% Output : CNFRefutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 18 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 53 !; 0 ?; 48 :)
% 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(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yql) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(a,equivalent(b,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ec_5) ).
tcf(c_52,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(a,equivalent(b,c)))),
inference(cnf_transformation,[],[f3]) ).
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,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_124,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_54]) ).
tcf(c_139,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_124,c_54]) ).
tcf(c_180,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_139]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X2,X3),X0))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_124,c_139]) ).
tcf(c_235,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(superposition,[status(thm)],[c_53,c_180]) ).
tcf(c_277,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_235,c_139]) ).
tcf(c_296,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_277]) ).
tcf(c_341,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X3,X0),X2),equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_53,c_181]) ).
tcf(c_424,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_296,c_54]) ).
tcf(c_476,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_235,c_424]) ).
tcf(c_510,plain,
~ is_a_theorem(equivalent(equivalent(b,equivalent(b,c)),c)),
inference(superposition,[status(thm)],[c_341,c_52]) ).
tcf(c_514,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X2)) ),
inference(superposition,[status(thm)],[c_341,c_424]) ).
tcf(c_613,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_476,c_139]) ).
tcf(c_759,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X1)))),
inference(superposition,[status(thm)],[c_476,c_514]) ).
tcf(c_879,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
inference(superposition,[status(thm)],[c_759,c_613]) ).
tcf(c_981,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),X1))),
inference(superposition,[status(thm)],[c_879,c_424]) ).
tcf(c_1181,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
inference(superposition,[status(thm)],[c_981,c_180]) ).
tcf(c_1191,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_510,c_1181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL009-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.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 21:36:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.58/1.18 % SZS status Started for theBenchmark.p
% 3.58/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.58/1.18
% 3.58/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.58/1.18
% 3.58/1.18 % ------ iProver source info
% 3.58/1.18
% 3.58/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.58/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.58/1.18 % git: non_committed_changes: false
% 3.58/1.18
% 3.58/1.18 % ------ Parsing...% successful
% 3.58/1.18
% 3.58/1.18
% 3.58/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.58/1.18
% 3.58/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.58/1.18
% 3.58/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.58/1.18 % ------ Proving...
% 3.58/1.18 % ------ Problem Properties
% 3.58/1.18
% 3.58/1.18 %
% 3.58/1.18 % clauses 3
% 3.58/1.18 % conjectures 1
% 3.58/1.18 % EPR 0
% 3.58/1.18 % Horn 3
% 3.58/1.18 % unary 2
% 3.58/1.18 % binary 0
% 3.58/1.18 % lits 5
% 3.58/1.18 % lits eq 0
% 3.58/1.18 % fd_pure 0
% 3.58/1.18 % fd_pseudo 0
% 3.58/1.18 % fd_cond 0
% 3.58/1.18 % fd_pseudo_cond 0
% 3.58/1.18 % AC symbols 0
% 3.58/1.18
% 3.58/1.18 % ------ Schedule dynamic 5 is on
% 3.58/1.18
% 3.58/1.18 % ------ no equalities: superposition off
% 3.58/1.18
% 3.58/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.58/1.18
% 3.58/1.18
% 3.58/1.18 % ------
% 3.58/1.18 % Current options:
% 3.58/1.18 % ------
% 3.58/1.18
% 3.58/1.18
% 3.58/1.18 %
% 3.58/1.18
% 3.58/1.18 % ------ Proving...
% 3.58/1.18 %
% 3.58/1.18
% 3.58/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.58/1.18
% 3.58/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.58/1.18
% 3.58/1.18
%------------------------------------------------------------------------------