%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV376+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:03 PM UTC 2026
% Result : Theorem 2.48s 1.10s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 89 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 44 ~; 31 |; 12 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 116 ( 92 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax41) ).
fof(f42,axiom,
( ! [X0,X1,X2,X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ ok(triple(X3,X4,X5))
=> ~ ok(im_succ_cpq(triple(X3,X4,X5))) ) )
=> ! [X6,X7,X8] :
( ~ ok(triple(X6,X7,X8))
=> ! [X9,X10,X11] :
( succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
=> ~ ok(triple(X9,X10,X11)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12_induction) ).
fof(f43,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12_l13) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ~ ok(triple(X3,X4,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l12_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ~ ok(triple(X3,X4,X5)) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f49,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f50,plain,
! [X0,X1,X2] :
( X2 = bad
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f51,plain,
( ! [X6,X7,X8] :
( ! [X9,X10,X11] :
( ~ ok(triple(X9,X10,X11))
| ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
| ok(triple(X6,X7,X8)) )
| ? [X0,X1,X2,X3,X4,X5] :
( ok(im_succ_cpq(triple(X3,X4,X5)))
& ~ ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f52,plain,
( ! [X6,X7,X8] :
( ! [X9,X10,X11] :
( ~ ok(triple(X9,X10,X11))
| ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
| ok(triple(X6,X7,X8)) )
| ? [X0,X1,X2,X3,X4,X5] :
( ok(im_succ_cpq(triple(X3,X4,X5)))
& ~ ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
( ok(triple(sK3,sK4,sK5))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5))
& ~ ok(triple(sK0,sK1,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f49]) ).
fof(f54,plain,
( ! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ok(triple(X0,X1,X2)) )
| ? [X6,X7,X8,X9,X10,X11] :
( ok(im_succ_cpq(triple(X9,X10,X11)))
& ~ ok(triple(X9,X10,X11))
& succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) ) ),
inference(rectify,[],[f52]) ).
fof(f55,plain,
( ! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ok(triple(X0,X1,X2)) )
| ( ok(im_succ_cpq(triple(sK9,sK10,sK11)))
& ~ ok(triple(sK9,sK10,sK11))
& succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X8,sK8),skolemize(X9,sK9),skolemize(X10,sK10),skolemize(X11,sK11)],[f54]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f48]) ).
fof(f57,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f53]) ).
fof(f58,plain,
succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f53]) ).
fof(f59,plain,
ok(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f53]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f50]) ).
fof(f61,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f63,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ~ ok(triple(sK9,sK10,sK11)) ),
inference(cnf_transformation,[],[f55]) ).
fof(f64,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK9,sK10,sK11))) ),
inference(cnf_transformation,[],[f55]) ).
fof(f70,plain,
( ~ ok(triple(sK3,sK4,sK5))
| ok(triple(sK0,sK1,sK2))
| ~ ok(triple(sK9,sK10,sK11)) ),
inference(resolution,[],[f63,f58]) ).
fof(f72,plain,
( ok(triple(sK0,sK1,sK2))
| ~ ok(triple(sK9,sK10,sK11)) ),
inference(forward_subsumption_resolution,[],[f70,f59]) ).
fof(f73,plain,
~ ok(triple(sK9,sK10,sK11)),
inference(forward_subsumption_resolution,[],[f72,f57]) ).
fof(f74,plain,
bad = sK11,
inference(resolution,[],[f73,f60]) ).
fof(f76,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ok(im_succ_cpq(triple(sK9,sK10,bad)))
| ok(triple(X0,X1,X2)) ),
inference(forward_demodulation,[],[f64,f74]) ).
fof(f78,plain,
( ~ ok(triple(sK3,sK4,sK5))
| ok(im_succ_cpq(triple(sK9,sK10,bad)))
| ok(triple(sK0,sK1,sK2)) ),
inference(resolution,[],[f76,f58]) ).
fof(f82,plain,
( ok(im_succ_cpq(triple(sK9,sK10,bad)))
| ok(triple(sK0,sK1,sK2)) ),
inference(forward_subsumption_resolution,[],[f78,f59]) ).
fof(f84,plain,
ok(im_succ_cpq(triple(sK9,sK10,bad))),
inference(forward_subsumption_resolution,[],[f82,f57]) ).
fof(f85,plain,
ok(triple(sK9,sK10,bad)),
inference(resolution,[],[f84,f56]) ).
fof(f86,plain,
$false,
inference(forward_subsumption_resolution,[],[f85,f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV376+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.15 % Computer : n005.cluster.edu
% 0.10/0.15 % Model : x86_64 x86_64
% 0.10/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.15 % Memory : 8046.5625MB
% 0.10/0.15 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 10:45:32 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 Running first-order theorem proving
% 0.10/0.19 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.48/1.10 % (711884)Detected formulas, will run a generic FOF schedule.
% 2.48/1.10 % (711893)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4151012804:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.48/1.10 % (711893)First to succeed.
% 2.48/1.10 % (711893)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-711884"
% 2.48/1.10 % (711891)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=2561335832:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.48/1.10 % (711895)dis-21_1_sil=8000:lcm=predicate:random_seed=3236398332: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)
% 2.48/1.10 % (711892)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=556812873:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.48/1.10 % (711894)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=291877528:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.48/1.10 % (711889)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=2416260579:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.48/1.10 % (711890)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=2222609549:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.48/1.10 % (711892)Also succeeded, but the first one will report.
% 2.48/1.10 % (711894)Also succeeded, but the first one will report.
% 2.48/1.10 % (711895)Instruction limit reached!
% 2.48/1.10 % (711895)------------------------------
% 2.48/1.10 % (711895)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.10 % (711895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.10 % (711895)CaDiCaL version: 2.1.3
% 2.48/1.10 % (711895)Termination reason: Instruction limit
% 2.48/1.10 % (711895)Termination phase: Saturation
% 2.48/1.10 % (711895)Time elapsed: 0.051 s
% 2.48/1.10 % (711895)Peak memory usage: 88 MB
% 2.48/1.10 % (711895)Instructions burned: 129 (million)
% 2.48/1.10 % (711893)Refutation found. Thanks to Tanya!
% 2.48/1.10 % SZS status Theorem for theBenchmark
% 2.48/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 2.48/1.10 % (711893)------------------------------
% 2.48/1.10 % (711893)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.10 % (711893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.10 % (711893)CaDiCaL version: 2.1.3
% 2.48/1.10 % (711893)Termination reason: Refutation
% 2.48/1.10 % (711893)Time elapsed: 0.002 s
% 2.48/1.10 % (711893)Peak memory usage: 88 MB
% 2.48/1.10 % (711893)Instructions burned: 2 (million)
% 2.48/1.10 % (711893)------------------------------
% 2.48/1.10 % (711893)------------------------------
% 2.48/1.10 % (711884)Success in time 0.274 s
% 2.48/1.10 % Vampire exiting
%------------------------------------------------------------------------------