%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n006.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:04 AM UTC 2026
% Result : Theorem 2.61s 1.11s
% Output : Refutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 20 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number arithmetic : 116 ( 24 atm; 10 fun; 55 num; 27 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 : 11 ( 5 usr; 9 con; 0-2 aty)
% Number of variables : 34 ( 34 !; 0 ?; 34 :)
% 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(func_def_10,type,
'$inst0': $int ).
tff(func_def_11,type,
'$inst1': $int ).
tff(func_def_12,type,
'$inst2': $int ).
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,negated_conjecture,
! [X0: $int,X1: $int,X3: list,X2: $int] :
( ( $less(X0,X1)
& fib_sorted(mycons(X1,mycons(X2,X3)))
& $greatereq(X2,$sum(X0,X1)) )
=> 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,X3: list,X2: $int] :
( ( $less(X0,X1)
& fib_sorted(mycons(X1,mycons(X2,X3)))
& ~ $less(X2,$sum(X0,X1)) )
=> fib_sorted(mycons(X0,mycons(X1,mycons(X2,X3)))) ),
inference(theory_normalization,[],[f4]) ).
tff(f20,plain,
! [X2: list,X0: $int,X1: $int,X3: $int] :
( ( $less(X0,X1)
& ~ $less(X3,$sum(X0,X1))
& fib_sorted(mycons(X1,mycons(X3,X2))) )
=> fib_sorted(mycons(X0,mycons(X1,mycons(X3,X2)))) ),
inference(rectify,[],[f7]) ).
tff(f21,plain,
~ fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
inference(flattening,[],[f6]) ).
tff(f22,plain,
! [X0: $int,X1: $int] :
( fib_sorted(mycons(X0,mycons(X1,nil)))
| ~ $less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
tff(f23,plain,
! [X2: list,X0: $int,X1: $int,X3: $int] :
( fib_sorted(mycons(X0,mycons(X1,mycons(X3,X2))))
| ~ $less(X0,X1)
| $less(X3,$sum(X0,X1))
| ~ fib_sorted(mycons(X1,mycons(X3,X2))) ),
inference(ennf_transformation,[],[f20]) ).
tff(f24,plain,
! [X0: $int,X3: $int,X2: list,X1: $int] :
( $less(X3,$sum(X0,X1))
| fib_sorted(mycons(X0,mycons(X1,mycons(X3,X2))))
| ~ fib_sorted(mycons(X1,mycons(X3,X2)))
| ~ $less(X0,X1) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
! [X0: $int,X1: $int,X2: list,X3: $int] :
( $less(X1,$sum(X0,X3))
| fib_sorted(mycons(X0,mycons(X3,mycons(X1,X2))))
| ~ fib_sorted(mycons(X3,mycons(X1,X2)))
| ~ $less(X0,X3) ),
inference(rectify,[],[f24]) ).
tff(f26,plain,
! [X0: $int,X1: $int] :
( fib_sorted(mycons(X0,mycons(X1,nil)))
| ~ $less(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tff(f27,plain,
! [X2: list,X3: $int,X0: $int,X1: $int] :
( fib_sorted(mycons(X0,mycons(X3,mycons(X1,X2))))
| $less(X1,$sum(X0,X3))
| ~ $less(X0,X3)
| ~ fib_sorted(mycons(X3,mycons(X1,X2))) ),
inference(cnf_transformation,[],[f25]) ).
tff(f30,plain,
~ fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
inference(cnf_transformation,[],[f21]) ).
tff(f33,plain,
( ~ $less(1,2)
| $less(4,$sum(1,2))
| ~ fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))) ),
inference(resolution,[],[f27,f30]) ).
tff(f34,plain,
~ fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))),
inference(evaluation,[],[f33]) ).
tff(f35,plain,
( $less(7,$sum(2,4))
| ~ fib_sorted(mycons(4,mycons(7,mycons(100,nil))))
| ~ $less(2,4) ),
inference(resolution,[],[f34,f27]) ).
tff(f36,plain,
~ fib_sorted(mycons(4,mycons(7,mycons(100,nil)))),
inference(evaluation,[],[f35]) ).
tff(f37,plain,
( ~ $less(4,7)
| $less(100,$sum(4,7))
| ~ fib_sorted(mycons(7,mycons(100,nil))) ),
inference(resolution,[],[f36,f27]) ).
tff(f38,plain,
~ fib_sorted(mycons(7,mycons(100,nil))),
inference(evaluation,[],[f37]) ).
tff(f146,plain,
~ $less(7,100),
inference(resolution,[],[f26,f38]) ).
tff(f147,plain,
$false,
inference(evaluation,[],[f146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % 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 THM
% 0.10/0.16 % Computer : n006.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 00:04:40 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running first-order theorem proving
% 0.10/0.20 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.61/1.11 % (326801)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.61/1.11 % (326808)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=1079791444:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.61/1.11 % (326808)First to succeed.
% 2.61/1.11 % (326808)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-326801"
% 2.61/1.11 % (326812)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3054927553:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.61/1.11 % (326811)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=920841700:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.61/1.11 % (326807)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=4215349839:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.61/1.11 % (326809)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3348954442:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.61/1.11 % (326810)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3660294467:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.61/1.11 % (326806)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=36565084:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.61/1.11 % (326810)Instruction limit reached!
% 2.61/1.11 % (326810)------------------------------
% 2.61/1.11 % (326810)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.11 % (326810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.11 % (326810)CaDiCaL version: 2.1.3
% 2.61/1.11 % (326810)Termination reason: Instruction limit
% 2.61/1.11 % (326810)Termination phase: Saturation
% 2.61/1.11 % (326810)Time elapsed: 0.004 s
% 2.61/1.11 % (326810)Peak memory usage: 88 MB
% 2.61/1.11 % (326810)Instructions burned: 5 (million)
% 2.61/1.11 % (326809)Instruction limit reached!
% 2.61/1.11 % (326809)------------------------------
% 2.61/1.11 % (326809)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.11 % (326809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.11 % (326809)CaDiCaL version: 2.1.3
% 2.61/1.11 % (326809)Termination reason: Instruction limit
% 2.61/1.11 % (326809)Termination phase: Saturation
% 2.61/1.11 % (326809)Time elapsed: 0.005 s
% 2.61/1.11 % (326809)Peak memory usage: 88 MB
% 2.61/1.11 % (326809)Instructions burned: 7 (million)
% 2.61/1.11 % (326806)Refutation not found, incomplete strategy
% 2.61/1.11 % (326806)------------------------------
% 2.61/1.11 % (326806)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.11 % (326806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.11 % (326806)CaDiCaL version: 2.1.3
% 2.61/1.11 % (326806)Termination reason: Refutation not found, incomplete strategy
% 2.61/1.11 % (326806)Time elapsed: 0.030 s
% 2.61/1.11 % (326806)Peak memory usage: 115 MB
% 2.61/1.11 % (326806)Instructions burned: 8 (million)
% 2.61/1.11 % (326811)Also succeeded, but the first one will report.
% 2.61/1.11 % (326807)Refutation not found, incomplete strategy
% 2.61/1.11 % (326807)------------------------------
% 2.61/1.11 % (326807)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.11 % (326807)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.11 % (326807)CaDiCaL version: 2.1.3
% 2.61/1.11 % (326807)Termination reason: Refutation not found, incomplete strategy
% 2.61/1.11 % (326807)Time elapsed: 0.035 s
% 2.61/1.11 % (326807)Peak memory usage: 115 MB
% 2.61/1.11 % (326807)Instructions burned: 15 (million)
% 2.61/1.11 % (326812)Instruction limit reached!
% 2.61/1.11 % (326812)------------------------------
% 2.61/1.11 % (326812)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.11 % (326812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.11 % (326812)CaDiCaL version: 2.1.3
% 2.61/1.11 % (326812)Termination reason: Instruction limit
% 2.61/1.11 % (326812)Termination phase: Saturation
% 2.61/1.11 % (326812)Time elapsed: 0.045 s
% 2.61/1.11 % (326812)Peak memory usage: 115 MB
% 2.61/1.11 % (326812)Instructions burned: 33 (million)
% 2.61/1.11 % (326808)Refutation found. Thanks to Tanya!
% 2.61/1.11 % SZS status Theorem for theBenchmark
% 2.61/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 2.61/1.11 % (326808)------------------------------
% 2.61/1.11 % (326808)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.11 % (326808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.11 % (326808)CaDiCaL version: 2.1.3
% 2.61/1.11 % (326808)Termination reason: Refutation
% 2.61/1.11 % (326808)Time elapsed: 0.022 s
% 2.61/1.11 % (326808)Peak memory usage: 116 MB
% 2.61/1.11 % (326808)Instructions burned: 15 (million)
% 2.61/1.11 % (326808)------------------------------
% 2.61/1.11 % (326808)------------------------------
% 2.61/1.11 % (326801)Success in time 0.289 s
% 2.61/1.11 % Vampire exiting
%------------------------------------------------------------------------------