%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM021-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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 0.59s 1.58s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 57 ( 27 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X2,X0,X1] :
( less(X2,X1)
| ~ less(X2,X0)
| ~ less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
fof(f8,axiom,
! [X2,X0,X1] :
( less(X1,X2)
| ~ equalish(add(successor(X0),X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
fof(f9,axiom,
! [X0,X1] :
( equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1)
| ~ less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',less_lemma) ).
fof(f10,axiom,
! [X0,X1] :
( equalish(X0,X1)
| less(X0,X1)
| ~ divides(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-2.ax',divides_only_less_or_equal) ).
fof(f15,axiom,
! [X2,X0,X1] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
fof(f16,axiom,
less(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_less_than_c) ).
fof(f17,axiom,
~ less(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_greater_equal_a) ).
fof(f18,negated_conjecture,
divides(c,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',impossible_c_divides_a) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X1)
| ~ less(X2,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X1,X2)
| ~ equalish(add(successor(X0),X1),X2) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| equalish(X0,X1)
| ~ divides(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_83,plain,
less(b,c),
inference(cnf_transformation,[],[f16]) ).
tcf(c_84,plain,
~ less(b,a),
inference(cnf_transformation,[],[f17]) ).
tcf(c_85,negated_conjecture,
divides(c,a),
inference(cnf_transformation,[],[f18]) ).
tcf(c_215,plain,
( less(c,a)
| equalish(c,a) ),
inference(resolution,[status(thm)],[c_85,c_77]) ).
tcf(c_240,plain,
( less(c,a)
| equalish(c,a) ),
inference(prop_impl_just,[status(thm)],[c_215]) ).
tcf(c_342,plain,
( equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),c)
| ~ less(b,c) ),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( equalish(add(successor(X0),X1),X3)
| ~ equalish(X2,X3)
| ~ equalish(add(successor(X0),X1),X2) ),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_406,plain,
! [X0: $i] :
( equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),X0)
| ~ equalish(c,X0)
| ~ equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),c) ),
inference(instantiation,[status(thm)],[c_344]) ).
tcf(c_479,plain,
( equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),a)
| ~ equalish(c,a)
| ~ equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),c) ),
inference(instantiation,[status(thm)],[c_406]) ).
tcf(c_832,plain,
! [X0: $i] :
( equalish(c,a)
| less(X0,a)
| ~ less(X0,c) ),
inference(superposition,[status(thm)],[c_240,c_74]) ).
tcf(c_2313,plain,
( less(b,a)
| ~ equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),a) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_2693,plain,
! [X0: $i] :
( ~ less(X0,c)
| less(X0,a) ),
inference(global_subsumption_just,[status(thm)],[c_832,c_83,c_84,c_342,c_479,c_832,c_2313]) ).
tcf(c_2694,plain,
! [X0: $i] :
( less(X0,a)
| ~ less(X0,c) ),
inference(renaming,[status(thm)],[c_2693]) ).
tcf(c_2700,plain,
less(b,a),
inference(superposition,[status(thm)],[c_83,c_2694]) ).
tcf(c_2701,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2700,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM021-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.62 % Computer : n020.cluster.edu
% 0.15/0.62 % Model : x86_64 x86_64
% 0.15/0.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.62 % Memory : 8046.5625MB
% 0.15/0.62 % OS : Linux 6.8.0-71-generic
% 0.15/0.62 % CPULimit : 300
% 0.15/0.63 % WCLimit : 300
% 0.15/0.63 % DateTime : Thu Sep 24 02:41:35 UTC 2026
% 0.15/0.63 % CPUTime :
% 0.15/0.63 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/0.68 Running first-order theorem proving
% 0.19/0.68 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.19/0.70
% 0.19/0.70 % ======== iProver multi-core TPTP/SMT =========
% 0.19/0.70
% 0.19/0.70 % Detected problem language: tptp
% 0.19/0.71 % Proving...
% 0.59/1.58 % SZS status Started for theBenchmark.p
% 0.59/1.58 % SZS status Unsatisfiable for theBenchmark.p
% 0.59/1.58
% 0.59/1.58 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.59/1.58
% 0.59/1.58 % ------ iProver source info
% 0.59/1.58
% 0.59/1.58 % git: date: 2026-07-19 20:42:38 +0200
% 0.59/1.58 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.59/1.58 % git: non_committed_changes: false
% 0.59/1.58
% 0.59/1.58 % ------ Parsing...% successful
% 0.59/1.58
% 0.59/1.58
% 0.59/1.58 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.59/1.58
% 0.59/1.58 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.59/1.58
% 0.59/1.58 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.59/1.58 % ------ Proving...
% 0.59/1.58 % ------ Problem Properties
% 0.59/1.58
% 0.59/1.58 %
% 0.59/1.58 % clauses 16
% 0.59/1.58 % conjectures 1
% 0.59/1.58 % EPR 7
% 0.59/1.58 % Horn 15
% 0.59/1.58 % unary 8
% 0.59/1.58 % binary 6
% 0.59/1.58 % lits 26
% 0.59/1.58 % lits eq 0
% 0.59/1.58 % fd_pure 0
% 0.59/1.58 % fd_pseudo 0
% 0.59/1.58 % fd_cond 0
% 0.59/1.58 % fd_pseudo_cond 0
% 0.59/1.58 % AC symbols 0
% 0.59/1.58
% 0.59/1.58 % ------ Schedule dynamic 5 is on
% 0.59/1.58
% 0.59/1.58 % ------ no equalities: superposition off
% 0.59/1.58
% 0.59/1.58 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.59/1.58
% 0.59/1.58
% 0.59/1.58 % ------
% 0.59/1.58 % Current options:
% 0.59/1.58 % ------
% 0.59/1.58
% 0.59/1.58
% 0.59/1.58 %
% 0.59/1.58
% 0.59/1.58 % ------ Proving...
% 0.59/1.58 %
% 0.59/1.58
% 0.59/1.58 % SZS status Unsatisfiable for theBenchmark.p
% 0.59/1.58
% 0.59/1.58 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.59/1.58
% 0.59/1.58
%------------------------------------------------------------------------------