%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL018-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 : n012.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:26 PM UTC 2026
% Result : Unsatisfiable 41.10s 10.68s
% Output : CNFRefutation 41.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 15 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 33 ~; 31 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 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 : 88 ( 0 sgn 88 !; 0 ?; 83 :)
% 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(equivalent(equivalent(X0,equivalent(X1,X2)),X1),equivalent(X2,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pym) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_pyo) ).
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,equivalent(X1,X2)),X1),equivalent(X2,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X1)) ),
inference(resolution,[status(thm)],[c_52,c_53]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X0),X2)))),
inference(resolution,[status(thm)],[c_80,c_53]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X0),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_86,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X0),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_90,c_52]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[status(thm)],[c_98,c_52]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),equivalent(X2,X3)),X1))) ),
inference(resolution,[status(thm)],[c_112,c_86]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_112,c_98]) ).
tcf(c_210,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_153,c_53]) ).
tcf(c_262,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[c_210,c_80]) ).
tcf(c_399,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[c_151,c_90]) ).
tcf(c_500,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X0)),X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[c_399,c_53]) ).
tcf(c_591,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X0)),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_262,c_53]) ).
tcf(c_595,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X0),X2),X1),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_262,c_86]) ).
tcf(c_618,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[c_591,c_262]) ).
tcf(c_1292,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X0)) ),
inference(resolution,[status(thm)],[c_618,c_86]) ).
tcf(c_1417,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X1,X0)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[c_1292,c_500]) ).
tcf(c_1422,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_1292,c_595]) ).
tcf(c_1477,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[c_1422,c_80]) ).
tcf(c_1506,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),X2),X1)),X2)),
inference(resolution,[status(thm)],[c_1477,c_86]) ).
tcf(c_3558,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,equivalent(X2,X0)),X2),X1))),
inference(resolution,[status(thm)],[c_1506,c_1292]) ).
tcf(c_4225,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X1),X0),X2)),
inference(resolution,[status(thm)],[c_3558,c_1477]) ).
tcf(c_4455,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),equivalent(X2,X1)),X2))),
inference(resolution,[status(thm)],[c_4225,c_80]) ).
tcf(c_7755,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X0,X1)),X2))),
inference(resolution,[status(thm)],[c_1417,c_4455]) ).
tcf(c_9037,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),X1),X2)),
inference(resolution,[status(thm)],[c_7755,c_1477]) ).
tcf(c_11406,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[c_9037,c_80]) ).
tcf(c_16711,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,equivalent(X0,X2)),X2))),
inference(resolution,[status(thm)],[c_11406,c_1417]) ).
tcf(c_22223,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X2),equivalent(X1,X0))),
inference(resolution,[status(thm)],[c_16711,c_1477]) ).
tcf(c_25967,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_22223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL018-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Wed Sep 23 21:37:05 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.33
% 0.03/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.33
% 0.03/0.33 % Detected problem language: tptp
% 0.07/0.33 % Proving...
% 41.10/10.68 % SZS status Started for theBenchmark.p
% 41.10/10.68 % SZS status Unsatisfiable for theBenchmark.p
% 41.10/10.68
% 41.10/10.68 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 41.10/10.68
% 41.10/10.68 % ------ iProver source info
% 41.10/10.68
% 41.10/10.68 % git: date: 2026-07-19 20:42:38 +0200
% 41.10/10.68 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 41.10/10.68 % git: non_committed_changes: false
% 41.10/10.68
% 41.10/10.68 % ------ Parsing...% successful
% 41.10/10.68
% 41.10/10.68
% 41.10/10.68 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 41.10/10.68
% 41.10/10.68 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 41.10/10.68
% 41.10/10.68 % ------ Preprocessing...
% 41.10/10.68 % ------ Proving...
% 41.10/10.68 % ------ Problem Properties
% 41.10/10.68
% 41.10/10.68 %
% 41.10/10.68 % clauses 3
% 41.10/10.68 % conjectures 1
% 41.10/10.68 % EPR 0
% 41.10/10.68 % Horn 3
% 41.10/10.68 % unary 2
% 41.10/10.68 % binary 0
% 41.10/10.68 % lits 5
% 41.10/10.68 % lits eq 0
% 41.10/10.68 % fd_pure 0
% 41.10/10.68 % fd_pseudo 0
% 41.10/10.68 % fd_cond 0
% 41.10/10.68 % fd_pseudo_cond 0
% 41.10/10.68 % AC symbols 0
% 41.10/10.68
% 41.10/10.68 % ------ Input Options Time Limit: Unbounded
% 41.10/10.68
% 41.10/10.68
% 41.10/10.68 % ------
% 41.10/10.68 % Current options:
% 41.10/10.68 % ------
% 41.10/10.68
% 41.10/10.68
% 41.10/10.68 %
% 41.10/10.68
% 41.10/10.68 % ------ Proving...
% 41.10/10.68 %
% 41.10/10.68
% 41.10/10.68 % SZS status Unsatisfiable for theBenchmark.p
% 41.10/10.68
% 41.10/10.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 41.10/10.68
% 41.10/10.68
%------------------------------------------------------------------------------