%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL197-1 : TPTP v9.3.1. Released v1.1.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:05:56 PM UTC 2026
% Result : Unsatisfiable 1.94s 16.49s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 39 ( 27 unt; 4 def)
% Number of atoms : 88 ( 4 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 39 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(q,or(p,q))),or(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,negated_conjecture,
~ theorem(or(not(or(q,or(p,q))),or(p,q))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_225,definition,
iPr_def_10 = or(p,q),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_226,definition,
iPr_def_11 = or(q,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_227,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_228,definition,
iPr_def_13 = or(iPr_def_12,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_229,negated_conjecture,
~ theorem(iPr_def_13),
inference(demodulation,[status(thm)],[c_66,c_225,c_226,c_227,c_228]) ).
tcf(c_378,plain,
! [X0: $i] : axiom(or(iPr_def_12,or(X0,iPr_def_11))),
inference(superposition,[status(thm)],[c_227,c_59]) ).
tcf(c_398,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_58,c_64]) ).
tcf(c_399,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_59,c_64]) ).
tcf(c_400,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_60,c_64]) ).
tcf(c_413,plain,
! [X0: $i] : axiom(or(not(or(X0,iPr_def_11)),or(q,or(X0,iPr_def_10)))),
inference(superposition,[status(thm)],[c_226,c_61]) ).
tcf(c_419,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_61,c_64]) ).
tcf(c_500,plain,
! [X0: $i] : theorem(or(iPr_def_12,or(X0,iPr_def_11))),
inference(superposition,[status(thm)],[c_378,c_63]) ).
tcf(c_927,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_399,c_419]) ).
tcf(c_931,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_12,iPr_def_11))),
inference(superposition,[status(thm)],[c_500,c_419]) ).
tcf(c_1005,plain,
axiom(or(not(or(iPr_def_12,iPr_def_11)),or(q,iPr_def_13))),
inference(superposition,[status(thm)],[c_228,c_413]) ).
tcf(c_1011,plain,
( theorem(or(q,iPr_def_13))
| ~ theorem(or(iPr_def_12,iPr_def_11)) ),
inference(superposition,[status(thm)],[c_1005,c_64]) ).
tcf(c_1021,plain,
theorem(or(iPr_def_12,iPr_def_11)),
inference(superposition,[status(thm)],[c_931,c_398]) ).
tcf(c_1133,plain,
theorem(or(q,iPr_def_13)),
inference(global_subsumption_just,[status(thm)],[c_1011,c_1011,c_1021]) ).
tcf(c_1135,plain,
theorem(or(iPr_def_13,q)),
inference(superposition,[status(thm)],[c_1133,c_400]) ).
tcf(c_1735,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_10))
| ~ theorem(or(X0,q)) ),
inference(superposition,[status(thm)],[c_225,c_927]) ).
tcf(c_1737,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_13))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_228,c_927]) ).
tcf(c_1778,plain,
theorem(or(iPr_def_13,iPr_def_10)),
inference(superposition,[status(thm)],[c_1135,c_1735]) ).
tcf(c_1898,plain,
theorem(or(iPr_def_13,iPr_def_13)),
inference(superposition,[status(thm)],[c_1778,c_1737]) ).
tcf(c_1938,plain,
theorem(iPr_def_13),
inference(superposition,[status(thm)],[c_1898,c_398]) ).
tcf(c_1940,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1938,c_229]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL197-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/15.58 % Computer : n019.cluster.edu
% 0.08/15.58 % Model : x86_64 x86_64
% 0.08/15.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/15.58 % Memory : 8046.5625MB
% 0.08/15.58 % OS : Linux 6.8.0-71-generic
% 0.08/15.58 % CPULimit : 300
% 0.08/15.58 % WCLimit : 300
% 0.08/15.58 % DateTime : Wed Sep 23 22:17:37 UTC 2026
% 0.08/15.58 % CPUTime :
% 0.08/15.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/15.62 Running first-order theorem proving
% 0.12/15.62 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.12/15.63
% 0.12/15.63 % ======== iProver multi-core TPTP/SMT =========
% 0.12/15.63
% 0.12/15.63 % Detected problem language: tptp
% 0.12/15.64 % Proving...
% 1.94/16.49 % SZS status Started for theBenchmark.p
% 1.94/16.49 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/16.49
% 1.94/16.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.94/16.49
% 1.94/16.49 % ------ iProver source info
% 1.94/16.49
% 1.94/16.49 % git: date: 2026-07-19 20:42:38 +0200
% 1.94/16.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.94/16.49 % git: non_committed_changes: false
% 1.94/16.49
% 1.94/16.49 % ------ Parsing...% successful
% 1.94/16.49
% 1.94/16.49
% 1.94/16.49 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.94/16.49
% 1.94/16.49 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.94/16.49
% 1.94/16.49 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.94/16.49
% 1.94/16.49 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.94/16.49 % ------ Proving...
% 1.94/16.49 % ------ Problem Properties
% 1.94/16.49
% 1.94/16.49 %
% 1.94/16.49 % clauses 13
% 1.94/16.49 % conjectures 1
% 1.94/16.49 % EPR 2
% 1.94/16.49 % Horn 13
% 1.94/16.49 % unary 10
% 1.94/16.49 % binary 1
% 1.94/16.49 % lits 18
% 1.94/16.49 % lits eq 4
% 1.94/16.49 % fd_pure 0
% 1.94/16.49 % fd_pseudo 0
% 1.94/16.49 % fd_cond 0
% 1.94/16.49 % fd_pseudo_cond 0
% 1.94/16.49 % AC symbols 0
% 1.94/16.49
% 1.94/16.49 % ------ Schedule dynamic 5 is on
% 1.94/16.49
% 1.94/16.49 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.94/16.49
% 1.94/16.49
% 1.94/16.49 % ------
% 1.94/16.49 % Current options:
% 1.94/16.49 % ------
% 1.94/16.49
% 1.94/16.49
% 1.94/16.49 %
% 1.94/16.49
% 1.94/16.49 % ------ Proving...
% 1.94/16.49 %
% 1.94/16.49
% 1.94/16.49 % SZS status Unsatisfiable for theBenchmark.p
% 1.94/16.49
% 1.94/16.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.94/16.49
% 1.94/16.49
%------------------------------------------------------------------------------