%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL364-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n010.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:25 PM UTC 2026
% Result : Unsatisfiable 6.66s 2.88s
% Output : CNFRefutation 6.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 29 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 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 : 78 ( 0 sgn 78 !; 0 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(z,implies(implies(y,x),x)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_13) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(implies(implies(not(x),y),implies(z,implies(implies(y,x),x)))),
inference(cnf_transformation,[],[f5]) ).
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,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_218,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_55,c_56]) ).
tcf(c_244,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(superposition,[status(thm)],[c_218,c_56]) ).
tcf(c_277,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(implies(X2,X0),X3))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
inference(superposition,[status(thm)],[c_55,c_244]) ).
tcf(c_279,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(superposition,[status(thm)],[c_57,c_244]) ).
tcf(c_438,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(not(X0),X2)))),
inference(superposition,[status(thm)],[c_55,c_279]) ).
tcf(c_617,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(not(X0),X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_438,c_56]) ).
tcf(c_902,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,implies(not(X0),X2)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_617,c_279]) ).
tcf(c_922,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(superposition,[status(thm)],[c_902,c_244]) ).
tcf(c_1052,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X0,X2),X3),implies(implies(X1,X2),X3)))),
inference(superposition,[status(thm)],[c_55,c_277]) ).
tcf(c_19582,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_55,c_56]) ).
tcf(c_19595,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(superposition,[status(thm)],[c_19582,c_56]) ).
tcf(c_19642,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_58,c_19595]) ).
tcf(c_19643,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(superposition,[status(thm)],[c_57,c_19595]) ).
tcf(c_19671,plain,
! [X0: $i] : is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_58,c_19643]) ).
tcf(c_19718,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(implies(X0,X3),X4))
| ~ is_a_theorem(implies(implies(implies(implies(X0,X1),X2),implies(implies(X3,X1),X2)),X4)) ),
inference(superposition,[status(thm)],[c_1052,c_19595]) ).
tcf(c_19758,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(implies(X1,X4),implies(X0,implies(implies(X4,X2),X3))))
| ~ is_a_theorem(implies(X0,implies(implies(X1,X2),X3))) ),
inference(superposition,[status(thm)],[c_19582,c_19718]) ).
tcf(c_20153,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_19642,c_922]) ).
tcf(c_20360,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X3,implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_19582,c_20153]) ).
tcf(c_21149,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,implies(implies(not(X0),X0),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_58,c_20360]) ).
tcf(c_21646,plain,
~ is_a_theorem(implies(z,implies(implies(not(x),x),x))),
inference(superposition,[status(thm)],[c_19758,c_54]) ).
tcf(c_21705,plain,
~ is_a_theorem(implies(x,x)),
inference(superposition,[status(thm)],[c_21149,c_21646]) ).
tcf(c_21706,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_21705,c_19671]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL364-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n010.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Wed Sep 23 22:58:13 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 6.66/2.88 % SZS status Started for theBenchmark.p
% 6.66/2.88 % SZS status Unsatisfiable for theBenchmark.p
% 6.66/2.88
% 6.66/2.88 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.66/2.88
% 6.66/2.88 % ------ iProver source info
% 6.66/2.88
% 6.66/2.88 % git: date: 2026-07-19 20:42:38 +0200
% 6.66/2.88 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.66/2.88 % git: non_committed_changes: false
% 6.66/2.88
% 6.66/2.88 % ------ Parsing...% successful
% 6.66/2.88
% 6.66/2.88
% 6.66/2.88 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.66/2.88
% 6.66/2.88 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 6.66/2.88
% 6.66/2.88 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 6.66/2.88 % ------ Proving...
% 6.66/2.88 % ------ Problem Properties
% 6.66/2.88
% 6.66/2.88 %
% 6.66/2.88 % clauses 5
% 6.66/2.88 % conjectures 1
% 6.66/2.88 % EPR 0
% 6.66/2.88 % Horn 5
% 6.66/2.88 % unary 4
% 6.66/2.88 % binary 0
% 6.66/2.88 % lits 7
% 6.66/2.88 % lits eq 0
% 6.66/2.88 % fd_pure 0
% 6.66/2.88 % fd_pseudo 0
% 6.66/2.88 % fd_cond 0
% 6.66/2.88 % fd_pseudo_cond 0
% 6.66/2.88 % AC symbols 0
% 6.66/2.88
% 6.66/2.88 % ------ Schedule dynamic 5 is on
% 6.66/2.88
% 6.66/2.88 % ------ no equalities: superposition off
% 6.66/2.88
% 6.66/2.88 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.66/2.88
% 6.66/2.88
% 6.66/2.88 % ------
% 6.66/2.88 % Current options:
% 6.66/2.88 % ------
% 6.66/2.88
% 6.66/2.88
% 6.66/2.88 %
% 6.66/2.88
% 6.66/2.88 % ------ Proving...
% 6.66/2.88 %
% 6.66/2.88
% 6.66/2.88 % SZS status Unsatisfiable for theBenchmark.p
% 6.66/2.88
% 6.66/2.88 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.66/2.88
% 6.66/2.88
%------------------------------------------------------------------------------