%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV046+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 : n016.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.16s 1.13s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 18 unt; 0 def)
% Number of atoms : 76 ( 42 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 81 ( 31 ~; 18 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 15 con; 0-3 aty)
% Number of variables : 7 ( 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] : sum(n0,tptp_minus_1,X0) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_plus_base) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).
fof(f53,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0010) ).
fof(f54,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( ( ( ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& n0 != pv44 )
| ( ~ true
& n0 = pv44 ) )
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ( ( ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& n0 != pv44 )
| ( ~ true
& n0 = pv44 ) )
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ),
inference(flattening,[],[f94]) ).
fof(f126,plain,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f95]) ).
fof(f127,plain,
leq(n0,pv35),
inference(cnf_transformation,[],[f95]) ).
fof(f129,plain,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(cnf_transformation,[],[f95]) ).
fof(f133,plain,
( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1))
| ~ true ),
inference(cnf_transformation,[],[f95]) ).
fof(f139,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f140,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(cnf_transformation,[],[f26]) ).
fof(f152,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f174,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f198,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f202,plain,
! [X0] : minus(succ(X0),n1) = X0,
inference(definition_unfolding,[],[f198,f152]) ).
fof(f210,plain,
( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1))
| ~ true ),
inference(forward_subsumption_resolution,[],[f133,f129]) ).
fof(f211,plain,
( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| ~ leq(pv35,minus(n5,n1))
| ~ true ),
inference(forward_subsumption_resolution,[],[f210,f127]) ).
fof(f212,plain,
( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| ~ true ),
inference(forward_subsumption_resolution,[],[f211,f126]) ).
fof(f213,plain,
n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))),
inference(forward_subsumption_resolution,[],[f212,f139]) ).
fof(f219,plain,
tptp_minus_1 = minus(n0,n1),
inference(superposition,[],[f202,f174]) ).
fof(f335,plain,
n0 != sum(n0,tptp_minus_1,times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))),
inference(superposition,[],[f213,f219]) ).
fof(f339,plain,
$false,
inference(forward_subsumption_resolution,[],[f335,f140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV046+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.17 % Computer : n016.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:52:48 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running first-order theorem proving
% 0.08/0.20 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.16/1.13 % (3522097)Detected formulas, will run a generic FOF schedule.
% 0.16/1.13 % (3522106)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1412359343:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.16/1.13 % (3522106)First to succeed.
% 0.16/1.13 % (3522106)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3522097"
% 0.16/1.13 % (3522103)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=481525731:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.16/1.13 % (3522104)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=1187886419:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.16/1.13 % (3522105)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=408688559:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.16/1.13 % (3522102)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=1527587132:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.16/1.13 % (3522107)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=810793940:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.16/1.13 % (3522108)dis-21_1_sil=8000:lcm=predicate:random_seed=1057529355: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.16/1.13 % (3522107)Also succeeded, but the first one will report.
% 0.16/1.13 % (3522105)Instruction limit reached!
% 0.16/1.13 % (3522105)------------------------------
% 0.16/1.13 % (3522105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.13 % (3522105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.13 % (3522105)CaDiCaL version: 2.1.3
% 0.16/1.13 % (3522105)Termination reason: Instruction limit
% 0.16/1.13 % (3522105)Termination phase: Saturation
% 0.16/1.13 % (3522105)Time elapsed: 0.048 s
% 0.16/1.13 % (3522105)Peak memory usage: 88 MB
% 0.16/1.13 % (3522105)Instructions burned: 111 (million)
% 0.16/1.13 % (3522108)Instruction limit reached!
% 0.16/1.13 % (3522108)------------------------------
% 0.16/1.13 % (3522108)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.13 % (3522108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.13 % (3522108)CaDiCaL version: 2.1.3
% 0.16/1.13 % (3522108)Termination reason: Instruction limit
% 0.16/1.13 % (3522108)Termination phase: Saturation
% 0.16/1.13 % (3522108)Time elapsed: 0.068 s
% 0.16/1.13 % (3522108)Peak memory usage: 88 MB
% 0.16/1.13 % (3522108)Instructions burned: 130 (million)
% 0.16/1.13 % (3522106)Refutation found. Thanks to Tanya!
% 0.16/1.13 % SZS status Theorem for theBenchmark
% 0.16/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.14 % (3522106)------------------------------
% 0.16/1.14 % (3522106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.14 % (3522106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.14 % (3522106)CaDiCaL version: 2.1.3
% 0.16/1.14 % (3522106)Termination reason: Refutation
% 0.16/1.14 % (3522106)Time elapsed: 0.004 s
% 0.16/1.14 % (3522106)Peak memory usage: 88 MB
% 0.16/1.14 % (3522106)Instructions burned: 10 (million)
% 0.16/1.14 % (3522106)------------------------------
% 0.16/1.14 % (3522106)------------------------------
% 0.16/1.14 % (3522097)Success in time 0.294 s
% 0.16/1.14 % Vampire exiting
%------------------------------------------------------------------------------