%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV390+1 : 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 : n008.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:08 PM UTC 2026
% Result : Theorem 0.07s 0.27s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 71 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 73 ( 31 ~; 25 |; 9 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 96 ( 88 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] : less_than(bottom,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(f25,axiom,
! [X0,X1,X2,X3,X4] :
( less_than(X4,X3)
=> ( check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2))
<=> check_cpq(triple(X0,X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(f30,axiom,
! [X0,X1,X2,X3] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(f42,axiom,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l26_li4142) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] : ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l26_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] : ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f68,plain,
! [X0,X1,X2,X3,X4] :
( ( check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2))
<=> check_cpq(triple(X0,X1,X2)) )
| ~ less_than(X4,X3) ),
inference(ennf_transformation,[],[f25]) ).
fof(f83,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ? [X3] : check_cpq(insert_cpq(triple(X0,X1,X2),X3))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f89,plain,
! [X0,X1,X2,X3,X4] :
( ( ( check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2))
| ~ check_cpq(triple(X0,X1,X2)) )
& ( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) ) )
| ~ less_than(X4,X3) ),
inference(nnf_transformation,[],[f68]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(rectify,[],[f91]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X1)),skolemize(X4,sK1(X1))],[f92]) ).
fof(f94,plain,
( check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5))
& ~ check_cpq(triple(sK2,sK3,sK4)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f84]) ).
fof(f99,plain,
! [X0] : less_than(bottom,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f124,plain,
! [X2,X3,X0,X1,X4] :
( ~ check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2))
| check_cpq(triple(X0,X1,X2))
| ~ less_than(X4,X3) ),
inference(cnf_transformation,[],[f89]) ).
fof(f131,plain,
! [X2,X3,X0,X1] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
inference(cnf_transformation,[],[f30]) ).
fof(f143,plain,
! [X2,X0,X1,X6,X5] :
( ~ check_cpq(triple(X0,X1,X2))
| ~ pair_in_list(X1,X5,X6)
| less_than(X6,X5) ),
inference(cnf_transformation,[],[f93]) ).
fof(f144,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| pair_in_list(X1,sK0(X1),sK1(X1)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f145,plain,
! [X2,X0,X1] :
( ~ less_than(sK1(X1),sK0(X1))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f146,plain,
~ check_cpq(triple(sK2,sK3,sK4)),
inference(cnf_transformation,[],[f94]) ).
fof(f147,plain,
check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f94]) ).
fof(f280,plain,
! [X2,X3,X0,X1] :
( ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(insert_pqp(X0,X3),X1,X2))
| ~ less_than(bottom,X3) ),
inference(superposition,[],[f124,f131]) ).
fof(f290,plain,
! [X2,X3,X0,X1] :
( ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3))
| check_cpq(triple(insert_pqp(X0,X3),X1,X2)) ),
inference(forward_subsumption_resolution,[],[f280,f99]) ).
fof(f360,plain,
check_cpq(triple(insert_pqp(sK2,sK5),sK3,sK4)),
inference(resolution,[],[f290,f147]) ).
fof(f362,plain,
! [X0,X1] :
( ~ pair_in_list(sK3,X0,X1)
| less_than(X1,X0) ),
inference(resolution,[],[f360,f143]) ).
fof(f369,plain,
! [X0,X1] :
( less_than(sK1(sK3),sK0(sK3))
| check_cpq(triple(X0,sK3,X1)) ),
inference(resolution,[],[f362,f144]) ).
fof(f370,plain,
! [X0,X1] : check_cpq(triple(X0,sK3,X1)),
inference(forward_subsumption_resolution,[],[f369,f145]) ).
fof(f372,plain,
$false,
inference(resolution,[],[f370,f146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV390+1 : 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.17 % Computer : n008.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 10:49:10 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.27 % (2167666)Will run a generic schedule for satisfiability detection.
% 0.07/0.27 % (2167675)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2045807368:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.27 % (2167671)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3879521239_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.27 % (2167674)dis+10_1_sil=32000:sp=arity:random_seed=4097113153:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.27 % (2167673)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=750700227:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.27 % (2167676)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=476378839:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.27 % (2167677)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3056762010:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.27 % (2167672)% WARNING: option uhcvi not known.
% 0.07/0.27 % TRYING [1]
% 0.07/0.27 % (2167672)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=224283497:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.27 % TRYING [2]
% 0.07/0.27 % TRYING [3]
% 0.07/0.27 % (2167674) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2167666-2167674"...
% 0.07/0.27 % (2167674)...printing done.
% 0.07/0.27 % (2167674)Refutation found. Thanks to Tanya!
% 0.07/0.27 % SZS status Theorem for theBenchmark
% 0.07/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.27 % (2167674)------------------------------
% 0.07/0.27 % (2167674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.27 % (2167674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.27 % (2167674)CaDiCaL version: 2.1.3
% 0.07/0.27 % (2167674)Termination reason: Refutation
% 0.07/0.27 % (2167674)Time elapsed: 0.012 s
% 0.07/0.27 % (2167674)Peak memory usage: 12 MB
% 0.07/0.27 % (2167674)Instructions burned: 16 (million)
% 0.07/0.27 % (2167666)Success in time 0.048 s
% 0.07/0.27 % Vampire exiting
%------------------------------------------------------------------------------