%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL077-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 : n002.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 4.34s 1.30s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 17 unt; 3 def)
% Number of atoms : 74 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 47 ( 27 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 47 !; 0 ?; 38 :)
% 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,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
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,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_76,definition,
iPr_def_10 = not(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_77,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_78,definition,
iPr_def_12 = implies(iPr_def_11,a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_79,negated_conjecture,
~ is_a_theorem(iPr_def_12),
inference(demodulation,[status(thm)],[c_58,c_76,c_77,c_78]) ).
tcf(c_184,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_212,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,implies(X0,a)),implies(implies(iPr_def_11,X0),iPr_def_12))),
inference(superposition,[status(thm)],[c_78,c_56]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_56,c_54]) ).
tcf(c_535,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_12))
| ~ is_a_theorem(implies(iPr_def_11,implies(X0,a))) ),
inference(superposition,[status(thm)],[c_212,c_54]) ).
tcf(c_574,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c_213,c_54]) ).
tcf(c_583,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(iPr_def_11,X0),iPr_def_12))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_184,c_535]) ).
tcf(c_633,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(not(X0),not(X1)),X0))
| ~ is_a_theorem(implies(implies(not(X0),not(X1)),X1)) ),
inference(superposition,[status(thm)],[c_57,c_574]) ).
tcf(c_634,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_184,c_574]) ).
tcf(c_812,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_583,c_54]) ).
tcf(c_814,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_812,c_79]) ).
tcf(c_863,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(not(X1),not(X0)),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_184,c_633]) ).
tcf(c_912,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(iPr_def_11,implies(not(a),not(X0)))) ),
inference(superposition,[status(thm)],[c_863,c_814]) ).
tcf(c_923,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(iPr_def_11,implies(iPr_def_10,not(X0)))) ),
inference(light_normalisation,[status(thm)],[c_912,c_76]) ).
tcf(c_1140,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ~ is_a_theorem(implies(X0,implies(not(X1),not(X2)))) ),
inference(superposition,[status(thm)],[c_57,c_634]) ).
tcf(c_1940,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_55,c_1140]) ).
tcf(c_1982,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_77,c_1940]) ).
tcf(c_1991,plain,
! [X0: $i] : ~ is_a_theorem(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_923,c_1982]) ).
tcf(c_1992,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1940,c_1991]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL077-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.10/0.36 % Computer : n002.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 21:52:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 4.34/1.30 % SZS status Started for theBenchmark.p
% 4.34/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.34/1.30
% 4.34/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.34/1.30
% 4.34/1.30 % ------ iProver source info
% 4.34/1.30
% 4.34/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.34/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.34/1.30 % git: non_committed_changes: false
% 4.34/1.30
% 4.34/1.30 % ------ Parsing...% successful
% 4.34/1.30
% 4.34/1.30
% 4.34/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.34/1.30
% 4.34/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.34/1.30
% 4.34/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.34/1.30
% 4.34/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.34/1.30 % ------ Proving...
% 4.34/1.30 % ------ Problem Properties
% 4.34/1.30
% 4.34/1.30 %
% 4.34/1.30 % clauses 8
% 4.34/1.30 % conjectures 1
% 4.34/1.30 % EPR 1
% 4.34/1.30 % Horn 8
% 4.34/1.30 % unary 7
% 4.34/1.30 % binary 0
% 4.34/1.30 % lits 10
% 4.34/1.30 % lits eq 3
% 4.34/1.30 % fd_pure 0
% 4.34/1.30 % fd_pseudo 0
% 4.34/1.30 % fd_cond 0
% 4.34/1.30 % fd_pseudo_cond 0
% 4.34/1.30 % AC symbols 0
% 4.34/1.30
% 4.34/1.30 % ------ Schedule dynamic 5 is on
% 4.34/1.30
% 4.34/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.34/1.30
% 4.34/1.30
% 4.34/1.30 % ------
% 4.34/1.30 % Current options:
% 4.34/1.30 % ------
% 4.34/1.30
% 4.34/1.30
% 4.34/1.30 %
% 4.34/1.30
% 4.34/1.30 % ------ Proving...
% 4.34/1.30 %
% 4.34/1.30
% 4.34/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.34/1.30
% 4.34/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.34/1.30
% 4.34/1.30
%------------------------------------------------------------------------------