%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL207-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 : n018.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:59 PM UTC 2026
% Result : Unsatisfiable 10.86s 2.30s
% Output : CNFRefutation 10.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 44 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
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(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(not(or(not(p),q))),or(not(q),p))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
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_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(not(or(not(p),q))),or(not(q),p))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_547,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c_60,c_63]) ).
tcf(c_723,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_61,c_64]) ).
tcf(c_893,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c_65,c_59]) ).
tcf(c_2474,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[c_893,c_547]) ).
tcf(c_4080,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X0),X1))),
inference(resolution,[status(thm)],[c_2474,c_723]) ).
tcf(c_4181,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(X0),or(not(not(or(X1,X0))),X2))),
inference(resolution,[status(thm)],[c_4080,c_893]) ).
tcf(c_11655,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(not(or(X0,X1))),or(not(X1),X2))),
inference(resolution,[status(thm)],[c_4181,c_723]) ).
tcf(c_21112,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_66,c_11655]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 22:22:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/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.15/0.41
% 0.15/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.41
% 0.15/0.41 % Detected problem language: tptp
% 0.15/0.43 % Proving...
% 10.86/2.30 % SZS status Started for theBenchmark.p
% 10.86/2.30 % SZS status Unsatisfiable for theBenchmark.p
% 10.86/2.30
% 10.86/2.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.86/2.30
% 10.86/2.30 % ------ iProver source info
% 10.86/2.30
% 10.86/2.30 % git: date: 2026-07-19 20:42:38 +0200
% 10.86/2.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.86/2.30 % git: non_committed_changes: false
% 10.86/2.30
% 10.86/2.30 % ------ Parsing...% successful
% 10.86/2.30
% 10.86/2.30
% 10.86/2.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.86/2.30
% 10.86/2.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 10.86/2.30
% 10.86/2.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.86/2.30 % ------ Proving...
% 10.86/2.30 % ------ Problem Properties
% 10.86/2.30
% 10.86/2.30 %
% 10.86/2.30 % clauses 9
% 10.86/2.30 % conjectures 1
% 10.86/2.30 % EPR 1
% 10.86/2.30 % Horn 9
% 10.86/2.30 % unary 6
% 10.86/2.30 % binary 1
% 10.86/2.30 % lits 14
% 10.86/2.30 % lits eq 0
% 10.86/2.30 % fd_pure 0
% 10.86/2.30 % fd_pseudo 0
% 10.86/2.30 % fd_cond 0
% 10.86/2.30 % fd_pseudo_cond 0
% 10.86/2.30 % AC symbols 0
% 10.86/2.30
% 10.86/2.30 % ------ Input Options Time Limit: Unbounded
% 10.86/2.30
% 10.86/2.30
% 10.86/2.30 % ------
% 10.86/2.30 % Current options:
% 10.86/2.30 % ------
% 10.86/2.30
% 10.86/2.30
% 10.86/2.30 %
% 10.86/2.30
% 10.86/2.30 % ------ Proving...
% 10.86/2.30 %
% 10.86/2.30
% 10.86/2.30 % SZS status Unsatisfiable for theBenchmark.p
% 10.86/2.30
% 10.86/2.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.86/2.30
% 10.86/2.30
%------------------------------------------------------------------------------