%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.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:06:34 PM UTC 2026
% Result : Unsatisfiable 10.50s 7.30s
% Output : CNFRefutation 10.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of formulae : 47 ( 8 unt; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 134 ( 68 ~; 66 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 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 : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 121 ( 0 sgn 121 !; 0 ?; 116 :)
% 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(X0,equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xcb) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).
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(equivalent(X0,X1),equivalent(X2,X1)),X2))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_85,c_52]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_94]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_101,c_52]) ).
tcf(c_135,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X3,X2)),X3)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_115]) ).
tcf(c_221,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_224,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),X2))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_221,c_115]) ).
tcf(c_289,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X3,X2)),X3))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_135,c_52]) ).
tcf(c_632,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(X3)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X3,X2))) ),
inference(superposition,[status(thm)],[c_289,c_52]) ).
tcf(c_1151,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(X2,X3)))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_632]) ).
tcf(c_1687,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)) ),
inference(superposition,[status(thm)],[c_1151,c_52]) ).
tcf(c_3005,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_3008,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_3005,c_52]) ).
tcf(c_3015,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_3008]) ).
tcf(c_3065,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_3005,c_1687]) ).
tcf(c_3066,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X1,X2)))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_3015,c_1687]) ).
tcf(c_3075,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_3065]) ).
tcf(c_3101,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_3075,c_3008]) ).
tcf(c_3113,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_3075,c_3101]) ).
tcf(c_3253,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X3,equivalent(X2,X3)))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_3113,c_3066]) ).
tcf(c_4444,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_4447,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_4444,c_52]) ).
tcf(c_4454,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_4447]) ).
tcf(c_4470,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X1,X2)))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_3253]) ).
tcf(c_4488,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,equivalent(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_4470]) ).
tcf(c_4497,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_4488,c_52]) ).
tcf(c_4504,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_4497,c_224]) ).
tcf(c_4514,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X1,X0),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_4504]) ).
tcf(c_4528,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_4514,c_4447]) ).
tcf(c_4532,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X2)) ),
inference(superposition,[status(thm)],[c_53,c_4528]) ).
tcf(c_4534,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X0),X1))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_4454,c_4528]) ).
tcf(c_4736,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X0)) ),
inference(superposition,[status(thm)],[c_4534,c_4532]) ).
tcf(c_4737,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X0))) ),
inference(superposition,[status(thm)],[c_4534,c_4447]) ).
tcf(c_4742,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_4737]) ).
tcf(c_4751,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(superposition,[status(thm)],[c_53,c_4742]) ).
tcf(c_4961,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X2))) ),
inference(superposition,[status(thm)],[c_4444,c_4736]) ).
tcf(c_5587,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_4751,c_4961]) ).
tcf(c_5611,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_5587,c_115]) ).
tcf(c_5660,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_4751,c_5611]) ).
tcf(c_5662,plain,
is_a_theorem(equivalent(a,a)),
inference(instantiation,[status(thm)],[c_5660]) ).
tcf(c_5663,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_5662,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n019.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Wed Sep 23 23:14:56 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 10.50/7.30 % SZS status Started for theBenchmark.p
% 10.50/7.30 % SZS status Unsatisfiable for theBenchmark.p
% 10.50/7.30
% 10.50/7.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.50/7.30
% 10.50/7.30 % ------ iProver source info
% 10.50/7.30
% 10.50/7.30 % git: date: 2026-07-19 20:42:38 +0200
% 10.50/7.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.50/7.30 % git: non_committed_changes: false
% 10.50/7.30
% 10.50/7.30 % ------ Parsing...% successful
% 10.50/7.30
% 10.50/7.30
% 10.50/7.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.50/7.30
% 10.50/7.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 10.50/7.30
% 10.50/7.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.50/7.30 % ------ Proving...
% 10.50/7.30 % ------ Problem Properties
% 10.50/7.30
% 10.50/7.30 %
% 10.50/7.30 % clauses 3
% 10.50/7.30 % conjectures 1
% 10.50/7.30 % EPR 0
% 10.50/7.30 % Horn 3
% 10.50/7.30 % unary 2
% 10.50/7.30 % binary 0
% 10.50/7.30 % lits 5
% 10.50/7.30 % lits eq 0
% 10.50/7.30 % fd_pure 0
% 10.50/7.30 % fd_pseudo 0
% 10.50/7.30 % fd_cond 0
% 10.50/7.30 % fd_pseudo_cond 0
% 10.50/7.30 % AC symbols 0
% 10.50/7.30
% 10.50/7.30 % ------ Input Options Time Limit: Unbounded
% 10.50/7.30
% 10.50/7.30
% 10.50/7.30 % ------
% 10.50/7.30 % Current options:
% 10.50/7.30 % ------
% 10.50/7.30
% 10.50/7.30
% 10.50/7.30 %
% 10.50/7.30
% 10.50/7.30 % ------ Proving...
% 10.50/7.30 %
% 10.50/7.30
% 10.50/7.30 % SZS status Unsatisfiable for theBenchmark.p
% 10.50/7.30
% 10.50/7.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.50/7.30
% 10.50/7.30
%------------------------------------------------------------------------------