%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM931_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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 : Tue Sep 29 12:26:14 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 32 ( 16 ~; 10 |; 2 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 3 con; 0-4 aty)
% Number of variables : 15 ( 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
archimedean_ceiling:
!>[X0: $tType] : ( X0 > int ) ).
tff(func_def_1,type,
archim2085082626_floor:
!>[X0: $tType] : ( X0 > int ) ).
tff(func_def_2,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
nat_tsub: ( int * int ) > int ).
tff(func_def_5,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_6,type,
fFalse: bool ).
tff(func_def_7,type,
fTrue: bool ).
tff(func_def_8,type,
m: int ).
tff(func_def_9,type,
sK2:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_10,type,
sK3:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_11,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_12,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_13,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_14,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_15,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_16,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_17,type,
sK10:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_18,type,
sK11:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_19,type,
sK12:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_20,type,
sK13:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_21,type,
sK14:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_22,type,
sK15:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_23,type,
sK16:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_24,type,
sK17:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_25,type,
sK18:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_26,type,
sK19:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
dense_linorder:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
archim1727834104eiling:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_13,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(pred_def_15,type,
sP0: ( int * bool * bool ) > $o ).
tff(pred_def_16,type,
sP1: ( bool * int * bool ) > $o ).
tff(f1,axiom,
~ ord_less_eq(int,one_one(int),m),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__096_126_A1_A_060_061_Am_096) ).
tff(f70,axiom,
! [X0: $tType] :
( linorder(X0)
=> ! [X1: X0,X2: X0] :
( ~ ord_less(X0,X2,X1)
<=> ord_less_eq(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_69_linorder__not__less) ).
tff(f89,axiom,
! [X0: int] :
( ord_less_eq(int,one_one(int),X0)
<=> ord_less(int,zero_zero(int),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_88_int__one__le__iff__zero__less) ).
tff(f106,axiom,
linorder(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Orderings_Olinorder) ).
tff(f117,conjecture,
ord_less_eq(int,m,zero_zero(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f118,negated_conjecture,
~ ord_less_eq(int,m,zero_zero(int)),
inference(negated_conjecture,[status(cth)],[f117]) ).
tff(f119,plain,
~ ord_less_eq(int,m,zero_zero(int)),
inference(flattening,[],[f118]) ).
tff(f202,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] :
( ~ ord_less(X0,X2,X1)
<=> ord_less_eq(X0,X1,X2) )
| ~ linorder(X0) ),
inference(ennf_transformation,[],[f70]) ).
tff(f272,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] :
( ( ~ ord_less(X0,X2,X1)
| ~ ord_less_eq(X0,X1,X2) )
& ( ord_less_eq(X0,X1,X2)
| ord_less(X0,X2,X1) ) )
| ~ linorder(X0) ),
inference(nnf_transformation,[],[f202]) ).
tff(f282,plain,
! [X0: int] :
( ( ord_less_eq(int,one_one(int),X0)
| ~ ord_less(int,zero_zero(int),X0) )
& ( ord_less(int,zero_zero(int),X0)
| ~ ord_less_eq(int,one_one(int),X0) ) ),
inference(nnf_transformation,[],[f89]) ).
tff(f292,plain,
~ ord_less_eq(int,one_one(int),m),
inference(cnf_transformation,[],[f1]) ).
tff(f369,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ord_less_eq(X0,X1,X2)
| ord_less(X0,X2,X1)
| ~ linorder(X0) ),
inference(cnf_transformation,[],[f272]) ).
tff(f399,plain,
! [X0: int] :
( ~ ord_less(int,zero_zero(int),X0)
| ord_less_eq(int,one_one(int),X0) ),
inference(cnf_transformation,[],[f282]) ).
tff(f420,plain,
linorder(int),
inference(cnf_transformation,[],[f106]) ).
tff(f431,plain,
~ ord_less_eq(int,m,zero_zero(int)),
inference(cnf_transformation,[],[f119]) ).
tff(f473,plain,
( ord_less(int,zero_zero(int),m)
| ~ linorder(int) ),
inference(resolution,[],[f369,f431]) ).
tff(f477,plain,
ord_less(int,zero_zero(int),m),
inference(forward_subsumption_resolution,[],[f473,f420]) ).
tff(f545,plain,
ord_less_eq(int,one_one(int),m),
inference(resolution,[],[f399,f477]) ).
tff(f549,plain,
$false,
inference(forward_subsumption_resolution,[],[f545,f292]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM931_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n026.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 21:48:26 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.47 % (3241608)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3241616)dis+10_1_sil=32000:sp=arity:random_seed=4189488546:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (3241614)% WARNING: option uhcvi not known.
% 0.16/0.47 % (3241616) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3241608-3241616"...
% 0.16/0.47 % (3241616)...printing done.
% 0.16/0.47 % (3241616)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3241616)------------------------------
% 0.16/0.47 % (3241616)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3241616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3241616)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3241616)Termination reason: Refutation
% 0.16/0.47 % (3241616)Time elapsed: 0.003 s
% 0.16/0.47 % (3241616)Peak memory usage: 11 MB
% 0.16/0.47 % (3241616)Instructions burned: 9 (million)
% 0.16/0.47 % (3241608)Success in time 0.034 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------