TSTP Solution File: SWV046+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWV046+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 18:55:20 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of formulae : 50 ( 38 unt; 0 def)
% Number of atoms : 112 ( 71 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 102 ( 40 ~; 30 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 38 ( 38 usr; 29 con; 0-3 aty)
% Number of variables : 7 ( 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f493,plain,
$false,
inference(subsumption_resolution,[],[f492,f379]) ).
fof(f379,plain,
leq(n0,pv35),
inference(cnf_transformation,[],[f166]) ).
fof(f166,plain,
( leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& ( ( ~ true
& n0 = pv44 )
| ( ( pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| 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)))) )
& n0 != pv44 ) ) ),
inference(flattening,[],[f165]) ).
fof(f165,plain,
( ( ( ~ true
& n0 = pv44 )
| ( ( pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| 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)))) )
& n0 != pv44 ) )
& leq(pv35,minus(n5,n1))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
=> ( ( 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))))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( leq(pv35,minus(n5,n1))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
=> ( ( 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))))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0010) ).
fof(f492,plain,
~ leq(n0,pv35),
inference(subsumption_resolution,[],[f491,f449]) ).
fof(f449,plain,
n0 != pv44,
inference(subsumption_resolution,[],[f374,f293]) ).
fof(f293,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).
fof(f374,plain,
( n0 != pv44
| ~ true ),
inference(cnf_transformation,[],[f166]) ).
fof(f491,plain,
( n0 = pv44
| ~ leq(n0,pv35) ),
inference(subsumption_resolution,[],[f490,f414]) ).
fof(f414,plain,
leq(pv35,sF31),
inference(definition_folding,[],[f378,f413]) ).
fof(f413,plain,
minus(n5,n1) = sF31,
introduced(function_definition,[]) ).
fof(f378,plain,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f166]) ).
fof(f490,plain,
( ~ leq(pv35,sF31)
| n0 = pv44
| ~ leq(n0,pv35) ),
inference(trivial_inequality_removal,[],[f487]) ).
fof(f487,plain,
( ~ leq(n0,pv35)
| ~ leq(pv35,sF31)
| n0 = pv44
| n0 != n0 ),
inference(backward_demodulation,[],[f438,f486]) ).
fof(f486,plain,
n0 = sF48,
inference(forward_demodulation,[],[f484,f408]) ).
fof(f408,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(rectify,[],[f26]) ).
fof(f26,axiom,
! [X22] : n0 = sum(n0,tptp_minus_1,X22),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_plus_base) ).
fof(f484,plain,
sum(n0,tptp_minus_1,sF47) = sF48,
inference(backward_demodulation,[],[f433,f483]) ).
fof(f483,plain,
tptp_minus_1 = sF39,
inference(forward_demodulation,[],[f480,f461]) ).
fof(f461,plain,
tptp_minus_1 = pred(n0),
inference(superposition,[],[f301,f326]) ).
fof(f326,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f301,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).
fof(f480,plain,
pred(n0) = sF39,
inference(superposition,[],[f424,f362]) ).
fof(f362,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f424,plain,
minus(n0,n1) = sF39,
introduced(function_definition,[]) ).
fof(f433,plain,
sum(n0,sF39,sF47) = sF48,
introduced(function_definition,[]) ).
fof(f438,plain,
( n0 != sF48
| n0 = pv44
| ~ leq(n0,pv35)
| ~ leq(pv35,sF31) ),
inference(trivial_inequality_removal,[],[f436]) ).
fof(f436,plain,
( ~ leq(n0,pv35)
| ~ leq(pv35,sF31)
| pv78 != pv78
| n0 = pv44
| n0 != sF48 ),
inference(backward_demodulation,[],[f435,f423]) ).
fof(f423,plain,
pv78 = sF38,
inference(definition_folding,[],[f376,f422,f421,f415]) ).
fof(f415,plain,
minus(n135300,n1) = sF32,
introduced(function_definition,[]) ).
fof(f421,plain,
a_select3(q,pv79,pv35) = sF37,
introduced(function_definition,[]) ).
fof(f422,plain,
sF38 = sum(n0,sF32,sF37),
introduced(function_definition,[]) ).
fof(f376,plain,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(cnf_transformation,[],[f166]) ).
fof(f435,plain,
( pv78 != sF38
| ~ leq(pv35,sF31)
| n0 = pv44
| n0 != sF48
| ~ leq(n0,pv35) ),
inference(definition_folding,[],[f373,f433,f432,f431,f430,f429,f428,f427,f426,f425,f429,f428,f427,f426,f425,f424,f413,f422,f421,f415]) ).
fof(f425,plain,
a_select2(x,pv83) = sF40,
introduced(function_definition,[]) ).
fof(f426,plain,
divide(pv80,pv44) = sF41,
introduced(function_definition,[]) ).
fof(f427,plain,
sF42 = tptp_update2(mu,pv35,sF41),
introduced(function_definition,[]) ).
fof(f428,plain,
a_select2(sF42,pv35) = sF43,
introduced(function_definition,[]) ).
fof(f429,plain,
minus(sF40,sF43) = sF44,
introduced(function_definition,[]) ).
fof(f430,plain,
a_select3(q,pv83,pv35) = sF45,
introduced(function_definition,[]) ).
fof(f431,plain,
times(sF44,sF45) = sF46,
introduced(function_definition,[]) ).
fof(f432,plain,
sF47 = times(sF44,sF46),
introduced(function_definition,[]) ).
fof(f373,plain,
( n0 = pv44
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| 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(cnf_transformation,[],[f166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV046+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 19:18:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (22612)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.50 % (22603)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (22606)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (22602)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.52 % (22617)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.52 % (22619)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.52 % (22609)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.52 % (22611)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.52 % (22620)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.52 % (22622)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.52 % (22601)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (22614)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.53 % (22599)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.54 % (22612)First to succeed.
% 0.20/0.54 % (22612)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (22612)------------------------------
% 0.20/0.54 % (22612)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (22612)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (22612)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (22612)Memory used [KB]: 1407
% 0.20/0.54 % (22612)Time elapsed: 0.134 s
% 0.20/0.54 % (22612)Instructions burned: 22 (million)
% 0.20/0.54 % (22612)------------------------------
% 0.20/0.54 % (22612)------------------------------
% 0.20/0.54 % (22596)Success in time 0.188 s
%------------------------------------------------------------------------------