%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV399+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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 01:21:09 PM UTC 2026
% Result : Theorem 0.09s 0.28s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 99 ( 41 ~; 42 |; 10 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 85 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( ( less_than(X0,X1)
& less_than(X1,X2) )
=> less_than(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',transitivity) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f19,axiom,
! [X0,X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& less_than(X3,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l35_li3637) ).
fof(f20,axiom,
! [X0,X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X2,X3) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l35_li3839) ).
fof(f21,conjecture,
! [X0] :
( ? [X1,X2] :
( pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X2) )
=> ! [X3] :
? [X4,X5] :
( pair_in_list(update_slb(X0,X3),X4,X5)
& strictly_less_than(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l35_co) ).
fof(f22,negated_conjecture,
~ ! [X0] :
( ? [X1,X2] :
( pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X2) )
=> ! [X3] :
? [X4,X5] :
( pair_in_list(update_slb(X0,X3),X4,X5)
& strictly_less_than(X4,X5) ) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f24,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
inference(flattening,[],[f23]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ),
inference(ennf_transformation,[],[f19]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3) ),
inference(ennf_transformation,[],[f20]) ).
fof(f34,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X2,X3) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
? [X0] :
( ? [X3] :
! [X4,X5] :
( ~ pair_in_list(update_slb(X0,X3),X4,X5)
| ~ strictly_less_than(X4,X5) )
& ? [X1,X2] :
( pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X2) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ less_than(X1,X2)
| ~ less_than(X0,X1)
| less_than(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f37,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f40,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f41,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f61,plain,
! [X2,X3,X0,X1] :
( ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2)
| pair_in_list(update_slb(X0,X3),X1,X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2)
| pair_in_list(update_slb(X0,X3),X1,X3) ),
inference(cnf_transformation,[],[f34]) ).
fof(f63,plain,
! [X4,X5] :
( ~ strictly_less_than(X4,X5)
| ~ pair_in_list(update_slb(sK0,sK3),X4,X5) ),
inference(cnf_transformation,[],[f35]) ).
fof(f64,plain,
strictly_less_than(sK1,sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f65,plain,
pair_in_list(sK0,sK1,sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f74,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(update_slb(X0,X3),X1,X2)
| pair_in_list(X0,X1,X2)
| ~ less_than(X3,X2) ),
inference(consistent_polarity_flipping,[],[f61]) ).
fof(f75,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X2,X3)
| pair_in_list(X0,X1,X2)
| ~ pair_in_list(update_slb(X0,X3),X1,X3) ),
inference(consistent_polarity_flipping,[],[f62]) ).
fof(f76,plain,
~ pair_in_list(sK0,sK1,sK2),
inference(consistent_polarity_flipping,[],[f65]) ).
fof(f77,plain,
! [X4,X5] :
( pair_in_list(update_slb(sK0,sK3),X4,X5)
| ~ strictly_less_than(X4,X5) ),
inference(consistent_polarity_flipping,[],[f63]) ).
fof(f80,plain,
less_than(sK1,sK2),
inference(resolution,[],[f40,f64]) ).
fof(f87,plain,
! [X0] :
( less_than(X0,sK2)
| ~ less_than(X0,sK1) ),
inference(resolution,[],[f36,f80]) ).
fof(f88,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f41,f37]) ).
fof(f112,plain,
! [X0,X1] :
( pair_in_list(sK0,X0,X1)
| ~ less_than(sK3,X1)
| ~ strictly_less_than(X0,X1) ),
inference(resolution,[],[f74,f77]) ).
fof(f115,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(update_slb(X0,X3),X1,X3)
| pair_in_list(X0,X1,X2)
| less_than(X3,X2) ),
inference(resolution,[],[f75,f88]) ).
fof(f138,plain,
( ~ less_than(sK3,sK2)
| ~ strictly_less_than(sK1,sK2) ),
inference(resolution,[],[f112,f76]) ).
fof(f139,plain,
~ less_than(sK3,sK2),
inference(forward_subsumption_resolution,[],[f138,f64]) ).
fof(f142,plain,
~ less_than(sK3,sK1),
inference(resolution,[],[f139,f87]) ).
fof(f165,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,sK3)
| less_than(sK3,X1)
| pair_in_list(sK0,X0,X1) ),
inference(resolution,[],[f115,f77]) ).
fof(f259,plain,
! [X0,X1] :
( pair_in_list(sK0,X1,X0)
| less_than(sK3,X0)
| less_than(sK3,X1) ),
inference(resolution,[],[f165,f88]) ).
fof(f762,plain,
( less_than(sK3,sK2)
| less_than(sK3,sK1) ),
inference(resolution,[],[f259,f76]) ).
fof(f763,plain,
less_than(sK3,sK1),
inference(forward_subsumption_resolution,[],[f762,f139]) ).
fof(f764,plain,
$false,
inference(forward_subsumption_resolution,[],[f763,f142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV399+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n017.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:45:36 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/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.09/0.28 % (3469059)Will run a generic schedule for satisfiability detection.
% 0.09/0.28 % (3469065)% WARNING: option uhcvi not known.
% 0.09/0.28 % (3469065)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2305237670:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.28 % (3469068)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1778002408:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.28 % (3469064)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=12331902_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.28 % (3469066)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2907951974:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.28 % (3469067)dis+10_1_sil=32000:sp=arity:random_seed=2532427212:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.28 % (3469070)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4245521533:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.28 % (3469069)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3298759347:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.28 % TRYING [1]
% 0.09/0.28 % TRYING [2]
% 0.09/0.28 % TRYING [3]
% 0.09/0.28 % (3469067) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3469059-3469067"...
% 0.09/0.28 % (3469065) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3469059-3469065"...
% 0.09/0.28 % (3469065)...printing done.
% 0.09/0.28 % (3469067)...printing done.
% 0.09/0.28 % (3469065)Refutation found. Thanks to Tanya!
% 0.09/0.28 % SZS status Theorem for theBenchmark
% 0.09/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.28 % (3469065)------------------------------
% 0.09/0.28 % (3469065)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.28 % (3469065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.28 % (3469065)CaDiCaL version: 2.1.3
% 0.09/0.28 % (3469065)Termination reason: Refutation
% 0.09/0.28 % (3469065)Time elapsed: 0.015 s
% 0.09/0.28 % (3469065)Peak memory usage: 12 MB
% 0.09/0.28 % (3469065)Instructions burned: 44 (million)
% 0.09/0.28 % (3469059)Success in time 0.041 s
% 0.09/0.28 % Vampire exiting
%------------------------------------------------------------------------------