%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV408+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 88 ( 37 ~; 32 |; 13 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 81 ( 69 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f42,axiom,
! [X0,X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l45_li4647) ).
fof(f43,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/sandbox/benchmark/theBenchmark.p',l48_li3839) ).
fof(f44,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/sandbox/benchmark/theBenchmark.p',l49_li3637) ).
fof(f45,conjecture,
! [X0,X1,X2,X3] :
( ( contains_slb(X1,X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) )
=> ( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ? [X4] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
& less_than(findmin_pqp_res(X0),X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l44_co) ).
fof(f46,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( contains_slb(X1,X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) )
=> ( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ? [X4] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
& less_than(findmin_pqp_res(X0),X4) ) ) ),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f78,plain,
! [X0,X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f79,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,[],[f43]) ).
fof(f80,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,[],[f79]) ).
fof(f81,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,[],[f44]) ).
fof(f82,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,[],[f81]) ).
fof(f83,plain,
? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& ! [X4] :
( ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
| ~ less_than(findmin_pqp_res(X0),X4) )
& contains_slb(X1,X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f84,plain,
? [X0,X1,X2,X3] :
( ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& ! [X4] :
( ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
| ~ less_than(findmin_pqp_res(X0),X4) )
& contains_slb(X1,X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(flattening,[],[f83]) ).
fof(f86,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f90,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f135,plain,
! [X0,X1] :
( pair_in_list(X0,X1,sK0(X0,X1))
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f136,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,[],[f80]) ).
fof(f137,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,[],[f82]) ).
fof(f138,plain,
! [X4] :
( ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4)
| ~ less_than(findmin_pqp_res(sK1),X4) ),
inference(cnf_transformation,[],[f84]) ).
fof(f140,plain,
contains_slb(sK2,sK4),
inference(cnf_transformation,[],[f84]) ).
fof(f141,plain,
~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)),
inference(cnf_transformation,[],[f84]) ).
fof(f272,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(X0,X1,X2)
| pair_in_list(update_slb(X0,X3),X1,X3)
| ~ less_than(X2,X3)
| less_than(X3,X2) ),
inference(resolution,[],[f136,f90]) ).
fof(f273,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(X0,X1,X2)
| pair_in_list(update_slb(X0,X3),X1,X3)
| less_than(X3,X2) ),
inference(forward_subsumption_resolution,[],[f272,f86]) ).
fof(f281,plain,
! [X0] :
( ~ pair_in_list(sK2,sK4,X0)
| ~ less_than(findmin_pqp_res(sK1),X0)
| ~ less_than(findmin_pqp_res(sK1),X0) ),
inference(resolution,[],[f137,f138]) ).
fof(f283,plain,
! [X0] :
( ~ pair_in_list(sK2,sK4,X0)
| ~ less_than(findmin_pqp_res(sK1),X0) ),
inference(duplicate_literal_removal,[],[f281]) ).
fof(f1101,plain,
! [X0] :
( ~ pair_in_list(sK2,sK4,X0)
| less_than(findmin_pqp_res(sK1),X0) ),
inference(resolution,[],[f273,f141]) ).
fof(f1106,plain,
! [X0] : ~ pair_in_list(sK2,sK4,X0),
inference(forward_subsumption_resolution,[],[f1101,f283]) ).
fof(f1108,plain,
~ contains_slb(sK2,sK4),
inference(resolution,[],[f1106,f135]) ).
fof(f1109,plain,
$false,
inference(forward_subsumption_resolution,[],[f1108,f140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV408+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n011.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 10:51:00 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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.18/0.27 % (3316425)Will run a generic schedule for satisfiability detection.
% 0.18/0.27 % (3316434)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=536205543:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27 % (3316431)% WARNING: option uhcvi not known.
% 0.18/0.27 % (3316431)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=782967722:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27 % (3316430)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3801723645_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27 % (3316433)dis+10_1_sil=32000:sp=arity:random_seed=2555703540:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27 % (3316432)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1288706527:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27 % (3316436)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4231294700:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27 % (3316435)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1273875812:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27 % TRYING [1]
% 0.18/0.27 % TRYING [2]
% 0.18/0.27 % (3316434) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3316425-3316434"...
% 0.18/0.27 % (3316434)...printing done.
% 0.18/0.27 % TRYING [3]
% 0.18/0.27 % (3316434)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status Theorem for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (3316434)------------------------------
% 0.18/0.27 % (3316434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (3316434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (3316434)CaDiCaL version: 2.1.3
% 0.18/0.27 % (3316434)Termination reason: Refutation
% 0.18/0.27 % (3316434)Time elapsed: 0.017 s
% 0.18/0.27 % (3316434)Peak memory usage: 12 MB
% 0.18/0.27 % (3316434)Instructions burned: 47 (million)
% 0.18/0.27 % (3316425)Success in time 0.043 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------