%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL097-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 : n015.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:38 PM UTC 2026
% Result : Unsatisfiable 3.86s 1.28s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 13 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?; 47 :)
% 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(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_4) ).
tcf(c_53,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_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(X4)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4)) ),
inference(superposition,[status(thm)],[c_55,c_53]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(superposition,[status(thm)],[c_54,c_64]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(superposition,[status(thm)],[c_55,c_64]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(superposition,[status(thm)],[c_74,c_64]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X0),equivalent(equivalent(X3,X4),X1)))),
inference(superposition,[status(thm)],[c_75,c_64]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3)) ),
inference(superposition,[status(thm)],[c_83,c_53]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),X6)),equivalent(equivalent(X1,X2),equivalent(equivalent(X4,X5),X6)))),
inference(superposition,[status(thm)],[c_90,c_64]) ).
tcf(c_294,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))),
inference(superposition,[status(thm)],[c_133,c_106]) ).
tcf(c_295,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_294]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL097-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.08/0.36 % Computer : n015.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 21:58:10 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 3.86/1.28 % SZS status Started for theBenchmark.p
% 3.86/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.28
% 3.86/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.86/1.28
% 3.86/1.28 % ------ iProver source info
% 3.86/1.28
% 3.86/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.86/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.86/1.28 % git: non_committed_changes: false
% 3.86/1.28
% 3.86/1.28 % ------ Parsing...% successful
% 3.86/1.28
% 3.86/1.28
% 3.86/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.86/1.28 % ------ Proving...
% 3.86/1.28 % ------ Problem Properties
% 3.86/1.28
% 3.86/1.28 %
% 3.86/1.28 % clauses 4
% 3.86/1.28 % conjectures 1
% 3.86/1.28 % EPR 0
% 3.86/1.28 % Horn 4
% 3.86/1.28 % unary 3
% 3.86/1.28 % binary 0
% 3.86/1.28 % lits 6
% 3.86/1.28 % lits eq 0
% 3.86/1.28 % fd_pure 0
% 3.86/1.28 % fd_pseudo 0
% 3.86/1.28 % fd_cond 0
% 3.86/1.28 % fd_pseudo_cond 0
% 3.86/1.28 % AC symbols 0
% 3.86/1.28
% 3.86/1.28 % ------ Input Options Time Limit: Unbounded
% 3.86/1.28
% 3.86/1.28
% 3.86/1.28 % ------
% 3.86/1.28 % Current options:
% 3.86/1.28 % ------
% 3.86/1.28
% 3.86/1.28
% 3.86/1.28 %
% 3.86/1.28
% 3.86/1.28 % ------ Proving...
% 3.86/1.28 %
% 3.86/1.28
% 3.86/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.86/1.28
% 3.86/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.86/1.28
% 3.86/1.28
%------------------------------------------------------------------------------