%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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:08:47 PM UTC 2026
% Result : Theorem 4.07s 1.41s
% Output : CNFRefutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 22 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 65 !; 3 ?; 45 :)
% 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,X2,X3,X4] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5) ).
fof(f3,conjecture,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).
fof(f4,negated_conjecture,
~ ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
inference(cnf_transformation,[],[f2]) ).
fof(f9,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
inference(cnf_transformation,[],[f8]) ).
tcf(c_51,negated_conjecture,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(X4,X1))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X3,implies(not(X1),not(X4))))) ),
inference(superposition,[status(thm)],[c_56,c_49]) ).
tcf(c_70,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_56,c_62]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( is_a_theorem(implies(X0,implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_50,c_70]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( is_a_theorem(implies(X0,implies(X5,X2)))
| ~ is_a_theorem(implies(X5,X4))
| ~ is_a_theorem(implies(X0,implies(implies(X1,implies(X2,X3)),implies(X4,implies(not(X2),not(X5)))))) ),
inference(superposition,[status(thm)],[c_56,c_70]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X0,implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_82,c_83]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( is_a_theorem(implies(implies(X5,X4),implies(X0,implies(X5,X2))))
| ~ is_a_theorem(implies(X0,implies(implies(X1,implies(X2,X3)),implies(X4,implies(not(X2),not(X5)))))) ),
inference(superposition,[status(thm)],[c_50,c_122]) ).
tcf(c_540,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_50,c_204]) ).
tcf(c_547,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_540]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.19/0.44 % Computer : n020.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Thu Sep 24 00:46:03 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.23/0.52
% 0.23/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.52
% 0.23/0.52 % Detected problem language: tptp
% 0.23/0.53 % Proving...
% 4.07/1.41 % SZS status Started for theBenchmark.p
% 4.07/1.41 % SZS status Theorem for theBenchmark.p
% 4.07/1.41
% 4.07/1.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.07/1.41
% 4.07/1.41 % ------ iProver source info
% 4.07/1.41
% 4.07/1.41 % git: date: 2026-07-19 20:42:38 +0200
% 4.07/1.41 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.07/1.41 % git: non_committed_changes: false
% 4.07/1.41
% 4.07/1.41 % ------ Parsing...
% 4.07/1.41 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.07/1.41 % ------ Proving...
% 4.07/1.41 % ------ Problem Properties
% 4.07/1.41
% 4.07/1.41 %
% 4.07/1.41 % clauses 3
% 4.07/1.41 % conjectures 1
% 4.07/1.41 % EPR 0
% 4.07/1.41 % Horn 3
% 4.07/1.41 % unary 2
% 4.07/1.41 % binary 0
% 4.07/1.41 % lits 5
% 4.07/1.41 % lits eq 0
% 4.07/1.41 % fd_pure 0
% 4.07/1.41 % fd_pseudo 0
% 4.07/1.41 % fd_cond 0
% 4.07/1.41 % fd_pseudo_cond 0
% 4.07/1.41 % AC symbols 0
% 4.07/1.41
% 4.07/1.41 % ------ Input Options Time Limit: Unbounded
% 4.07/1.41
% 4.07/1.41
% 4.07/1.41 % ------
% 4.07/1.41 % Current options:
% 4.07/1.41 % ------
% 4.07/1.41
% 4.07/1.41
% 4.07/1.41 %
% 4.07/1.41
% 4.07/1.41 % ------ Proving...
% 4.07/1.41 %
% 4.07/1.41
% 4.07/1.41 % SZS status Theorem for theBenchmark.p
% 4.07/1.41
% 4.07/1.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.07/1.41
% 4.07/1.41
%------------------------------------------------------------------------------