%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL027-1 : TPTP v9.3.1. Released v1.0.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:05:27 PM UTC 2026
% Result : Unsatisfiable 1.91s 6.29s
% Output : CNFRefutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 13 unt; 1 def)
% Number of atoms : 36 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 15 :)
% 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] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_2) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(implies(X0,falsehood),falsehood),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_5) ).
fof(f4,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_6) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_4) ).
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] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i] : is_a_theorem(implies(implies(implies(X0,falsehood),falsehood),X0)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = implies(falsehood,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,negated_conjecture,
~ is_a_theorem(iPr_def_10),
inference(demodulation,[status(thm)],[c_58,c_76]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_191,plain,
! [X0: $i] : is_a_theorem(implies(implies(falsehood,implies(X0,a)),implies(implies(falsehood,X0),iPr_def_10))),
inference(superposition,[status(thm)],[c_76,c_57]) ).
tcf(c_253,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(falsehood,X0),iPr_def_10))
| ~ is_a_theorem(implies(falsehood,implies(X0,a))) ),
inference(superposition,[status(thm)],[c_191,c_54]) ).
tcf(c_306,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(falsehood,X0),iPr_def_10))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_164,c_253]) ).
tcf(c_441,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_10)
| ~ is_a_theorem(implies(falsehood,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_306,c_54]) ).
tcf(c_443,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(falsehood,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_441,c_77]) ).
tcf(c_461,plain,
~ is_a_theorem(implies(falsehood,implies(implies(a,falsehood),falsehood))),
inference(superposition,[status(thm)],[c_56,c_443]) ).
tcf(c_466,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_461,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL027-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.37 % Computer : n020.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Wed Sep 23 21:40:40 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.42 Running first-order theorem proving
% 0.13/5.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.13/5.43
% 0.13/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.43
% 0.13/5.43 % Detected problem language: tptp
% 0.13/5.44 % Proving...
% 1.91/6.29 % SZS status Started for theBenchmark.p
% 1.91/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.91/6.29
% 1.91/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.91/6.29
% 1.91/6.29 % ------ iProver source info
% 1.91/6.29
% 1.91/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.91/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.91/6.29 % git: non_committed_changes: false
% 1.91/6.29
% 1.91/6.29 % ------ Parsing...% successful
% 1.91/6.29
% 1.91/6.29
% 1.91/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.91/6.29
% 1.91/6.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.91/6.29
% 1.91/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.91/6.29
% 1.91/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.91/6.29 % ------ Proving...
% 1.91/6.29 % ------ Problem Properties
% 1.91/6.29
% 1.91/6.29 %
% 1.91/6.29 % clauses 6
% 1.91/6.29 % conjectures 1
% 1.91/6.29 % EPR 1
% 1.91/6.29 % Horn 6
% 1.91/6.29 % unary 5
% 1.91/6.29 % binary 0
% 1.91/6.29 % lits 8
% 1.91/6.29 % lits eq 1
% 1.91/6.29 % fd_pure 0
% 1.91/6.29 % fd_pseudo 0
% 1.91/6.29 % fd_cond 0
% 1.91/6.29 % fd_pseudo_cond 0
% 1.91/6.29 % AC symbols 0
% 1.91/6.29
% 1.91/6.29 % ------ Schedule dynamic 5 is on
% 1.91/6.29
% 1.91/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.91/6.29
% 1.91/6.29
% 1.91/6.29 % ------
% 1.91/6.29 % Current options:
% 1.91/6.29 % ------
% 1.91/6.29
% 1.91/6.29
% 1.91/6.29 %
% 1.91/6.29
% 1.91/6.29 % ------ Proving...
% 1.91/6.29 %
% 1.91/6.29
% 1.91/6.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.91/6.29
% 1.91/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.91/6.29
% 1.91/6.29
%------------------------------------------------------------------------------