TSTP Solution File: SWV165+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV165+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 : n008.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:54:16 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 14 unt; 0 def)
% Number of atoms : 81 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 68 ( 28 ~; 23 |; 9 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f259,plain,
$false,
inference(avatar_sat_refutation,[],[f209,f224,f258]) ).
fof(f258,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f257]) ).
fof(f257,plain,
( $false
| ~ spl1_1 ),
inference(subsumption_resolution,[],[f249,f248]) ).
fof(f248,plain,
gt(n0,sK0),
inference(forward_demodulation,[],[f214,f177]) ).
fof(f177,plain,
n0 = plus(n1,tptp_minus_1),
inference(definition_unfolding,[],[f131,f160]) ).
fof(f160,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f131,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(f214,plain,
gt(plus(n1,tptp_minus_1),sK0),
inference(unit_resulting_resolution,[],[f112,f174]) ).
fof(f174,plain,
! [X0,X1] :
( gt(plus(n1,X1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f119,f160]) ).
fof(f119,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f112,plain,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
? [X0] :
( uninit != init
& leq(X0,tptp_minus_1)
& leq(n0,X0) ),
inference(flattening,[],[f88]) ).
fof(f88,plain,
? [X0] :
( uninit != init
& leq(X0,tptp_minus_1)
& leq(n0,X0) ),
inference(ennf_transformation,[],[f87]) ).
fof(f87,plain,
~ ! [X0] :
( ( leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> uninit = init ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ! [X13] :
( ( leq(X13,tptp_minus_1)
& leq(n0,X13) )
=> uninit = init ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
! [X13] :
( ( leq(X13,tptp_minus_1)
& leq(n0,X13) )
=> uninit = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0001) ).
fof(f249,plain,
( ~ gt(n0,sK0)
| ~ spl1_1 ),
inference(unit_resulting_resolution,[],[f133,f204,f134]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ gt(X1,X2)
| ~ gt(X0,X1)
| gt(X0,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( gt(X1,X2)
& gt(X0,X1) )
=> gt(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_gt) ).
fof(f204,plain,
( gt(sK0,n0)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f202,plain,
( spl1_1
<=> gt(sK0,n0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f133,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f224,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f223]) ).
fof(f223,plain,
( $false
| ~ spl1_2 ),
inference(subsumption_resolution,[],[f222,f133]) ).
fof(f222,plain,
( gt(n0,n0)
| ~ spl1_2 ),
inference(forward_demodulation,[],[f221,f177]) ).
fof(f221,plain,
( gt(plus(n1,tptp_minus_1),n0)
| ~ spl1_2 ),
inference(forward_demodulation,[],[f214,f208]) ).
fof(f208,plain,
( n0 = sK0
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f206,plain,
( spl1_2
<=> n0 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f209,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f199,f206,f202]) ).
fof(f199,plain,
( n0 = sK0
| gt(sK0,n0) ),
inference(resolution,[],[f111,f121]) ).
fof(f121,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt2) ).
fof(f111,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWV165+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.09/0.12 % 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.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 07:55:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.33 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.60/0.80 % (24822)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.60/0.80 % (24826)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.60/0.80 % (24825)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.60/0.80 % (24827)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.60/0.80 % (24824)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.80 % (24828)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.60/0.80 % (24823)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.60/0.80 % (24829)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.60/0.81 % (24825)Refutation not found, incomplete strategy% (24825)------------------------------
% 0.60/0.81 % (24825)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (24825)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.81
% 0.60/0.81 % (24825)Memory used [KB]: 1067
% 0.60/0.81 % (24825)Time elapsed: 0.004 s
% 0.60/0.81 % (24825)Instructions burned: 2 (million)
% 0.60/0.81 % (24829)Refutation not found, incomplete strategy% (24829)------------------------------
% 0.60/0.81 % (24829)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (24829)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.81
% 0.60/0.81 % (24829)Memory used [KB]: 1094
% 0.60/0.81 % (24829)Time elapsed: 0.003 s
% 0.60/0.81 % (24829)Instructions burned: 4 (million)
% 0.60/0.81 % (24825)------------------------------
% 0.60/0.81 % (24825)------------------------------
% 0.60/0.81 % (24829)------------------------------
% 0.60/0.81 % (24829)------------------------------
% 0.60/0.81 % (24828)First to succeed.
% 0.60/0.81 % (24828)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24821"
% 0.60/0.81 % (24828)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for theBenchmark
% 0.60/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.81 % (24828)------------------------------
% 0.60/0.81 % (24828)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (24828)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (24828)Memory used [KB]: 1173
% 0.60/0.81 % (24828)Time elapsed: 0.006 s
% 0.60/0.81 % (24828)Instructions burned: 7 (million)
% 0.60/0.81 % (24821)Success in time 0.471 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------