%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL014-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 : n020.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 63.19s 10.33s
% Output : CNFRefutation 63.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 18 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 25 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 95 ( 0 sgn 95 !; 0 ?; 90 :)
% 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(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X0,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wn) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xgf) ).
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(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X0,X1)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,X1)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),
inference(superposition,[status(thm)],[c_53,c_72]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_75,c_52]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X0))))),
inference(superposition,[status(thm)],[c_75,c_72]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,X1)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X0))))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_86,c_52]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_85,c_52]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),
inference(superposition,[status(thm)],[c_53,c_106]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),equivalent(equivalent(X2,X1),X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_107,c_106]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2)) ),
inference(superposition,[status(thm)],[c_53,c_111]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,equivalent(X1,X2)))) ),
inference(superposition,[status(thm)],[c_122,c_111]) ).
tcf(c_211,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X1))) ),
inference(superposition,[status(thm)],[c_152,c_162]) ).
tcf(c_215,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X1))),
inference(superposition,[status(thm)],[c_86,c_163]) ).
tcf(c_297,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_215,c_52]) ).
tcf(c_301,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_297,c_52]) ).
tcf(c_305,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X0)) ),
inference(superposition,[status(thm)],[c_215,c_301]) ).
tcf(c_353,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_85,c_305]) ).
tcf(c_409,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X1,X2),X0))))),
inference(superposition,[status(thm)],[c_53,c_211]) ).
tcf(c_565,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,X1)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_1049,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X0),X2)),equivalent(X2,X1))),
inference(superposition,[status(thm)],[c_409,c_565]) ).
tcf(c_39073,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,X1)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_39323,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X2))) ),
inference(superposition,[status(thm)],[c_1049,c_52]) ).
tcf(c_39381,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(equivalent(X0,X1),X2)),X2))),
inference(superposition,[status(thm)],[c_1049,c_39073]) ).
tcf(c_39407,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),X0),X2)),X1)),
inference(superposition,[status(thm)],[c_409,c_39323]) ).
tcf(c_39845,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X0),X2)),X2),X1)),
inference(superposition,[status(thm)],[c_39381,c_353]) ).
tcf(c_40038,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X0,X2),X1),X2)))),
inference(superposition,[status(thm)],[c_39407,c_353]) ).
tcf(c_41195,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X0),equivalent(X2,X1))),X2)),
inference(superposition,[status(thm)],[c_39845,c_162]) ).
tcf(c_42416,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X1),equivalent(X0,X2))),
inference(superposition,[status(thm)],[c_40038,c_39073]) ).
tcf(c_43936,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X1)) ),
inference(superposition,[status(thm)],[c_42416,c_52]) ).
tcf(c_47832,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
inference(superposition,[status(thm)],[c_41195,c_43936]) ).
tcf(c_47906,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_47832]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL014-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.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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:37:05 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 63.19/10.33 % SZS status Started for theBenchmark.p
% 63.19/10.33 % SZS status Unsatisfiable for theBenchmark.p
% 63.19/10.33
% 63.19/10.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 63.19/10.33
% 63.19/10.33 % ------ iProver source info
% 63.19/10.33
% 63.19/10.33 % git: date: 2026-07-19 20:42:38 +0200
% 63.19/10.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 63.19/10.33 % git: non_committed_changes: false
% 63.19/10.33
% 63.19/10.33 % ------ Parsing...% successful
% 63.19/10.33
% 63.19/10.33
% 63.19/10.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 63.19/10.33
% 63.19/10.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 63.19/10.33
% 63.19/10.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 63.19/10.33 % ------ Proving...
% 63.19/10.33 % ------ Problem Properties
% 63.19/10.33
% 63.19/10.33 %
% 63.19/10.33 % clauses 3
% 63.19/10.33 % conjectures 1
% 63.19/10.33 % EPR 0
% 63.19/10.33 % Horn 3
% 63.19/10.33 % unary 2
% 63.19/10.33 % binary 0
% 63.19/10.33 % lits 5
% 63.19/10.33 % lits eq 0
% 63.19/10.33 % fd_pure 0
% 63.19/10.33 % fd_pseudo 0
% 63.19/10.33 % fd_cond 0
% 63.19/10.33 % fd_pseudo_cond 0
% 63.19/10.33 % AC symbols 0
% 63.19/10.33
% 63.19/10.33 % ------ Input Options Time Limit: Unbounded
% 63.19/10.33
% 63.19/10.33
% 63.19/10.33 % ------
% 63.19/10.33 % Current options:
% 63.19/10.33 % ------
% 63.19/10.33
% 63.19/10.33
% 63.19/10.33 %
% 63.19/10.33
% 63.19/10.33 % ------ Proving...
% 63.19/10.33 %
% 63.19/10.33
% 63.19/10.33 % SZS status Unsatisfiable for theBenchmark.p
% 63.19/10.33
% 63.19/10.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 63.19/10.33
% 63.19/10.33
%------------------------------------------------------------------------------