%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL064-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 : 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:05:32 PM UTC 2026
% Result : Unsatisfiable 22.01s 3.83s
% Output : CNFRefutation 22.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 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 : 45 ( 0 sgn 45 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_56,c_54]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_69,c_54]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_65,c_87]) ).
tcf(c_176,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X1,X3))))
| ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X3)))) ),
inference(superposition,[status(thm)],[c_56,c_120]) ).
tcf(c_179,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X3,implies(X0,X2)))
| ~ is_a_theorem(implies(X3,implies(X0,X1)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_69,c_120]) ).
tcf(c_358,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(X4,implies(X0,implies(X1,X3))))
| ~ is_a_theorem(implies(X4,implies(X0,implies(X1,X2))))
| ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X3)))) ),
inference(superposition,[status(thm)],[c_176,c_179]) ).
tcf(c_1616,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X2))))
| ~ is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X1)))) ),
inference(superposition,[status(thm)],[c_55,c_358]) ).
tcf(c_33371,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_1616]) ).
tcf(c_33496,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_33371]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL064-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.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 21:48:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 22.01/3.83 % SZS status Started for theBenchmark.p
% 22.01/3.83 % SZS status Unsatisfiable for theBenchmark.p
% 22.01/3.83
% 22.01/3.83 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 22.01/3.83
% 22.01/3.83 % ------ iProver source info
% 22.01/3.83
% 22.01/3.83 % git: date: 2026-07-19 20:42:38 +0200
% 22.01/3.83 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 22.01/3.83 % git: non_committed_changes: false
% 22.01/3.83
% 22.01/3.83 % ------ Parsing...% successful
% 22.01/3.83
% 22.01/3.83
% 22.01/3.83 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 22.01/3.83 % ------ Proving...
% 22.01/3.83 % ------ Problem Properties
% 22.01/3.83
% 22.01/3.83 %
% 22.01/3.83 % clauses 5
% 22.01/3.83 % conjectures 1
% 22.01/3.83 % EPR 0
% 22.01/3.83 % Horn 5
% 22.01/3.83 % unary 4
% 22.01/3.83 % binary 0
% 22.01/3.83 % lits 7
% 22.01/3.83 % lits eq 0
% 22.01/3.83 % fd_pure 0
% 22.01/3.83 % fd_pseudo 0
% 22.01/3.83 % fd_cond 0
% 22.01/3.83 % fd_pseudo_cond 0
% 22.01/3.83 % AC symbols 0
% 22.01/3.83
% 22.01/3.83 % ------ Input Options Time Limit: Unbounded
% 22.01/3.83
% 22.01/3.83
% 22.01/3.83 % ------
% 22.01/3.83 % Current options:
% 22.01/3.83 % ------
% 22.01/3.83
% 22.01/3.83
% 22.01/3.83 %
% 22.01/3.83
% 22.01/3.83 % ------ Proving...
% 22.01/3.83 %
% 22.01/3.83
% 22.01/3.83 % SZS status Unsatisfiable for theBenchmark.p
% 22.01/3.83
% 22.01/3.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 22.01/3.83
% 22.01/3.83
%------------------------------------------------------------------------------