%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT002_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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 09:47:56 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 46 ( 22 ~; 17 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number arithmetic : 104 ( 20 atm; 8 fun; 55 num; 21 var)
% Number of types : 3 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 2 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
mycons: ( $int * list ) > list ).
tff(pred_def_1,type,
fib_sorted: list > $o ).
tff(f3,axiom,
! [X0: $int,X1: $int] :
( $less(X0,X1)
=> fib_sorted(mycons(X0,mycons(X1,nil))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',double_is_fib_sorted_if_ordered) ).
tff(f4,axiom,
! [X0: $int,X1: $int,X2: $int,X3: list] :
( ( $less(X0,X1)
& $greatereq(X2,$sum(X0,X1))
& fib_sorted(mycons(X1,mycons(X2,X3))) )
=> fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',recursive_fib_sort) ).
tff(f5,conjecture,
fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',check_list) ).
tff(f6,negated_conjecture,
~ fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
inference(negated_conjecture,[status(cth)],[f5]) ).
tff(f7,plain,
! [X0: $int,X1: $int,X2: $int,X3: list] :
( ( $less(X0,X1)
& ~ $less(X2,$sum(X0,X1))
& fib_sorted(mycons(X1,mycons(X2,X3))) )
=> fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))) ),
inference(theory_normalization,[],[f4]) ).
tff(f20,plain,
~ fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
inference(flattening,[],[f6]) ).
tff(f21,plain,
! [X0: $int,X1: $int] :
( fib_sorted(mycons(X0,mycons(X1,nil)))
| ~ $less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
tff(f22,plain,
! [X0: $int,X1: $int,X2: $int,X3: list] :
( fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3))))
| ~ $less(X0,X1)
| $less(X2,$sum(X0,X1))
| ~ fib_sorted(mycons(X1,mycons(X2,X3))) ),
inference(ennf_transformation,[],[f7]) ).
tff(f23,plain,
! [X0: $int,X1: $int,X2: $int,X3: list] :
( fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3))))
| ~ $less(X0,X1)
| $less(X2,$sum(X0,X1))
| ~ fib_sorted(mycons(X1,mycons(X2,X3))) ),
inference(flattening,[],[f22]) ).
tff(f26,plain,
! [X0: $int,X1: $int] :
( fib_sorted(mycons(X0,mycons(X1,nil)))
| ~ $less(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tff(f27,plain,
! [X2: $int,X3: list,X0: $int,X1: $int] :
( fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3))))
| ~ $less(X0,X1)
| $less(X2,$sum(X0,X1))
| ~ fib_sorted(mycons(X1,mycons(X2,X3))) ),
inference(cnf_transformation,[],[f23]) ).
tff(f28,plain,
~ fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
inference(cnf_transformation,[],[f20]) ).
tff(f132,plain,
( ~ $less(1,2)
| $less(4,$sum(1,2))
| ~ fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))) ),
inference(resolution,[],[f27,f28]) ).
tff(f133,plain,
~ fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))),
inference(evaluation,[],[f132]) ).
tff(f134,plain,
( ~ $less(2,4)
| $less(7,$sum(2,4))
| ~ fib_sorted(mycons(4,mycons(7,mycons(100,nil)))) ),
inference(resolution,[],[f133,f27]) ).
tff(f135,plain,
~ fib_sorted(mycons(4,mycons(7,mycons(100,nil)))),
inference(evaluation,[],[f134]) ).
tff(f136,plain,
( ~ $less(4,7)
| $less(100,$sum(4,7))
| ~ fib_sorted(mycons(7,mycons(100,nil))) ),
inference(resolution,[],[f135,f27]) ).
tff(f137,plain,
~ fib_sorted(mycons(7,mycons(100,nil))),
inference(evaluation,[],[f136]) ).
tff(f157,plain,
~ $less(7,100),
inference(resolution,[],[f137,f26]) ).
tff(f158,plain,
$false,
inference(evaluation,[],[f157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT002_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n002.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 00:07:37 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.27 % (905766)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (905789)dis+10_1_sil=32000:sp=arity:random_seed=151153385:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (905787)% WARNING: option uhcvi not known.
% 0.20/0.27 % (905789) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-905766-905789"...
% 0.20/0.27 % (905789)...printing done.
% 0.20/0.27 % (905789)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (905789)------------------------------
% 0.20/0.27 % (905789)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (905789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (905789)CaDiCaL version: 2.1.3
% 0.20/0.27 % (905789)Termination reason: Refutation
% 0.20/0.27 % (905789)Time elapsed: 0.004 s
% 0.20/0.27 % (905789)Peak memory usage: 12 MB
% 0.20/0.27 % (905789)Instructions burned: 7 (million)
% 0.20/0.27 % (905766)Success in time 0.032 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------