%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL182-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 : 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:52 PM UTC 2026
% Result : Unsatisfiable 7.44s 2.28s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 27 unt; 7 def)
% Number of atoms : 127 ( 7 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 58 ( 31 ~; 27 |; 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 : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 66 !; 0 ?; 49 :)
% 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(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(f8,axiom,
! [X2,X0,X1] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
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_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_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X2),X1))
| ~ axiom(or(not(X2),X0))
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_225,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_226,definition,
iPr_def_11 = or(iPr_def_10,q),
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 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_229,definition,
iPr_def_14 = not(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_230,definition,
iPr_def_15 = or(iPr_def_14,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_231,definition,
iPr_def_16 = or(iPr_def_12,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_232,negated_conjecture,
~ theorem(iPr_def_16),
inference(demodulation,[status(thm)],[c_66,c_228,c_229,c_230,c_225,c_226,c_227,c_231]) ).
tcf(c_412,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_60,c_63]) ).
tcf(c_420,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_58,c_64]) ).
tcf(c_421,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_59,c_64]) ).
tcf(c_422,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_60,c_64]) ).
tcf(c_483,plain,
! [X0: $i] : axiom(or(not(or(iPr_def_14,or(X0,iPr_def_10))),or(X0,iPr_def_15))),
inference(superposition,[status(thm)],[c_230,c_61]) ).
tcf(c_486,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_534,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_62,c_64]) ).
tcf(c_706,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X0),or(X2,X1)))
| ~ axiom(or(not(X0),or(X1,X2))) ),
inference(superposition,[status(thm)],[c_412,c_65]) ).
tcf(c_968,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_421,c_486]) ).
tcf(c_1291,plain,
! [X0: $i] :
( theorem(or(not(iPr_def_11),or(iPr_def_10,X0)))
| ~ theorem(or(not(q),X0)) ),
inference(superposition,[status(thm)],[c_226,c_534]) ).
tcf(c_1310,plain,
! [X0: $i] :
( theorem(or(iPr_def_12,or(iPr_def_10,X0)))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(light_normalisation,[status(thm)],[c_1291,c_227,c_228]) ).
tcf(c_1440,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_15))
| ~ theorem(or(iPr_def_14,or(X0,iPr_def_10))) ),
inference(superposition,[status(thm)],[c_483,c_64]) ).
tcf(c_2081,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_15))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_230,c_968]) ).
tcf(c_2084,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(superposition,[status(thm)],[c_968,c_420]) ).
tcf(c_2450,plain,
! [X0: $i] :
( theorem(or(iPr_def_10,or(iPr_def_12,X0)))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_1310,c_486]) ).
tcf(c_5584,plain,
! [X0: $i] :
( theorem(or(or(iPr_def_12,X0),iPr_def_10))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_2450,c_422]) ).
tcf(c_7863,plain,
! [X0: $i] :
( theorem(or(or(iPr_def_12,X0),iPr_def_15))
| ~ theorem(or(iPr_def_13,X0)) ),
inference(superposition,[status(thm)],[c_5584,c_2081]) ).
tcf(c_10295,plain,
( theorem(or(iPr_def_12,iPr_def_15))
| ~ theorem(or(iPr_def_13,iPr_def_15)) ),
inference(superposition,[status(thm)],[c_7863,c_2084]) ).
tcf(c_10296,plain,
( theorem(iPr_def_16)
| ~ theorem(or(iPr_def_13,iPr_def_15)) ),
inference(light_normalisation,[status(thm)],[c_10295,c_231]) ).
tcf(c_10297,plain,
~ theorem(or(iPr_def_13,iPr_def_15)),
inference(forward_subsumption_resolution,[status(thm)],[c_10296,c_232]) ).
tcf(c_14219,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
inference(superposition,[status(thm)],[c_59,c_706]) ).
tcf(c_14529,plain,
! [X0: $i] : theorem(or(iPr_def_14,or(iPr_def_13,X0))),
inference(superposition,[status(thm)],[c_229,c_14219]) ).
tcf(c_14645,plain,
theorem(or(iPr_def_13,iPr_def_15)),
inference(superposition,[status(thm)],[c_14529,c_1440]) ).
tcf(c_14646,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_14645,c_10297]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL182-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.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 22:15:19 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 7.44/2.28 % SZS status Started for theBenchmark.p
% 7.44/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 7.44/2.28
% 7.44/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.44/2.28
% 7.44/2.28 % ------ iProver source info
% 7.44/2.28
% 7.44/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 7.44/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.44/2.28 % git: non_committed_changes: false
% 7.44/2.28
% 7.44/2.28 % ------ Parsing...% successful
% 7.44/2.28
% 7.44/2.28
% 7.44/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.44/2.28
% 7.44/2.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 7.44/2.28
% 7.44/2.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.44/2.28
% 7.44/2.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.44/2.28 % ------ Proving...
% 7.44/2.28 % ------ Problem Properties
% 7.44/2.28
% 7.44/2.28 %
% 7.44/2.28 % clauses 16
% 7.44/2.28 % conjectures 1
% 7.44/2.28 % EPR 2
% 7.44/2.28 % Horn 16
% 7.44/2.28 % unary 13
% 7.44/2.28 % binary 1
% 7.44/2.28 % lits 21
% 7.44/2.28 % lits eq 7
% 7.44/2.29 % fd_pure 0
% 7.44/2.29 % fd_pseudo 0
% 7.44/2.29 % fd_cond 0
% 7.44/2.29 % fd_pseudo_cond 0
% 7.44/2.29 % AC symbols 0
% 7.44/2.29
% 7.44/2.29 % ------ Schedule dynamic 5 is on
% 7.44/2.29
% 7.44/2.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.44/2.29
% 7.44/2.29
% 7.44/2.29 % ------
% 7.44/2.29 % Current options:
% 7.44/2.29 % ------
% 7.44/2.29
% 7.44/2.29
% 7.44/2.29 %
% 7.44/2.29
% 7.44/2.29 % ------ Proving...
% 7.44/2.29 %
% 7.44/2.29
% 7.44/2.29 % SZS status Unsatisfiable for theBenchmark.p
% 7.44/2.29
% 7.44/2.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.44/2.29
% 7.44/2.29
%------------------------------------------------------------------------------