%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV413+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 : n013.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:11 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 53 ( 21 ~; 13 |; 16 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 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 : 40 ( 30 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
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',l49_li3637) ).
fof(f20,conjecture,
! [X0,X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X3)
& less_than(X3,X2) )
=> ? [X4] :
( pair_in_list(update_slb(X0,X3),X1,X4)
& less_than(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_co) ).
fof(f21,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X3)
& less_than(X3,X2) )
=> ? [X4] :
( pair_in_list(update_slb(X0,X3),X1,X4)
& less_than(X3,X4) ) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f30,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(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(flattening,[],[f30]) ).
fof(f32,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ pair_in_list(update_slb(X0,X3),X1,X4)
| ~ less_than(X3,X4) )
& pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X3)
& less_than(X3,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f33,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ pair_in_list(update_slb(X0,X3),X1,X4)
| ~ less_than(X3,X4) )
& pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X3)
& less_than(X3,X2) ),
inference(flattening,[],[f32]) ).
fof(f40,plain,
( ! [X4] :
( ~ pair_in_list(update_slb(sK0,sK3),sK1,X4)
| ~ less_than(sK3,X4) )
& pair_in_list(sK0,sK1,sK2)
& strictly_less_than(sK1,sK3)
& less_than(sK3,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f33]) ).
fof(f66,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(cnf_transformation,[],[f31]) ).
fof(f67,plain,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f40]) ).
fof(f69,plain,
pair_in_list(sK0,sK1,sK2),
inference(cnf_transformation,[],[f40]) ).
fof(f70,plain,
! [X4] :
( ~ pair_in_list(update_slb(sK0,sK3),sK1,X4)
| ~ less_than(sK3,X4) ),
inference(cnf_transformation,[],[f40]) ).
fof(f100,plain,
! [X0] :
( ~ pair_in_list(sK0,sK1,X0)
| ~ less_than(sK3,X0)
| ~ less_than(sK3,X0) ),
inference(resolution,[],[f66,f70]) ).
fof(f101,plain,
! [X0] :
( ~ pair_in_list(sK0,sK1,X0)
| ~ less_than(sK3,X0) ),
inference(duplicate_literal_removal,[],[f100]) ).
fof(f110,plain,
~ less_than(sK3,sK2),
inference(resolution,[],[f101,f69]) ).
fof(f111,plain,
$false,
inference(forward_subsumption_resolution,[],[f110,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV413+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n013.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 10:51:51 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.25 % (1093496)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (1093503)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2590667758:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25 % (1093503) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1093496-1093503"...
% 0.09/0.25 % (1093503)...printing done.
% 0.09/0.25 % (1093503)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (1093503)------------------------------
% 0.09/0.25 % (1093503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (1093503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (1093503)CaDiCaL version: 2.1.3
% 0.09/0.25 % (1093503)Termination reason: Refutation
% 0.09/0.25 % (1093503)Time elapsed: 0.001 s
% 0.09/0.25 % (1093503)Peak memory usage: 12 MB
% 0.09/0.25 % (1093503)Instructions burned: 2 (million)
% 0.09/0.25 % (1093496)Success in time 0.028 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------