%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n009.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:09:05 PM UTC 2026
% Result : Theorem 5.67s 1.64s
% Output : Refutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 76 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 82 ( 37 ~; 28 |; 9 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 106 ( 98 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] : less_than(bottom,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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,X1,X2))
| ~ check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),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] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6)
| ~ check_cpq(triple(X0,X1,X2)) ),
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(f155,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(triple(X2,X0,X3))
| ~ pair_in_list(X0,sK0(X1),sK1(X1))
| check_cpq(triple(X4,X1,X5)) ),
inference(resolution,[],[f143,f145]) ).
fof(f158,plain,
! [X0,X1] :
( ~ check_cpq(triple(sK2,insert_slb(sK3,pair(X0,X1)),sK4))
| ~ less_than(X1,X0) ),
inference(resolution,[],[f124,f146]) ).
fof(f160,plain,
! [X0,X1] :
( pair_in_list(insert_slb(sK3,pair(X1,X0)),sK0(insert_slb(sK3,pair(X1,X0))),sK1(insert_slb(sK3,pair(X1,X0))))
| ~ less_than(X0,X1) ),
inference(resolution,[],[f158,f144]) ).
fof(f267,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3))
| ~ pair_in_list(insert_slb(X1,pair(X3,bottom)),sK0(X4),sK1(X4))
| check_cpq(triple(X5,X4,X6)) ),
inference(superposition,[],[f155,f131]) ).
fof(f398,plain,
! [X2,X0,X1] :
( ~ pair_in_list(insert_slb(sK3,pair(sK5,bottom)),sK0(X0),sK1(X0))
| check_cpq(triple(X1,X0,X2)) ),
inference(resolution,[],[f267,f147]) ).
fof(f404,plain,
! [X0,X1] :
( check_cpq(triple(X0,insert_slb(sK3,pair(sK5,bottom)),X1))
| ~ less_than(bottom,sK5) ),
inference(resolution,[],[f398,f160]) ).
fof(f409,plain,
! [X0,X1] : check_cpq(triple(X0,insert_slb(sK3,pair(sK5,bottom)),X1)),
inference(forward_subsumption_resolution,[],[f404,f99]) ).
fof(f411,plain,
~ less_than(bottom,sK5),
inference(resolution,[],[f409,f158]) ).
fof(f416,plain,
$false,
inference(forward_subsumption_resolution,[],[f411,f99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV390+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.19 % Computer : n009.cluster.edu
% 0.13/0.19 % Model : x86_64 x86_64
% 0.13/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.19 % Memory : 8046.5625MB
% 0.13/0.19 % OS : Linux 6.8.0-71-generic
% 0.13/0.19 % CPULimit : 300
% 0.13/0.19 % WCLimit : 300
% 0.13/0.19 % DateTime : Mon Sep 28 10:48:30 UTC 2026
% 0.13/0.19 % CPUTime :
% 0.13/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.23 Running first-order theorem proving
% 0.13/0.23 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.67/1.64 % (2948847)Detected formulas, will run a generic FOF schedule.
% 5.67/1.64 % (2948872)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2032645581:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.67/1.64 % (2948878)dis-21_1_sil=8000:lcm=predicate:random_seed=4107213696:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 5.67/1.64 % (2948873)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2569250048:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.67/1.64 % (2948876)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4025475474:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.67/1.64 % (2948878)Instruction limit reached!
% 5.67/1.64 % (2948878)------------------------------
% 5.67/1.64 % (2948878)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.67/1.64 % (2948878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.67/1.64 % (2948878)CaDiCaL version: 2.1.3
% 5.67/1.64 % (2948878)Termination reason: Instruction limit
% 5.67/1.64 % (2948878)Termination phase: Saturation
% 5.67/1.64 % (2948878)Time elapsed: 0.056 s
% 5.67/1.64 % (2948878)Peak memory usage: 88 MB
% 5.67/1.64 % (2948878)Instructions burned: 130 (million)
% 5.67/1.64 % (2948875)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1881393040:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.67/1.64 % (2948874)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=953400697:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.67/1.64 % (2948877)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1549877701:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.67/1.64 % (2948877)First to succeed.
% 5.67/1.64 % (2948877)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2948847"
% 5.67/1.64 % (2948876)Instruction limit reached!
% 5.67/1.64 % (2948876)------------------------------
% 5.67/1.64 % (2948876)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.67/1.64 % (2948876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.67/1.64 % (2948876)CaDiCaL version: 2.1.3
% 5.67/1.64 % (2948876)Termination reason: Instruction limit
% 5.67/1.64 % (2948876)Termination phase: Saturation
% 5.67/1.64 % (2948876)Time elapsed: 0.080 s
% 5.67/1.64 % (2948876)Peak memory usage: 87 MB
% 5.67/1.64 % (2948876)Instructions burned: 120 (million)
% 5.67/1.64 % (2948875)Instruction limit reached!
% 5.67/1.64 % (2948875)------------------------------
% 5.67/1.64 % (2948875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.67/1.64 % (2948875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.67/1.64 % (2948875)CaDiCaL version: 2.1.3
% 5.67/1.64 % (2948875)Termination reason: Instruction limit
% 5.67/1.64 % (2948875)Termination phase: Saturation
% 5.67/1.64 % (2948875)Time elapsed: 0.095 s
% 5.67/1.64 % (2948875)Peak memory usage: 89 MB
% 5.67/1.64 % (2948875)Instructions burned: 110 (million)
% 5.67/1.64 % (2948885)lrs+10_1_sil=8000:sp=occurrence:random_seed=3067042664:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.67/1.64 % (2948890)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2332398780:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.67/1.64 % (2948885)Also succeeded, but the first one will report.
% 5.67/1.64 % (2948890)Instruction limit reached!
% 5.67/1.64 % (2948890)------------------------------
% 5.67/1.64 % (2948890)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.67/1.64 % (2948890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.67/1.64 % (2948890)CaDiCaL version: 2.1.3
% 5.67/1.64 % (2948890)Termination reason: Instruction limit
% 5.67/1.64 % (2948890)Termination phase: Saturation
% 5.67/1.64 % (2948890)Time elapsed: 0.084 s
% 5.67/1.64 % (2948890)Peak memory usage: 89 MB
% 5.67/1.64 % (2948890)Instructions burned: 158 (million)
% 5.67/1.64 % (2948893)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2010903109:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.67/1.64 % (2948893)Also succeeded, but the first one will report.
% 5.67/1.64 % (2948877)Refutation found. Thanks to Tanya!
% 5.67/1.64 % SZS status Theorem for theBenchmark
% 5.67/1.64 % SZS output start Proof for theBenchmark
% See solution above
% 5.67/1.64 % (2948877)------------------------------
% 5.67/1.64 % (2948877)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.67/1.64 % (2948877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.67/1.64 % (2948877)CaDiCaL version: 2.1.3
% 5.67/1.64 % (2948877)Termination reason: Refutation
% 5.67/1.64 % (2948877)Time elapsed: 0.034 s
% 5.67/1.64 % (2948877)Peak memory usage: 89 MB
% 5.67/1.64 % (2948877)Instructions burned: 45 (million)
% 5.67/1.64 % (2948877)------------------------------
% 5.67/1.64 % (2948877)------------------------------
% 5.67/1.64 % (2948847)Success in time 0.714 s
% 5.67/1.64 % Vampire exiting
%------------------------------------------------------------------------------