%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV041+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:07:59 PM UTC 2026
% Result : Theorem 0.20s 1.03s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 77 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 20 ~; 14 |; 26 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 10 con; 0-3 aty)
% Number of variables : 30 ( 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt1) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f53,conjecture,
( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [X0] :
( ( leq(n0,X0)
& leq(X0,n2) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,minus(n0,n1)) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) = init ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_init_0077) ).
fof(f54,negated_conjecture,
~ ( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [X0] :
( ( leq(n0,X0)
& leq(X0,n2) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,minus(n0,n1)) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f93,axiom,
! [X0] :
( ( leq(n0,X0)
& leq(X0,n0) )
=> X0 = n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f103,plain,
( ? [X0] :
( ? [X1] :
( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) != init
& leq(n0,X1)
& leq(X1,minus(n0,n1)) )
& leq(n0,X0)
& leq(X0,n2) )
& geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f104,plain,
( ? [X0] :
( ? [X1] :
( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) != init
& leq(n0,X1)
& leq(X1,minus(n0,n1)) )
& leq(n0,X0)
& leq(X0,n2) )
& geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) ),
inference(flattening,[],[f103]) ).
fof(f105,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f106,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(flattening,[],[f105]) ).
fof(f109,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f130,plain,
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK1,sK0)
& leq(n0,sK1)
& leq(sK1,minus(n0,n1))
& leq(n0,sK0)
& leq(sK0,n2)
& geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f104]) ).
fof(f133,plain,
! [X0,X1] :
( ( leq(X0,pred(X1))
| ~ gt(X1,X0) )
& ( gt(X1,X0)
| ~ leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f138,plain,
leq(sK1,minus(n0,n1)),
inference(cnf_transformation,[],[f130]) ).
fof(f139,plain,
leq(n0,sK1),
inference(cnf_transformation,[],[f130]) ).
fof(f141,plain,
! [X0] :
( ~ leq(n0,X0)
| n0 = X0
| ~ leq(X0,n0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f143,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f161,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f177,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f189,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,pred(X1)) ),
inference(cnf_transformation,[],[f133]) ).
fof(f214,plain,
! [X0,X1] :
( ~ leq(X0,minus(X1,n1))
| gt(X1,X0) ),
inference(definition_unfolding,[],[f189,f161]) ).
fof(f355,plain,
gt(n0,sK1),
inference(resolution,[],[f214,f138]) ).
fof(f360,plain,
( ~ leq(sK1,n0)
| n0 = sK1 ),
inference(resolution,[],[f141,f139]) ).
fof(f377,plain,
( n0 = sK1
| ~ gt(n0,sK1) ),
inference(resolution,[],[f360,f143]) ).
fof(f378,plain,
n0 = sK1,
inference(forward_subsumption_resolution,[],[f377,f355]) ).
fof(f402,plain,
gt(sK1,sK1),
inference(superposition,[],[f355,f378]) ).
fof(f404,plain,
$false,
inference(forward_subsumption_resolution,[],[f402,f177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV041+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n026.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 09:47:11 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 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
% 0.20/1.03 % (3736713)Detected formulas, will run a generic FOF schedule.
% 0.20/1.03 % (3736724)dis-21_1_sil=8000:lcm=predicate:random_seed=1501041164: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)
% 0.20/1.03 % (3736724)Instruction limit reached!
% 0.20/1.03 % (3736724)------------------------------
% 0.20/1.03 % (3736724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.03 % (3736724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.03 % (3736724)CaDiCaL version: 2.1.3
% 0.20/1.03 % (3736724)Termination reason: Instruction limit
% 0.20/1.03 % (3736724)Termination phase: Saturation
% 0.20/1.03 % (3736724)Time elapsed: 0.037 s
% 0.20/1.03 % (3736724)Peak memory usage: 89 MB
% 0.20/1.03 % (3736724)Instructions burned: 132 (million)
% 0.20/1.03 % (3736722)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1898726829:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.20/1.03 % (3736718)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=2768211031:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.20/1.03 % (3736723)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3786144905:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.20/1.03 % (3736721)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=929754949:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.20/1.03 % (3736720)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=3651177951:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.20/1.03 % (3736719)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=4263212939:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.20/1.03 % (3736722)First to succeed.
% 0.20/1.03 % (3736722)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3736713"
% 0.20/1.03 % (3736723)Also succeeded, but the first one will report.
% 0.20/1.03 % (3736721)Instruction limit reached!
% 0.20/1.03 % (3736721)------------------------------
% 0.20/1.03 % (3736721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.03 % (3736721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.03 % (3736721)CaDiCaL version: 2.1.3
% 0.20/1.03 % (3736721)Termination reason: Instruction limit
% 0.20/1.03 % (3736721)Termination phase: Saturation
% 0.20/1.03 % (3736721)Time elapsed: 0.060 s
% 0.20/1.03 % (3736721)Peak memory usage: 88 MB
% 0.20/1.03 % (3736721)Instructions burned: 110 (million)
% 0.20/1.03 % (3736732)lrs+10_1_sil=8000:sp=occurrence:random_seed=1299637991:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.20/1.03 % (3736732)Also succeeded, but the first one will report.
% 0.20/1.03 % (3736733)lrs+10_1_sil=32000:urr=on:br=off:random_seed=611587308:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 0.20/1.03 % (3736722)Refutation found. Thanks to Tanya!
% 0.20/1.03 % SZS status Theorem for theBenchmark
% 0.20/1.03 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.03 % (3736722)------------------------------
% 0.20/1.03 % (3736722)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.03 % (3736722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.03 % (3736722)CaDiCaL version: 2.1.3
% 0.20/1.03 % (3736722)Termination reason: Refutation
% 0.20/1.03 % (3736722)Time elapsed: 0.007 s
% 0.20/1.03 % (3736722)Peak memory usage: 88 MB
% 0.20/1.03 % (3736722)Instructions burned: 9 (million)
% 0.20/1.03 % (3736722)------------------------------
% 0.20/1.03 % (3736722)------------------------------
% 0.20/1.03 % (3736713)Success in time 0.403 s
% 0.20/1.03 % Vampire exiting
%------------------------------------------------------------------------------