%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL190-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 : n010.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:54 PM UTC 2026
% Result : Unsatisfiable 2.36s 1.30s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 21 unt; 6 def)
% Number of atoms : 64 ( 6 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
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(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
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(p,or(q,r))),or(p,or(r,q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
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,[],[f5]) ).
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(p,or(q,r))),or(p,or(r,q)))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_225,definition,
iPr_def_10 = or(q,r),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_226,definition,
iPr_def_11 = or(p,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(r,q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_229,definition,
iPr_def_14 = or(p,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_230,definition,
iPr_def_15 = or(iPr_def_12,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_231,negated_conjecture,
~ theorem(iPr_def_15),
inference(demodulation,[status(thm)],[c_66,c_228,c_229,c_225,c_226,c_227,c_230]) ).
tcf(c_402,plain,
axiom(or(not(or(q,r)),iPr_def_13)),
inference(superposition,[status(thm)],[c_228,c_60]) ).
tcf(c_407,plain,
axiom(or(not(iPr_def_10),iPr_def_13)),
inference(light_normalisation,[status(thm)],[c_402,c_225]) ).
tcf(c_515,plain,
theorem(or(not(iPr_def_10),iPr_def_13)),
inference(superposition,[status(thm)],[c_407,c_63]) ).
tcf(c_530,plain,
! [X0: $i] : axiom(or(not(or(not(iPr_def_10),X0)),or(not(iPr_def_11),or(p,X0)))),
inference(superposition,[status(thm)],[c_226,c_62]) ).
tcf(c_540,plain,
! [X0: $i] : axiom(or(not(or(not(iPr_def_10),X0)),or(iPr_def_12,or(p,X0)))),
inference(light_normalisation,[status(thm)],[c_530,c_227]) ).
tcf(c_3722,plain,
axiom(or(not(or(not(iPr_def_10),iPr_def_13)),or(iPr_def_12,iPr_def_14))),
inference(superposition,[status(thm)],[c_229,c_540]) ).
tcf(c_3725,plain,
axiom(or(not(or(not(iPr_def_10),iPr_def_13)),iPr_def_15)),
inference(light_normalisation,[status(thm)],[c_3722,c_230]) ).
tcf(c_3727,plain,
( theorem(iPr_def_15)
| ~ theorem(or(not(iPr_def_10),iPr_def_13)) ),
inference(superposition,[status(thm)],[c_3725,c_64]) ).
tcf(c_3728,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3727,c_231,c_515]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL190-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.11/0.36 % Computer : n010.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 22:14:58 UTC 2026
% 0.02/0.37 % CPUTime :
% 0.02/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.41 Running first-order theorem proving
% 0.02/0.41 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.02/0.42
% 0.02/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.42
% 0.02/0.42 % Detected problem language: tptp
% 0.02/0.44 % Proving...
% 2.36/1.30 % SZS status Started for theBenchmark.p
% 2.36/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.36/1.30
% 2.36/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.36/1.30
% 2.36/1.30 % ------ iProver source info
% 2.36/1.30
% 2.36/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.36/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.36/1.30 % git: non_committed_changes: false
% 2.36/1.30
% 2.36/1.30 % ------ Parsing...% successful
% 2.36/1.30
% 2.36/1.30
% 2.36/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.36/1.30
% 2.36/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.36/1.30
% 2.36/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.36/1.30
% 2.36/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.36/1.30 % ------ Proving...
% 2.36/1.30 % ------ Problem Properties
% 2.36/1.30
% 2.36/1.30 %
% 2.36/1.30 % clauses 15
% 2.36/1.30 % conjectures 1
% 2.36/1.30 % EPR 2
% 2.36/1.30 % Horn 15
% 2.36/1.30 % unary 12
% 2.36/1.30 % binary 1
% 2.36/1.30 % lits 20
% 2.36/1.30 % lits eq 6
% 2.36/1.30 % fd_pure 0
% 2.36/1.30 % fd_pseudo 0
% 2.36/1.30 % fd_cond 0
% 2.36/1.30 % fd_pseudo_cond 0
% 2.36/1.30 % AC symbols 0
% 2.36/1.30
% 2.36/1.30 % ------ Schedule dynamic 5 is on
% 2.36/1.30
% 2.36/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.36/1.30
% 2.36/1.30
% 2.36/1.30 % ------
% 2.36/1.30 % Current options:
% 2.36/1.30 % ------
% 2.36/1.30
% 2.36/1.30
% 2.36/1.30 %
% 2.36/1.30
% 2.36/1.30 % ------ Proving...
% 2.36/1.30 %
% 2.36/1.30
% 2.36/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.36/1.30
% 2.36/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.36/1.30
% 2.36/1.30
%------------------------------------------------------------------------------