%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV008-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 : n011.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 2.32s 1.45s
% Output : CNFRefutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 24 unt; 5 def)
% Number of atoms : 98 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 62 ( 32 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( X0 = X1
| less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',all_related) ).
fof(f15,negated_conjecture,
~ less_than(n,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f16,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f17,negated_conjecture,
less_than(a(l),a(predecessor(l))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f18,negated_conjecture,
! [X0] :
( ~ less_than(a(X0),a(predecessor(n)))
| ~ less_than(one,n)
| less_than(n,X0)
| less_than(X0,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f19,negated_conjecture,
! [X0] :
( ~ less_than(a(X0),a(predecessor(X0)))
| ~ less_than(X0,n)
| ~ less_than(one,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( less_than(X1,X0)
| less_than(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_76,negated_conjecture,
~ less_than(n,l),
inference(cnf_transformation,[],[f15]) ).
tcf(c_77,negated_conjecture,
less_than(one,l),
inference(cnf_transformation,[],[f16]) ).
tcf(c_78,negated_conjecture,
less_than(a(l),a(predecessor(l))),
inference(cnf_transformation,[],[f17]) ).
tcf(c_79,negated_conjecture,
! [X0: $i] :
( less_than(n,X0)
| less_than(X0,n)
| ~ less_than(one,n)
| ~ less_than(a(X0),a(predecessor(n))) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_80,negated_conjecture,
! [X0: $i] :
( ~ less_than(one,X0)
| ~ less_than(X0,n)
| ~ less_than(a(X0),a(predecessor(X0))) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_187,definition,
iPr_def_10 = predecessor(n),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_188,definition,
iPr_def_11 = a(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_189,definition,
iPr_def_12 = a(l),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_190,definition,
iPr_def_13 = predecessor(l),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_191,definition,
iPr_def_14 = a(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_192,negated_conjecture,
! [X0: $i] :
( ~ less_than(one,X0)
| ~ less_than(X0,n)
| ~ less_than(a(X0),a(predecessor(X0))) ),
inference(demodulation,[status(thm)],[c_80]) ).
tcf(c_193,negated_conjecture,
! [X0: $i] :
( less_than(n,X0)
| less_than(X0,n)
| ~ less_than(one,n)
| ~ less_than(a(X0),iPr_def_11) ),
inference(demodulation,[status(thm)],[c_79,c_187,c_188]) ).
tcf(c_194,negated_conjecture,
less_than(iPr_def_12,iPr_def_14),
inference(demodulation,[status(thm)],[c_78,c_190,c_191,c_189]) ).
tcf(c_195,negated_conjecture,
less_than(one,l),
inference(demodulation,[status(thm)],[c_77]) ).
tcf(c_196,negated_conjecture,
~ less_than(n,l),
inference(demodulation,[status(thm)],[c_76]) ).
tcf(c_538,plain,
( less_than(l,n)
| less_than(n,l)
| ~ less_than(iPr_def_12,iPr_def_11)
| ~ less_than(one,n) ),
inference(superposition,[status(thm)],[c_189,c_193]) ).
tcf(c_539,plain,
( ~ less_than(one,l)
| ~ less_than(l,n)
| ~ less_than(iPr_def_12,a(predecessor(l))) ),
inference(superposition,[status(thm)],[c_189,c_192]) ).
tcf(c_540,plain,
( ~ less_than(iPr_def_12,iPr_def_14)
| ~ less_than(one,l)
| ~ less_than(l,n) ),
inference(light_normalisation,[status(thm)],[c_539,c_190,c_191]) ).
tcf(c_541,plain,
~ less_than(l,n),
inference(forward_subsumption_resolution,[status(thm)],[c_540,c_194,c_195]) ).
tcf(c_542,plain,
( less_than(n,l)
| ~ less_than(iPr_def_12,iPr_def_11)
| ~ less_than(one,n) ),
inference(forward_subsumption_resolution,[status(thm)],[c_538,c_541]) ).
tcf(c_543,plain,
( ~ less_than(iPr_def_12,iPr_def_11)
| ~ less_than(one,n) ),
inference(forward_subsumption_resolution,[status(thm)],[c_542,c_196]) ).
tcf(c_663,plain,
( less_than(n,l)
| ( n = l ) ),
inference(superposition,[status(thm)],[c_73,c_541]) ).
tcf(c_668,plain,
n = l,
inference(forward_subsumption_resolution,[status(thm)],[c_663,c_196]) ).
tcf(c_704,plain,
predecessor(n) = iPr_def_13,
inference(demodulation,[status(thm)],[c_190,c_668]) ).
tcf(c_707,plain,
less_than(one,n),
inference(demodulation,[status(thm)],[c_195,c_668]) ).
tcf(c_714,plain,
~ less_than(iPr_def_12,iPr_def_11),
inference(backward_subsumption_resolution,[status(thm)],[c_543,c_707]) ).
tcf(c_722,plain,
iPr_def_10 = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_704,c_187]) ).
tcf(c_724,plain,
a(iPr_def_10) = iPr_def_14,
inference(demodulation,[status(thm)],[c_191,c_722]) ).
tcf(c_725,plain,
iPr_def_11 = iPr_def_14,
inference(light_normalisation,[status(thm)],[c_724,c_188]) ).
tcf(c_726,plain,
less_than(iPr_def_12,iPr_def_11),
inference(demodulation,[status(thm)],[c_194,c_725]) ).
tcf(c_727,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_726,c_714]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 % Computer : n011.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Thu Sep 24 18:17:13 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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.17/0.48
% 0.17/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.17/0.48
% 0.17/0.48 % Detected problem language: tptp
% 0.17/0.50 % Proving...
% 2.32/1.45 % SZS status Started for theBenchmark.p
% 2.32/1.45 % SZS status Unsatisfiable for theBenchmark.p
% 2.32/1.45
% 2.32/1.45 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.32/1.45
% 2.32/1.45 % ------ iProver source info
% 2.32/1.45
% 2.32/1.45 % git: date: 2026-07-19 20:42:38 +0200
% 2.32/1.45 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.32/1.45 % git: non_committed_changes: false
% 2.32/1.45
% 2.32/1.45 % ------ Parsing...% successful
% 2.32/1.45
% 2.32/1.45
% 2.32/1.45 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.32/1.45
% 2.32/1.45 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.32/1.45
% 2.32/1.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.32/1.45
% 2.32/1.45 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.32/1.45 % ------ Proving...
% 2.32/1.45 % ------ Problem Properties
% 2.32/1.45
% 2.32/1.45 %
% 2.32/1.45 % clauses 20
% 2.32/1.45 % conjectures 5
% 2.32/1.45 % EPR 7
% 2.32/1.45 % Horn 18
% 2.32/1.45 % unary 13
% 2.32/1.45 % binary 3
% 2.32/1.45 % lits 32
% 2.32/1.45 % lits eq 12
% 2.32/1.46 % fd_pure 0
% 2.32/1.46 % fd_pseudo 0
% 2.32/1.46 % fd_cond 0
% 2.32/1.46 % fd_pseudo_cond 3
% 2.32/1.46 % AC symbols 0
% 2.32/1.46
% 2.32/1.46 % ------ Schedule dynamic 5 is on
% 2.32/1.46
% 2.32/1.46 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.32/1.46
% 2.32/1.46
% 2.32/1.46 % ------
% 2.32/1.46 % Current options:
% 2.32/1.46 % ------
% 2.32/1.46
% 2.32/1.46
% 2.32/1.46 %
% 2.32/1.46
% 2.32/1.46 % ------ Proving...
% 2.32/1.46 %
% 2.32/1.46
% 2.32/1.46 % SZS status Unsatisfiable for theBenchmark.p
% 2.32/1.46
% 2.32/1.46 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.32/1.46
% 2.32/1.46
%------------------------------------------------------------------------------