%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL081-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n026.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:35 PM UTC 2026
% Result : Unsatisfiable 3.37s 1.28s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 21 unt; 1 def)
% Number of atoms : 77 ( 1 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 32 ( 18 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 55 !; 0 ?; 49 :)
% 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,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_1) ).
tcf(c_52,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_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(implies(a,a)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_66,definition,
iPr_def_10 = implies(a,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_67,negated_conjecture,
~ is_a_theorem(iPr_def_10),
inference(demodulation,[status(thm)],[c_54,c_66]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(iPr_def_10,X0),implies(implies(X0,a),implies(X1,a)))),
inference(superposition,[status(thm)],[c_66,c_53]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(implies(X2,X0),implies(X3,X0)))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_157,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_10,X0),implies(implies(X0,a),iPr_def_10))),
inference(superposition,[status(thm)],[c_66,c_146]) ).
tcf(c_188,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,a),iPr_def_10))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_157,c_52]) ).
tcf(c_272,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(superposition,[status(thm)],[c_53,c_149]) ).
tcf(c_281,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(iPr_def_10,X0),implies(X1,X0)))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_188,c_149]) ).
tcf(c_350,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(X4,implies(X1,X3)))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3))) ),
inference(superposition,[status(thm)],[c_272,c_52]) ).
tcf(c_374,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2))))),
inference(superposition,[status(thm)],[c_272,c_350]) ).
tcf(c_395,plain,
! [X0: $i] : is_a_theorem(implies(X0,implies(iPr_def_10,implies(a,iPr_def_10)))),
inference(superposition,[status(thm)],[c_66,c_374]) ).
tcf(c_447,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_10,implies(a,iPr_def_10)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_395,c_52]) ).
tcf(c_470,plain,
is_a_theorem(implies(iPr_def_10,implies(a,iPr_def_10))),
inference(superposition,[status(thm)],[c_272,c_447]) ).
tcf(c_544,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_281,c_52]) ).
tcf(c_572,plain,
! [X0: $i] : is_a_theorem(implies(X0,implies(a,iPr_def_10))),
inference(superposition,[status(thm)],[c_470,c_544]) ).
tcf(c_646,plain,
! [X0: $i] :
( is_a_theorem(implies(a,iPr_def_10))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_572,c_52]) ).
tcf(c_647,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(a,iPr_def_10),X0),implies(X1,X0))),
inference(superposition,[status(thm)],[c_572,c_149]) ).
tcf(c_698,plain,
is_a_theorem(implies(a,iPr_def_10)),
inference(superposition,[status(thm)],[c_374,c_646]) ).
tcf(c_788,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(iPr_def_10,implies(X1,iPr_def_10)))),
inference(superposition,[status(thm)],[c_647,c_350]) ).
tcf(c_810,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(iPr_def_10,implies(X1,iPr_def_10)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_788,c_52]) ).
tcf(c_866,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_10,implies(X0,iPr_def_10))),
inference(superposition,[status(thm)],[c_698,c_810]) ).
tcf(c_997,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,iPr_def_10))),
inference(superposition,[status(thm)],[c_866,c_544]) ).
tcf(c_999,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,iPr_def_10))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_997,c_52]) ).
tcf(c_1027,plain,
! [X0: $i] : is_a_theorem(implies(X0,iPr_def_10)),
inference(superposition,[status(thm)],[c_788,c_999]) ).
tcf(c_1029,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_10)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_1027,c_52]) ).
tcf(c_1035,plain,
! [X0: $i] : ~ is_a_theorem(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_1029,c_67]) ).
tcf(c_1036,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1027,c_1035]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL081-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 21:54:08 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 3.37/1.28 % SZS status Started for theBenchmark.p
% 3.37/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.37/1.28
% 3.37/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.37/1.28
% 3.37/1.28 % ------ iProver source info
% 3.37/1.28
% 3.37/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.37/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.37/1.28 % git: non_committed_changes: false
% 3.37/1.28
% 3.37/1.28 % ------ Parsing...% successful
% 3.37/1.28
% 3.37/1.28
% 3.37/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.37/1.28
% 3.37/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.37/1.28
% 3.37/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.37/1.28
% 3.37/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.37/1.28 % ------ Proving...
% 3.37/1.28 % ------ Problem Properties
% 3.37/1.28
% 3.37/1.28 %
% 3.37/1.28 % clauses 4
% 3.37/1.28 % conjectures 1
% 3.37/1.28 % EPR 1
% 3.37/1.28 % Horn 4
% 3.37/1.28 % unary 3
% 3.37/1.28 % binary 0
% 3.37/1.28 % lits 6
% 3.37/1.28 % lits eq 1
% 3.37/1.28 % fd_pure 0
% 3.37/1.28 % fd_pseudo 0
% 3.37/1.28 % fd_cond 0
% 3.37/1.28 % fd_pseudo_cond 0
% 3.37/1.28 % AC symbols 0
% 3.37/1.28
% 3.37/1.28 % ------ Schedule dynamic 5 is on
% 3.37/1.28
% 3.37/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.37/1.28
% 3.37/1.28
% 3.37/1.28 % ------
% 3.37/1.28 % Current options:
% 3.37/1.28 % ------
% 3.37/1.28
% 3.37/1.28
% 3.37/1.28 %
% 3.37/1.28
% 3.37/1.28 % ------ Proving...
% 3.37/1.28 %
% 3.37/1.28
% 3.37/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.37/1.28
% 3.37/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.37/1.28
% 3.37/1.28
%------------------------------------------------------------------------------