%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV007-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 : 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 03:16:12 PM UTC 2026
% Result : Unsatisfiable 0.30s 1.06s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 20 unt; 3 def)
% Number of atoms : 75 ( 8 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 46 ( 24 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ less_than(X2,X1)
| ~ less_than(X0,X2)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).
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(f10,axiom,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',anti_symmetry_of_less_than) ).
fof(f18,negated_conjecture,
~ less_than(n,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f19,negated_conjecture,
less_than(i,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f22,negated_conjecture,
less_than(a(m),a(k)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f25,negated_conjecture,
! [X0] :
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
tcf(c_77,plain,
! [X0: $i] : less_than(X0,successor(X0)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_than(X0,X2)
| ~ less_than(X1,X2)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( less_than(X1,X0)
| less_than(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_85,negated_conjecture,
~ less_than(n,m),
inference(cnf_transformation,[],[f18]) ).
tcf(c_86,negated_conjecture,
less_than(i,m),
inference(cnf_transformation,[],[f19]) ).
tcf(c_89,negated_conjecture,
less_than(a(m),a(k)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_92,negated_conjecture,
! [X0: $i] :
( less_than(X0,i)
| ~ less_than(X0,successor(n))
| ~ less_than(a(X0),a(k)) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_222,definition,
iPr_def_10 = a(k),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_223,definition,
iPr_def_11 = successor(n),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_226,definition,
iPr_def_14 = a(m),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_227,negated_conjecture,
! [X0: $i] :
( less_than(X0,i)
| ~ less_than(X0,iPr_def_11)
| ~ less_than(a(X0),iPr_def_10) ),
inference(demodulation,[status(thm)],[c_92,c_223,c_222]) ).
tcf(c_230,negated_conjecture,
less_than(iPr_def_14,iPr_def_10),
inference(demodulation,[status(thm)],[c_89,c_226]) ).
tcf(c_233,negated_conjecture,
less_than(i,m),
inference(demodulation,[status(thm)],[c_86]) ).
tcf(c_234,negated_conjecture,
~ less_than(n,m),
inference(demodulation,[status(thm)],[c_85]) ).
tcf(c_599,plain,
less_than(n,iPr_def_11),
inference(superposition,[status(thm)],[c_223,c_77]) ).
tcf(c_642,plain,
( less_than(m,i)
| ~ less_than(iPr_def_14,iPr_def_10)
| ~ less_than(m,iPr_def_11) ),
inference(superposition,[status(thm)],[c_226,c_227]) ).
tcf(c_643,plain,
( less_than(m,i)
| ~ less_than(m,iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_642,c_230]) ).
tcf(c_683,plain,
~ less_than(m,i),
inference(superposition,[status(thm)],[c_233,c_81]) ).
tcf(c_690,plain,
~ less_than(m,iPr_def_11),
inference(backward_subsumption_resolution,[status(thm)],[c_643,c_683]) ).
tcf(c_920,plain,
! [X0: $i] :
( less_than(n,X0)
| ~ less_than(iPr_def_11,X0) ),
inference(superposition,[status(thm)],[c_599,c_78]) ).
tcf(c_986,plain,
( less_than(iPr_def_11,m)
| ( m = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_79,c_690]) ).
tcf(c_1697,plain,
( less_than(n,m)
| ( m = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_986,c_920]) ).
tcf(c_1698,plain,
m = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_1697,c_234]) ).
tcf(c_1719,plain,
~ less_than(n,iPr_def_11),
inference(demodulation,[status(thm)],[c_234,c_1698]) ).
tcf(c_1721,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1719,c_599]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV007-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.10/0.35 % Computer : n010.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 : Thu Sep 24 18:17:28 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 0.30/1.06 % SZS status Started for theBenchmark.p
% 0.30/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 0.30/1.06
% 0.30/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.30/1.06
% 0.30/1.06 % ------ iProver source info
% 0.30/1.06
% 0.30/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 0.30/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.30/1.06 % git: non_committed_changes: false
% 0.30/1.06
% 0.30/1.06 % ------ Parsing...% successful
% 0.30/1.06
% 0.30/1.06
% 0.30/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.30/1.06
% 0.30/1.06 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.30/1.06
% 0.30/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.30/1.06
% 0.30/1.06 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.30/1.06 % ------ Proving...
% 0.30/1.06 % ------ Problem Properties
% 0.30/1.06
% 0.30/1.06 %
% 0.30/1.06 % clauses 26
% 0.30/1.06 % conjectures 11
% 0.30/1.06 % EPR 12
% 0.30/1.06 % Horn 24
% 0.30/1.06 % unary 18
% 0.30/1.06 % binary 3
% 0.30/1.06 % lits 40
% 0.30/1.06 % lits eq 13
% 0.30/1.06 % fd_pure 0
% 0.30/1.06 % fd_pseudo 0
% 0.30/1.06 % fd_cond 0
% 0.30/1.06 % fd_pseudo_cond 3
% 0.30/1.06 % AC symbols 0
% 0.30/1.06
% 0.30/1.06 % ------ Schedule dynamic 5 is on
% 0.30/1.06
% 0.30/1.06 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.30/1.06
% 0.30/1.06
% 0.30/1.06 % ------
% 0.30/1.06 % Current options:
% 0.30/1.06 % ------
% 0.30/1.06
% 0.30/1.06
% 0.30/1.06 %
% 0.30/1.06
% 0.30/1.06 % ------ Proving...
% 0.30/1.06 %
% 0.30/1.06
% 0.30/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 0.30/1.06
% 0.30/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.30/1.06
% 0.30/1.06
%------------------------------------------------------------------------------