%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL129-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 : n017.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:44 PM UTC 2026
% Result : Unsatisfiable 106.35s 34.66s
% Output : CNFRefutation 106.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 19 |; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?; 75 :)
% 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,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_4) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
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,X3: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X0,equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_83,c_52]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X4,X2)),X3))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X4)))) ),
inference(superposition,[status(thm)],[c_53,c_86]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(X1,X2)))),
inference(superposition,[status(thm)],[c_53,c_90]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X0,X3))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X2)))) ),
inference(superposition,[status(thm)],[c_97,c_86]) ).
tcf(c_107,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_97,c_100]) ).
tcf(c_1613,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_1617,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X0,equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_1613,c_52]) ).
tcf(c_1621,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X4,X2)),X3))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X4)))) ),
inference(superposition,[status(thm)],[c_53,c_1617]) ).
tcf(c_1622,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(equivalent(X4,X3))
| ~ is_a_theorem(equivalent(X0,equivalent(X4,X2)))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,X1))) ),
inference(superposition,[status(thm)],[c_1613,c_1617]) ).
tcf(c_1623,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_107,c_1617]) ).
tcf(c_1632,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0)),
inference(superposition,[status(thm)],[c_107,c_1621]) ).
tcf(c_1634,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X0,X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X2)),equivalent(X3,X1))) ),
inference(superposition,[status(thm)],[c_1632,c_1617]) ).
tcf(c_1640,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
inference(superposition,[status(thm)],[c_53,c_1634]) ).
tcf(c_1703,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(equivalent(X1,equivalent(equivalent(X0,equivalent(equivalent(X3,X4),X2)),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_1640,c_1622]) ).
tcf(c_2281,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(equivalent(X1,equivalent(X0,equivalent(equivalent(X3,X2),X4))))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),X4))) ),
inference(superposition,[status(thm)],[c_1703,c_1623]) ).
tcf(c_2324,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,X3),equivalent(X1,X3))))),
inference(superposition,[status(thm)],[c_53,c_2281]) ).
tcf(c_2815,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))),
inference(superposition,[status(thm)],[c_2324,c_2281]) ).
tcf(c_2846,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_2815]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL129-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.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 21:57:30 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 106.35/34.66 % SZS status Started for theBenchmark.p
% 106.35/34.66 % SZS status Unsatisfiable for theBenchmark.p
% 106.35/34.66
% 106.35/34.66 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 106.35/34.66
% 106.35/34.66 % ------ iProver source info
% 106.35/34.66
% 106.35/34.66 % git: date: 2026-07-19 20:42:38 +0200
% 106.35/34.66 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 106.35/34.66 % git: non_committed_changes: false
% 106.35/34.66
% 106.35/34.66 % ------ Parsing...% successful
% 106.35/34.66
% 106.35/34.66
% 106.35/34.66 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 106.35/34.66
% 106.35/34.66 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 106.35/34.66
% 106.35/34.66 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 106.35/34.66 % ------ Proving...
% 106.35/34.66 % ------ Problem Properties
% 106.35/34.66
% 106.35/34.66 %
% 106.35/34.66 % clauses 3
% 106.35/34.66 % conjectures 1
% 106.35/34.66 % EPR 0
% 106.35/34.66 % Horn 3
% 106.35/34.66 % unary 2
% 106.35/34.66 % binary 0
% 106.35/34.66 % lits 5
% 106.35/34.66 % lits eq 0
% 106.35/34.66 % fd_pure 0
% 106.35/34.66 % fd_pseudo 0
% 106.35/34.66 % fd_cond 0
% 106.35/34.66 % fd_pseudo_cond 0
% 106.35/34.66 % AC symbols 0
% 106.35/34.66
% 106.35/34.66 % ------ Input Options Time Limit: Unbounded
% 106.35/34.66
% 106.35/34.66
% 106.35/34.66 % ------
% 106.35/34.66 % Current options:
% 106.35/34.66 % ------
% 106.35/34.66
% 106.35/34.66
% 106.35/34.66 %
% 106.35/34.66
% 106.35/34.66 % ------ Proving...
% 106.35/34.66 %
% 106.35/34.66
% 106.35/34.66 % SZS status Unsatisfiable for theBenchmark.p
% 106.35/34.66
% 106.35/34.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 106.35/34.67
% 106.35/34.67
%------------------------------------------------------------------------------