%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL191-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 : n013.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:55 PM UTC 2026
% Result : Unsatisfiable 21.39s 3.82s
% Output : CNFRefutation 21.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 49 ( 33 unt; 6 def)
% Number of atoms : 113 ( 7 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 54 ( 31 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 69 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
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(or(p,or(q,r)),or(or(p,q),r))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,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(or(p,or(q,r))),or(or(p,q),r))),
inference(definition_unfolding,[],[f9,f6]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f12]) ).
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,[],[f13]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[],[f14]) ).
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(or(p,or(q,r))),or(or(p,q),r))),
inference(cnf_transformation,[],[f16]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_63,c_60]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c_63,c_61]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[status(thm)],[c_63,c_62]) ).
tcf(c_142,definition,
iPr_def_10 = or(q,r),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_143,definition,
iPr_def_11 = or(p,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_144,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_145,definition,
iPr_def_13 = or(p,q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_146,definition,
iPr_def_14 = or(iPr_def_13,r),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_147,definition,
iPr_def_15 = or(iPr_def_12,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_148,negated_conjecture,
~ theorem(iPr_def_15),
inference(demodulation,[status(thm)],[c_65,c_145,c_146,c_142,c_143,c_144,c_147]) ).
tcf(c_331,plain,
theorem(or(not(iPr_def_10),or(r,q))),
inference(superposition,[status(thm)],[c_142,c_104]) ).
tcf(c_339,plain,
theorem(or(not(or(r,iPr_def_13)),iPr_def_14)),
inference(superposition,[status(thm)],[c_146,c_104]) ).
tcf(c_363,plain,
! [X0: $i] : theorem(or(not(or(p,or(X0,q))),or(X0,iPr_def_13))),
inference(superposition,[status(thm)],[c_145,c_109]) ).
tcf(c_367,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_109,c_64]) ).
tcf(c_441,plain,
! [X0: $i] : theorem(or(not(or(not(iPr_def_10),X0)),or(not(iPr_def_11),or(p,X0)))),
inference(superposition,[status(thm)],[c_143,c_114]) ).
tcf(c_448,plain,
! [X0: $i] : theorem(or(not(or(not(X0),iPr_def_14)),or(not(or(iPr_def_12,X0)),iPr_def_15))),
inference(superposition,[status(thm)],[c_147,c_114]) ).
tcf(c_449,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_114,c_64]) ).
tcf(c_450,plain,
! [X0: $i] : theorem(or(not(or(not(iPr_def_10),X0)),or(iPr_def_12,or(p,X0)))),
inference(light_normalisation,[status(thm)],[c_441,c_144]) ).
tcf(c_1418,plain,
! [X0: $i] : theorem(or(iPr_def_12,or(not(or(not(iPr_def_10),X0)),or(p,X0)))),
inference(superposition,[status(thm)],[c_450,c_367]) ).
tcf(c_2295,plain,
! [X0: $i] :
( theorem(or(not(or(iPr_def_12,X0)),iPr_def_15))
| ~ theorem(or(not(X0),iPr_def_14)) ),
inference(superposition,[status(thm)],[c_448,c_64]) ).
tcf(c_2392,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,X1))
| ~ theorem(or(X2,X0))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_449,c_64]) ).
tcf(c_2394,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_449,c_367]) ).
tcf(c_2932,plain,
! [X0: $i] :
( theorem(iPr_def_15)
| ~ theorem(or(iPr_def_12,X0))
| ~ theorem(or(not(X0),iPr_def_14)) ),
inference(superposition,[status(thm)],[c_2295,c_64]) ).
tcf(c_2936,plain,
! [X0: $i] :
( ~ theorem(or(iPr_def_12,X0))
| ~ theorem(or(not(X0),iPr_def_14)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2932,c_148]) ).
tcf(c_3367,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_14))
| ~ theorem(or(X0,or(r,iPr_def_13))) ),
inference(superposition,[status(thm)],[c_339,c_2392]) ).
tcf(c_25612,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(not(X2),X0)),X1))
| ~ theorem(X2)
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_2394,c_64]) ).
tcf(c_25950,plain,
! [X0: $i,X1: $i] :
( ~ theorem(X0)
| ~ theorem(or(not(X1),iPr_def_14))
| ~ theorem(or(iPr_def_12,or(not(X0),X1))) ),
inference(superposition,[status(thm)],[c_25612,c_2936]) ).
tcf(c_26596,plain,
! [X0: $i] :
( ~ theorem(or(not(iPr_def_10),X0))
| ~ theorem(or(not(or(p,X0)),iPr_def_14)) ),
inference(superposition,[status(thm)],[c_1418,c_25950]) ).
tcf(c_37040,plain,
theorem(or(not(or(p,or(r,q))),iPr_def_14)),
inference(superposition,[status(thm)],[c_363,c_3367]) ).
tcf(c_37437,plain,
~ theorem(or(not(iPr_def_10),or(r,q))),
inference(superposition,[status(thm)],[c_37040,c_26596]) ).
tcf(c_37438,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_37437,c_331]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL191-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 % Computer : n013.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Wed Sep 23 22:15:21 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 21.39/3.82 % SZS status Started for theBenchmark.p
% 21.39/3.82 % SZS status Unsatisfiable for theBenchmark.p
% 21.39/3.82
% 21.39/3.82 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 21.39/3.82
% 21.39/3.82 % ------ iProver source info
% 21.39/3.82
% 21.39/3.82 % git: date: 2026-07-19 20:42:38 +0200
% 21.39/3.82 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 21.39/3.82 % git: non_committed_changes: false
% 21.39/3.82
% 21.39/3.82 % ------ Parsing...% successful
% 21.39/3.82
% 21.39/3.82
% 21.39/3.82 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 21.39/3.82
% 21.39/3.82 % ------ 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 %
% 21.39/3.82
% 21.39/3.82 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 21.39/3.82
% 21.39/3.82 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 21.39/3.82 % ------ Proving...
% 21.39/3.82 % ------ Problem Properties
% 21.39/3.82
% 21.39/3.82 %
% 21.39/3.82 % clauses 13
% 21.39/3.82 % conjectures 1
% 21.39/3.82 % EPR 1
% 21.39/3.82 % Horn 13
% 21.39/3.82 % unary 12
% 21.39/3.82 % binary 0
% 21.39/3.82 % lits 15
% 21.39/3.82 % lits eq 6
% 21.39/3.82 % fd_pure 0
% 21.39/3.82 % fd_pseudo 0
% 21.39/3.82 % fd_cond 0
% 21.39/3.82 % fd_pseudo_cond 0
% 21.39/3.82 % AC symbols 0
% 21.39/3.82
% 21.39/3.82 % ------ Schedule dynamic 5 is on
% 21.39/3.82
% 21.39/3.82 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 21.39/3.82
% 21.39/3.82
% 21.39/3.82 % ------
% 21.39/3.82 % Current options:
% 21.39/3.82 % ------
% 21.39/3.82
% 21.39/3.82
% 21.39/3.82 %
% 21.39/3.82
% 21.39/3.82 % ------ Proving...
% 21.39/3.82 %
% 21.39/3.82
% 21.39/3.82 % SZS status Unsatisfiable for theBenchmark.p
% 21.39/3.82
% 21.39/3.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 21.39/3.82
% 21.39/3.82
%------------------------------------------------------------------------------