%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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 03:16:12 PM UTC 2026
% Result : Unsatisfiable 1.54s 1.26s
% Output : CNFRefutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 19 unt; 2 def)
% Number of atoms : 117 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 122 ( 63 ~; 59 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0,X1] :
( less(X1,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f3,negated_conjecture,
less_or_equal(m,p),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f4,negated_conjecture,
less_or_equal(p,q),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f5,negated_conjecture,
less_or_equal(q,n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f6,negated_conjecture,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,n)
| ~ less(j,X1)
| ~ less(X0,i)
| ~ less_or_equal(m,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f7,negated_conjecture,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(m,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f8,negated_conjecture,
! [X0,X1] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(i,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f9,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
tcf(c_58,negated_conjecture,
! [X0: $i,X1: $i] :
( less(X1,X0)
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,negated_conjecture,
less_or_equal(m,p),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,negated_conjecture,
less_or_equal(p,q),
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,negated_conjecture,
less_or_equal(q,n),
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,negated_conjecture,
! [X0: $i,X1: $i] :
( less_or_equal(a(X1),a(X0))
| ~ less(j,X0)
| ~ less(X1,i)
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X0,n) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,negated_conjecture,
! [X0: $i,X1: $i] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,negated_conjecture,
! [X0: $i,X1: $i] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_111,definition,
iPr_def_10 = a(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_112,definition,
iPr_def_11 = a(q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_113,negated_conjecture,
~ less_or_equal(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_66,c_112,c_111]) ).
tcf(c_114,negated_conjecture,
! [X0: $i,X1: $i] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X1,n)
| ~ less_or_equal(X0,X1) ),
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_115,negated_conjecture,
! [X0: $i,X1: $i] :
( less_or_equal(a(X0),a(X1))
| ~ less_or_equal(m,X0)
| ~ less_or_equal(X1,j)
| ~ less_or_equal(X0,X1) ),
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_116,negated_conjecture,
! [X0: $i,X1: $i] :
( less_or_equal(a(X1),a(X0))
| ~ less(j,X0)
| ~ less(X1,i)
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X0,n) ),
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_117,negated_conjecture,
less_or_equal(q,n),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_118,negated_conjecture,
less_or_equal(p,q),
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_119,negated_conjecture,
less_or_equal(m,p),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_121,negated_conjecture,
! [X0: $i,X1: $i] :
( less(X1,X0)
| less_or_equal(X0,X1) ),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_295,plain,
! [X0: $i] :
( less_or_equal(iPr_def_10,a(X0))
| ~ less_or_equal(m,p)
| ~ less_or_equal(p,X0)
| ~ less_or_equal(X0,j) ),
inference(superposition,[status(thm)],[c_111,c_115]) ).
tcf(c_311,plain,
! [X0: $i] :
( less_or_equal(iPr_def_10,a(X0))
| ~ less_or_equal(p,X0)
| ~ less_or_equal(X0,j) ),
inference(forward_subsumption_resolution,[status(thm)],[c_295,c_119]) ).
tcf(c_322,plain,
! [X0: $i] :
( less_or_equal(a(X0),iPr_def_11)
| ~ less_or_equal(q,n)
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X0,q) ),
inference(superposition,[status(thm)],[c_112,c_114]) ).
tcf(c_323,plain,
! [X0: $i] :
( less_or_equal(a(X0),iPr_def_11)
| ~ less_or_equal(i,X0)
| ~ less_or_equal(X0,q) ),
inference(forward_subsumption_resolution,[status(thm)],[c_322,c_117]) ).
tcf(c_356,plain,
! [X0: $i] :
( less_or_equal(a(X0),iPr_def_11)
| ~ less(j,q)
| ~ less_or_equal(q,n)
| ~ less(X0,i)
| ~ less_or_equal(m,X0) ),
inference(superposition,[status(thm)],[c_112,c_116]) ).
tcf(c_357,plain,
! [X0: $i] :
( less_or_equal(a(X0),iPr_def_11)
| ~ less(j,q)
| ~ less(X0,i)
| ~ less_or_equal(m,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_356,c_117]) ).
tcf(c_388,plain,
( less_or_equal(iPr_def_10,iPr_def_11)
| ~ less_or_equal(q,j)
| ~ less_or_equal(p,q) ),
inference(superposition,[status(thm)],[c_112,c_311]) ).
tcf(c_389,plain,
~ less_or_equal(q,j),
inference(forward_subsumption_resolution,[status(thm)],[c_388,c_113,c_118]) ).
tcf(c_405,plain,
( less_or_equal(iPr_def_10,iPr_def_11)
| ~ less_or_equal(p,q)
| ~ less_or_equal(i,p) ),
inference(superposition,[status(thm)],[c_111,c_323]) ).
tcf(c_410,plain,
~ less_or_equal(i,p),
inference(forward_subsumption_resolution,[status(thm)],[c_405,c_113,c_118]) ).
tcf(c_483,plain,
( less_or_equal(iPr_def_10,iPr_def_11)
| ~ less(p,i)
| ~ less(j,q)
| ~ less_or_equal(m,p) ),
inference(superposition,[status(thm)],[c_111,c_357]) ).
tcf(c_489,plain,
( ~ less(p,i)
| ~ less(j,q) ),
inference(forward_subsumption_resolution,[status(thm)],[c_483,c_113,c_119]) ).
tcf(c_496,plain,
( less_or_equal(i,p)
| ~ less(j,q) ),
inference(superposition,[status(thm)],[c_121,c_489]) ).
tcf(c_497,plain,
~ less(j,q),
inference(forward_subsumption_resolution,[status(thm)],[c_496,c_410]) ).
tcf(c_516,plain,
less_or_equal(q,j),
inference(superposition,[status(thm)],[c_121,c_497]) ).
tcf(c_517,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_516,c_389]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 18:21:57 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.54/1.26 % SZS status Started for theBenchmark.p
% 1.54/1.26 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.26
% 1.54/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.54/1.26
% 1.54/1.26 % ------ iProver source info
% 1.54/1.26
% 1.54/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.54/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.54/1.26 % git: non_committed_changes: false
% 1.54/1.26
% 1.54/1.26 % ------ Parsing...% successful
% 1.54/1.26
% 1.54/1.26
% 1.54/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.54/1.26
% 1.54/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.54/1.26
% 1.54/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.54/1.26
% 1.54/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.54/1.26 % ------ Proving...
% 1.54/1.26 % ------ Problem Properties
% 1.54/1.26
% 1.54/1.26 %
% 1.54/1.26 % clauses 11
% 1.54/1.26 % conjectures 9
% 1.54/1.26 % EPR 6
% 1.54/1.26 % Horn 10
% 1.54/1.26 % unary 7
% 1.54/1.26 % binary 1
% 1.54/1.26 % lits 22
% 1.54/1.26 % lits eq 2
% 1.54/1.26 % fd_pure 0
% 1.54/1.26 % fd_pseudo 0
% 1.54/1.26 % fd_cond 0
% 1.54/1.26 % fd_pseudo_cond 0
% 1.54/1.26 % AC symbols 0
% 1.54/1.26
% 1.54/1.26 % ------ Schedule dynamic 5 is on
% 1.54/1.26
% 1.54/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.54/1.26
% 1.54/1.26
% 1.54/1.26 % ------
% 1.54/1.26 % Current options:
% 1.54/1.26 % ------
% 1.54/1.26
% 1.54/1.26
% 1.54/1.26 %
% 1.54/1.26
% 1.54/1.26 % ------ Proving...
% 1.54/1.26 %
% 1.54/1.26
% 1.54/1.26 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.26
% 1.54/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.54/1.26
% 1.54/1.26
%------------------------------------------------------------------------------