%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL384+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 : n012.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:06:29 PM UTC 2026
% Result : Theorem 164.00s 24.69s
% Output : CNFRefutation 164.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 22 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 35 ~; 30 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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; 3 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 93 !; 0 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f5,conjecture,
is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_45) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f9,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(cnf_transformation,[],[f7]) ).
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,[],[f10]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(cnf_transformation,[],[f14]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_49,c_52]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_50,c_49]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_121,c_49]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(not(X1),X1))) ),
inference(resolution,[status(thm)],[c_129,c_51]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_129,c_52]) ).
tcf(c_143,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(resolution,[status(thm)],[c_129,c_121]) ).
tcf(c_177,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[status(thm)],[c_138,c_51]) ).
tcf(c_223,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_140,c_49]) ).
tcf(c_226,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X2,implies(not(X1),X3)))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_140,c_129]) ).
tcf(c_373,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(implies(X3,X1),implies(X0,implies(X3,X2))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[c_143,c_50]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(implies(X0,not(X1))) ),
inference(resolution,[status(thm)],[c_143,c_52]) ).
tcf(c_589,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[c_377,c_138]) ).
tcf(c_614,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_589,c_93]) ).
tcf(c_626,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),X0)) ),
inference(resolution,[status(thm)],[c_614,c_138]) ).
tcf(c_895,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(not(implies(X2,X1)),X3))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_223,c_121]) ).
tcf(c_1001,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(implies(X2,X0),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
inference(resolution,[status(thm)],[c_226,c_50]) ).
tcf(c_1024,plain,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(resolution,[status(thm)],[c_373,c_53]) ).
tcf(c_1027,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X0,X2),implies(X0,X1)))
| ~ is_a_theorem(implies(not(implies(X0,X1)),implies(X2,X1))) ),
inference(resolution,[status(thm)],[c_373,c_138]) ).
tcf(c_6464,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(not(implies(X0,X2)),X3))
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(resolution,[status(thm)],[c_895,c_52]) ).
tcf(c_45701,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(implies(implies(not(X0),X0),X0)),X1)),
inference(resolution,[status(thm)],[c_6464,c_177]) ).
tcf(c_52453,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[status(thm)],[c_45701,c_626]) ).
tcf(c_53288,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1))),
inference(resolution,[status(thm)],[c_52453,c_1027]) ).
tcf(c_66261,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(not(X0),X1),implies(not(implies(implies(X1,X0),X0)),X2))),
inference(resolution,[status(thm)],[c_53288,c_1001]) ).
tcf(c_287739,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X0),X0))),
inference(resolution,[status(thm)],[c_66261,c_138]) ).
tcf(c_289514,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1024,c_287739]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL384+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Wed Sep 23 23:06:05 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.03/0.29 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.06/0.33
% 0.06/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.06/0.33
% 0.06/0.33 % Detected problem language: tptp
% 0.06/0.34 % Proving...
% 164.00/24.69 % SZS status Started for theBenchmark.p
% 164.00/24.69 % SZS status Theorem for theBenchmark.p
% 164.00/24.69
% 164.00/24.69 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 164.00/24.69
% 164.00/24.69 % ------ iProver source info
% 164.00/24.69
% 164.00/24.69 % git: date: 2026-07-19 20:42:38 +0200
% 164.00/24.69 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 164.00/24.69 % git: non_committed_changes: false
% 164.00/24.69
% 164.00/24.69 % ------ Parsing...
% 164.00/24.69 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 164.00/24.69
% 164.00/24.69 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 164.00/24.69
% 164.00/24.69 % ------ Preprocessing...
% 164.00/24.69 % ------ Proving...
% 164.00/24.69 % ------ Problem Properties
% 164.00/24.69
% 164.00/24.69 %
% 164.00/24.69 % clauses 5
% 164.00/24.69 % conjectures 1
% 164.00/24.69 % EPR 0
% 164.00/24.69 % Horn 5
% 164.00/24.69 % unary 4
% 164.00/24.69 % binary 0
% 164.00/24.69 % lits 7
% 164.00/24.69 % lits eq 0
% 164.00/24.69 % fd_pure 0
% 164.00/24.69 % fd_pseudo 0
% 164.00/24.69 % fd_cond 0
% 164.00/24.69 % fd_pseudo_cond 0
% 164.00/24.69 % AC symbols 0
% 164.00/24.69
% 164.00/24.69 % ------ Input Options Time Limit: Unbounded
% 164.00/24.69
% 164.00/24.69
% 164.00/24.69 % ------
% 164.00/24.69 % Current options:
% 164.00/24.69 % ------
% 164.00/24.69
% 164.00/24.69
% 164.00/24.69 %
% 164.00/24.69
% 164.00/24.69 % ------ Proving...
% 164.00/24.69 %
% 164.00/24.69
% 164.00/24.69 % SZS status Theorem for theBenchmark.p
% 164.00/24.69
% 164.00/24.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 164.00/24.69
% 164.00/24.69
%------------------------------------------------------------------------------