TSTP Solution File: SWV056+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV056+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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 : Tue May 21 05:53:46 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 55 ( 19 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 41 ( 15 ~; 11 |; 10 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 8 ( 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f221,plain,
$false,
inference(avatar_sat_refutation,[],[f190,f191,f192,f219]) ).
fof(f219,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f218]) ).
fof(f218,plain,
( $false
| spl0_1 ),
inference(subsumption_resolution,[],[f217,f123]) ).
fof(f123,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(cnf_transformation,[],[f88]) ).
fof(f88,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(f217,plain,
( n0 != sum(n0,tptp_minus_1,a_select3(q,pv77,pv25))
| spl0_1 ),
inference(backward_demodulation,[],[f181,f212]) ).
fof(f212,plain,
tptp_minus_1 = minus(n0,n1),
inference(superposition,[],[f175,f142]) ).
fof(f142,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(f175,plain,
! [X0] : minus(succ(X0),n1) = X0,
inference(definition_unfolding,[],[f171,f135]) ).
fof(f135,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(f171,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(f181,plain,
( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| spl0_1 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f179,plain,
( spl0_1
<=> n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f192,plain,
spl0_2,
inference(avatar_split_clause,[],[f116,f183]) ).
fof(f183,plain,
( spl0_2
<=> leq(n0,pv25) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f116,plain,
leq(n0,pv25),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( ( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) )
& leq(pv25,minus(n5,n1))
& leq(n0,pv25) ),
inference(flattening,[],[f89]) ).
fof(f89,plain,
( ( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) )
& leq(pv25,minus(n5,n1))
& leq(n0,pv25) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv25,minus(n5,n1))
& leq(n0,pv25) )
=> ( leq(pv25,minus(n5,n1))
& leq(n0,pv25)
& n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( leq(pv25,minus(n5,n1))
& leq(n0,pv25) )
=> ( leq(pv25,minus(n5,n1))
& leq(n0,pv25)
& n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0040) ).
fof(f191,plain,
spl0_3,
inference(avatar_split_clause,[],[f117,f187]) ).
fof(f187,plain,
( spl0_3
<=> leq(pv25,minus(n5,n1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f117,plain,
leq(pv25,minus(n5,n1)),
inference(cnf_transformation,[],[f90]) ).
fof(f190,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f118,f187,f183,f179]) ).
fof(f118,plain,
( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
inference(cnf_transformation,[],[f90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV056+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 06:38:53 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.73 % (603)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.56/0.73 % (602)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.56/0.73 % (601)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.56/0.73 % (599)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.56/0.73 % (600)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.56/0.73 % (604)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.56/0.73 % (605)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.56/0.73 % (606)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.56/0.73 % (602)Refutation not found, incomplete strategy% (602)------------------------------
% 0.56/0.73 % (602)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (602)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (602)Memory used [KB]: 1104
% 0.56/0.73 % (602)Time elapsed: 0.004 s
% 0.56/0.73 % (602)Instructions burned: 5 (million)
% 0.56/0.73 % (602)------------------------------
% 0.56/0.73 % (602)------------------------------
% 0.56/0.73 % (601)First to succeed.
% 0.56/0.73 % (601)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-598"
% 0.56/0.73 % (601)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (601)------------------------------
% 0.56/0.73 % (601)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (601)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (601)Memory used [KB]: 1120
% 0.56/0.73 % (601)Time elapsed: 0.005 s
% 0.56/0.73 % (601)Instructions burned: 7 (million)
% 0.56/0.73 % (598)Success in time 0.41 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------