%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL024-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 : n013.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:27 PM UTC 2026
% Result : Unsatisfiable 57.24s 16.87s
% Output : CNFRefutation 57.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of formulae : 39 ( 13 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 74 ( 38 ~; 36 |; 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(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xgk) ).
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(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))),
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_83,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_84,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(superposition,[status(thm)],[c_83,c_52]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,equivalent(X0,X2)),X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_84]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_85,c_52]) ).
tcf(c_128,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(superposition,[status(thm)],[c_125,c_52]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2)) ),
inference(superposition,[status(thm)],[c_53,c_126]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X2)))) ),
inference(superposition,[status(thm)],[c_125,c_126]) ).
tcf(c_471,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_85,c_52]) ).
tcf(c_525,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X0,equivalent(X1,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_142]) ).
tcf(c_550,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_525,c_52]) ).
tcf(c_554,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_525,c_471]) ).
tcf(c_556,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X2)))) ),
inference(superposition,[status(thm)],[c_525,c_141]) ).
tcf(c_563,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_53,c_550]) ).
tcf(c_693,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
inference(superposition,[status(thm)],[c_53,c_556]) ).
tcf(c_699,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(X1,X1)))),
inference(superposition,[status(thm)],[c_563,c_556]) ).
tcf(c_748,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,equivalent(X0,equivalent(X2,X2)))))),
inference(superposition,[status(thm)],[c_693,c_556]) ).
tcf(c_756,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X1))) ),
inference(superposition,[status(thm)],[c_699,c_554]) ).
tcf(c_800,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X2,X2))))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_85,c_756]) ).
tcf(c_854,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X2)))) ),
inference(superposition,[status(thm)],[c_748,c_128]) ).
tcf(c_69653,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_85,c_52]) ).
tcf(c_70103,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_800,c_854]) ).
tcf(c_70191,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)),X2)),
inference(superposition,[status(thm)],[c_53,c_70103]) ).
tcf(c_70194,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X0,X2))))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_85,c_70103]) ).
tcf(c_70295,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X1)))),
inference(superposition,[status(thm)],[c_70191,c_141]) ).
tcf(c_70303,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,equivalent(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_70295,c_52]) ).
tcf(c_70311,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(equivalent(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_70303,c_70103]) ).
tcf(c_72578,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_70194,c_69653]) ).
tcf(c_77540,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,X0)),X3)) ),
inference(superposition,[status(thm)],[c_53,c_72578]) ).
tcf(c_78424,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X1,X0)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_70311,c_77540]) ).
tcf(c_105084,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,equivalent(X0,X2)),X2))),
inference(superposition,[status(thm)],[c_53,c_78424]) ).
tcf(c_105488,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X2),equivalent(X1,X0))),
inference(superposition,[status(thm)],[c_105084,c_70103]) ).
tcf(c_107239,plain,
$false,
inference(superposition,[status(thm)],[c_105488,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL024-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 : n013.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:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 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.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 57.24/16.87 % SZS status Started for theBenchmark.p
% 57.24/16.87 % SZS status Unsatisfiable for theBenchmark.p
% 57.24/16.87
% 57.24/16.87 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 57.24/16.87
% 57.24/16.87 % ------ iProver source info
% 57.24/16.87
% 57.24/16.87 % git: date: 2026-07-19 20:42:38 +0200
% 57.24/16.87 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 57.24/16.87 % git: non_committed_changes: false
% 57.24/16.87
% 57.24/16.87 % ------ Parsing...% successful
% 57.24/16.87
% 57.24/16.87
% 57.24/16.87 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 57.24/16.87
% 57.24/16.87 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 57.24/16.87
% 57.24/16.87 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 57.24/16.87 % ------ Proving...
% 57.24/16.87 % ------ Problem Properties
% 57.24/16.87
% 57.24/16.87 %
% 57.24/16.87 % clauses 3
% 57.24/16.87 % conjectures 1
% 57.24/16.87 % EPR 0
% 57.24/16.87 % Horn 3
% 57.24/16.87 % unary 2
% 57.24/16.87 % binary 0
% 57.24/16.87 % lits 5
% 57.24/16.87 % lits eq 0
% 57.24/16.87 % fd_pure 0
% 57.24/16.87 % fd_pseudo 0
% 57.24/16.87 % fd_cond 0
% 57.24/16.87 % fd_pseudo_cond 0
% 57.24/16.87 % AC symbols 0
% 57.24/16.87
% 57.24/16.87 % ------ Input Options Time Limit: Unbounded
% 57.24/16.87
% 57.24/16.87
% 57.24/16.87 % ------
% 57.24/16.87 % Current options:
% 57.24/16.87 % ------
% 57.24/16.87
% 57.24/16.87
% 57.24/16.87 %
% 57.24/16.87
% 57.24/16.87 % ------ Proving...
% 57.24/16.87 %
% 57.24/16.87
% 57.24/16.87 % SZS status Unsatisfiable for theBenchmark.p
% 57.24/16.87
% 57.24/16.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 57.24/16.87
% 57.24/16.87
%------------------------------------------------------------------------------