%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL212-3 : 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 : n019.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:01 PM UTC 2026
% Result : Unsatisfiable 1.06s 1.39s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 27 ( 21 unt; 8 def)
% Number of atoms : 59 ( 9 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 22 ( 13 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(not(p),implies(q,implies(implies(p,q),q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ theorem(or(not(X1),X0))
| theorem(X0) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),q)))),
inference(definition_unfolding,[],[f9,f6,f6,f6,f6]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f11]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_65,negated_conjecture,
~ theorem(or(not(not(p)),or(not(q),or(not(or(not(p),q)),q)))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_59]) ).
tcf(c_142,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_143,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_144,definition,
iPr_def_12 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_145,definition,
iPr_def_13 = or(iPr_def_10,q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_146,definition,
iPr_def_14 = not(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_147,definition,
iPr_def_15 = or(iPr_def_14,q),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_148,definition,
iPr_def_16 = or(iPr_def_12,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_149,definition,
iPr_def_17 = or(iPr_def_11,iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_150,negated_conjecture,
~ theorem(iPr_def_17),
inference(demodulation,[status(thm)],[c_65,c_145,c_146,c_147,c_144,c_148,c_142,c_143,c_149]) ).
tcf(c_310,plain,
theorem(or(not(q),iPr_def_15)),
inference(superposition,[status(thm)],[c_147,c_99]) ).
tcf(c_312,plain,
theorem(or(not(iPr_def_16),iPr_def_17)),
inference(superposition,[status(thm)],[c_149,c_99]) ).
tcf(c_314,plain,
theorem(iPr_def_16),
inference(light_normalisation,[status(thm)],[c_310,c_144,c_148]) ).
tcf(c_324,plain,
( theorem(iPr_def_17)
| ~ theorem(iPr_def_16) ),
inference(superposition,[status(thm)],[c_312,c_64]) ).
tcf(c_325,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_324,c_150,c_314]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL212-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.44 % Computer : n019.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Wed Sep 23 22:22:34 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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.26/0.52
% 0.26/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.52
% 0.26/0.52 % Detected problem language: tptp
% 0.26/0.53 % Proving...
% 1.06/1.39 % SZS status Started for theBenchmark.p
% 1.06/1.39 % SZS status Unsatisfiable for theBenchmark.p
% 1.06/1.39
% 1.06/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.06/1.39
% 1.06/1.39 % ------ iProver source info
% 1.06/1.39
% 1.06/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 1.06/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.06/1.39 % git: non_committed_changes: false
% 1.06/1.39
% 1.06/1.39 % ------ Parsing...% successful
% 1.06/1.39
% 1.06/1.39
% 1.06/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.06/1.39
% 1.06/1.39 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.06/1.39
% 1.06/1.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.06/1.39
% 1.06/1.39 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.06/1.39 % ------ Proving...
% 1.06/1.39 % ------ Problem Properties
% 1.06/1.39
% 1.06/1.39 %
% 1.06/1.39 % clauses 15
% 1.06/1.39 % conjectures 1
% 1.06/1.39 % EPR 1
% 1.06/1.39 % Horn 15
% 1.06/1.39 % unary 14
% 1.06/1.39 % binary 0
% 1.06/1.39 % lits 17
% 1.06/1.39 % lits eq 8
% 1.06/1.39 % fd_pure 0
% 1.06/1.39 % fd_pseudo 0
% 1.06/1.39 % fd_cond 0
% 1.06/1.39 % fd_pseudo_cond 0
% 1.06/1.39 % AC symbols 0
% 1.06/1.39
% 1.06/1.39 % ------ Schedule dynamic 5 is on
% 1.06/1.39
% 1.06/1.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.06/1.39
% 1.06/1.39
% 1.06/1.39 % ------
% 1.06/1.39 % Current options:
% 1.06/1.39 % ------
% 1.06/1.39
% 1.06/1.39
% 1.06/1.39 %
% 1.06/1.39
% 1.06/1.39 % ------ Proving...
% 1.06/1.39 %
% 1.06/1.39
% 1.06/1.39 % SZS status Unsatisfiable for theBenchmark.p
% 1.06/1.39
% 1.06/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.06/1.39
% 1.06/1.39
%------------------------------------------------------------------------------