%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM023-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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:23:15 PM UTC 2026
% Result : Unsatisfiable 1.83s 6.28s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 9 unt; 1 def)
% Number of atoms : 16 ( 1 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : equalish(add(X0,n0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-0.ax',adding_zero) ).
fof(f8,axiom,
! [X2,X0,X1] :
( less(X1,X2)
| ~ equalish(add(successor(X0),X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
fof(f15,negated_conjecture,
~ less(n0,successor(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_zero_is_less_than_all_successors) ).
tcf(c_64,plain,
! [X0: $i] : equalish(add(X0,n0),X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X1,X2)
| ~ equalish(add(successor(X0),X1),X2) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_78,negated_conjecture,
~ less(n0,successor(a)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_176,definition,
iPr_def_10 = successor(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_177,negated_conjecture,
~ less(n0,iPr_def_10),
inference(demodulation,[status(thm)],[c_78,c_176]) ).
tcf(c_594,plain,
! [X0: $i] : less(n0,successor(X0)),
inference(superposition,[status(thm)],[c_64,c_71]) ).
tcf(c_709,plain,
less(n0,iPr_def_10),
inference(superposition,[status(thm)],[c_176,c_594]) ).
tcf(c_711,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_709,c_177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM023-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.37 % Computer : n001.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Thu Sep 24 02:46:13 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.42
% 0.14/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 1.83/6.28 % SZS status Started for theBenchmark.p
% 1.83/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.83/6.28
% 1.83/6.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.83/6.28
% 1.83/6.28 % ------ iProver source info
% 1.83/6.28
% 1.83/6.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.83/6.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.83/6.28 % git: non_committed_changes: false
% 1.83/6.28
% 1.83/6.28 % ------ Parsing...% successful
% 1.83/6.28
% 1.83/6.28
% 1.83/6.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.83/6.28
% 1.83/6.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.83/6.28
% 1.83/6.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.83/6.28
% 1.83/6.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.83/6.28 % ------ Proving...
% 1.83/6.28 % ------ Problem Properties
% 1.83/6.28
% 1.83/6.28 %
% 1.83/6.28 % clauses 16
% 1.83/6.28 % conjectures 1
% 1.83/6.28 % EPR 5
% 1.83/6.28 % Horn 16
% 1.83/6.28 % unary 9
% 1.83/6.28 % binary 5
% 1.83/6.28 % lits 25
% 1.83/6.28 % lits eq 1
% 1.83/6.28 % fd_pure 0
% 1.83/6.28 % fd_pseudo 0
% 1.83/6.28 % fd_cond 0
% 1.83/6.28 % fd_pseudo_cond 0
% 1.83/6.28 % AC symbols 0
% 1.83/6.28
% 1.83/6.28 % ------ Schedule dynamic 5 is on
% 1.83/6.28
% 1.83/6.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.83/6.28
% 1.83/6.28
% 1.83/6.28 % ------
% 1.83/6.28 % Current options:
% 1.83/6.28 % ------
% 1.83/6.28
% 1.83/6.28
% 1.83/6.28 %
% 1.83/6.28
% 1.83/6.28 % ------ Proving...
% 1.83/6.28 %
% 1.83/6.28
% 1.83/6.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.83/6.28
% 1.83/6.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.83/6.28
% 1.83/6.28
%------------------------------------------------------------------------------