%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL384-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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 : Unsatisfiable 171.38s 26.99s
% Output : CNFRefutation 171.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 55 ( 29 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 81 ( 0 sgn 81 !; 0 ?; 73 :)
% 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,
! [X2,X0,X1] : 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,negated_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) ).
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,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_54,c_57]) ).
tcf(c_126,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_55,c_54]) ).
tcf(c_134,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_126,c_54]) ).
tcf(c_148,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_134,c_56]) ).
tcf(c_150,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_134,c_57]) ).
tcf(c_153,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_134,c_126]) ).
tcf(c_205,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
inference(resolution,[status(thm)],[c_148,c_56]) ).
tcf(c_264,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_150,c_54]) ).
tcf(c_267,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_150,c_134]) ).
tcf(c_314,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_153,c_55]) ).
tcf(c_317,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_153,c_57]) ).
tcf(c_475,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[c_317,c_148]) ).
tcf(c_541,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_475,c_98]) ).
tcf(c_553,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),X0)) ),
inference(resolution,[status(thm)],[c_541,c_148]) ).
tcf(c_765,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_264,c_126]) ).
tcf(c_886,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_267,c_55]) ).
tcf(c_957,plain,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(resolution,[status(thm)],[c_314,c_58]) ).
tcf(c_960,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_314,c_148]) ).
tcf(c_5996,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_765,c_57]) ).
tcf(c_15792,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(implies(implies(not(X0),X0),X0)),X1)),
inference(resolution,[status(thm)],[c_5996,c_205]) ).
tcf(c_19150,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[status(thm)],[c_15792,c_553]) ).
tcf(c_19289,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1))),
inference(resolution,[status(thm)],[c_19150,c_960]) ).
tcf(c_28232,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_19289,c_886]) ).
tcf(c_205533,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X0),X0))),
inference(resolution,[status(thm)],[c_28232,c_148]) ).
tcf(c_205963,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_957,c_205533]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL384-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n006.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 23:06:11 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 171.38/26.99 % SZS status Started for theBenchmark.p
% 171.38/26.99 % SZS status Unsatisfiable for theBenchmark.p
% 171.38/26.99
% 171.38/26.99 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 171.38/26.99
% 171.38/26.99 % ------ iProver source info
% 171.38/26.99
% 171.38/26.99 % git: date: 2026-07-19 20:42:38 +0200
% 171.38/26.99 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 171.38/26.99 % git: non_committed_changes: false
% 171.38/26.99
% 171.38/26.99 % ------ Parsing...% successful
% 171.38/26.99
% 171.38/26.99
% 171.38/26.99 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 171.38/26.99
% 171.38/26.99 % ------ Preprocessing... sf_s rm: 0 0s sf_e %
% 171.38/26.99
% 171.38/26.99 % ------ Preprocessing...
% 171.38/26.99 % ------ Proving...
% 171.38/26.99 % ------ Problem Properties
% 171.38/26.99
% 171.38/26.99 %
% 171.38/26.99 % clauses 5
% 171.38/26.99 % conjectures 1
% 171.38/26.99 % EPR 0
% 171.38/26.99 % Horn 5
% 171.38/26.99 % unary 4
% 171.38/26.99 % binary 0
% 171.38/26.99 % lits 7
% 171.38/26.99 % lits eq 0
% 171.38/26.99 % fd_pure 0
% 171.38/26.99 % fd_pseudo 0
% 171.38/26.99 % fd_cond 0
% 171.38/26.99 % fd_pseudo_cond 0
% 171.38/26.99 % AC symbols 0
% 171.38/26.99
% 171.38/26.99 % ------ Input Options Time Limit: Unbounded
% 171.38/26.99
% 171.38/26.99
% 171.38/26.99 % ------
% 171.38/26.99 % Current options:
% 171.38/26.99 % ------
% 171.38/26.99
% 171.38/26.99
% 171.38/26.99 %
% 171.38/26.99
% 171.38/26.99 % ------ Proving...
% 171.38/26.99 %
% 171.38/26.99
% 171.38/26.99 % SZS status Unsatisfiable for theBenchmark.p
% 171.38/26.99
% 171.38/26.99 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 171.38/26.99
% 171.38/26.99
%------------------------------------------------------------------------------