TSTP Solution File: SWV488+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV488+3 : TPTP v8.1.2. Released v4.0.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 : n022.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 : Sun May 5 10:34:59 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 191 ( 50 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 242 ( 92 ~; 78 |; 52 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 61 ( 55 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,plain,
$false,
inference(avatar_sat_refutation,[],[f73,f86,f90]) ).
fof(f90,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f89]) ).
fof(f89,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f87,f60]) ).
fof(f60,plain,
int_leq(sK1,n),
inference(definition_unfolding,[],[f40,f41]) ).
fof(f41,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( real_zero = a(sK0,sK1)
& sK0 = sK1
& int_leq(sK0,n)
& int_leq(sK1,sK0)
& int_leq(int_one,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f26]) ).
fof(f26,plain,
( ? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X0,n)
& int_leq(X1,X0)
& int_leq(int_one,X1) )
=> ( real_zero = a(sK0,sK1)
& sK0 = sK1
& int_leq(sK0,n)
& int_leq(sK1,sK0)
& int_leq(int_one,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X0,n)
& int_leq(X1,X0)
& int_leq(int_one,X1) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero = a(X0,X1)
& X0 = X1
& int_leq(X0,n)
& int_leq(X1,X0)
& int_leq(int_one,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X0,n)
& int_leq(X1,X0)
& int_leq(int_one,X1) )
=> ( X0 = X1
=> real_zero != a(X0,X1) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X0,n)
& int_leq(X1,X0)
& int_leq(int_one,X1) )
=> ( X0 = X1
=> real_zero != a(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uzuyD6dJGc/Vampire---4.8_818',uti) ).
fof(f40,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f27]) ).
fof(f87,plain,
( ~ int_leq(sK1,n)
| ~ spl3_1 ),
inference(resolution,[],[f69,f38]) ).
fof(f38,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f69,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f68,plain,
( spl3_1
<=> ! [X0] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f86,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f85,plain,
( $false
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f84,f38]) ).
fof(f84,plain,
( ~ int_leq(int_one,sK1)
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f82,f60]) ).
fof(f82,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ spl3_2 ),
inference(resolution,[],[f80,f66]) ).
fof(f66,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uzuyD6dJGc/Vampire---4.8_818',int_leq) ).
fof(f80,plain,
( ! [X0] :
( ~ int_leq(sK1,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) )
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f79,f38]) ).
fof(f79,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,X0) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f76]) ).
fof(f76,plain,
( ! [X0] :
( real_zero != real_zero
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,X0) )
| ~ spl3_2 ),
inference(superposition,[],[f75,f59]) ).
fof(f59,plain,
real_zero = a(sK1,sK1),
inference(definition_unfolding,[],[f42,f41]) ).
fof(f42,plain,
real_zero = a(sK0,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f75,plain,
( ! [X0,X1] :
( real_zero != a(X0,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,X1) )
| ~ spl3_2 ),
inference(superposition,[],[f58,f72]) ).
fof(f72,plain,
( ! [X1,X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f71,plain,
( spl3_2
<=> ! [X4,X1] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f58,plain,
real_zero != real_one,
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/tmp/tmp.uzuyD6dJGc/Vampire---4.8_818',real_constants) ).
fof(f73,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f36,f71,f68]) ).
fof(f36,plain,
! [X0,X1,X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( plus(X0,X2) = X1
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> real_zero = a(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( int_leq(X4,X1)
& int_leq(int_one,X4) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( plus(X1,X5) = X0
& int_less(int_zero,X5) )
=> ! [X6] :
( ( int_leq(X6,X1)
& int_leq(int_one,X6) )
=> real_zero = a(plus(X6,X5),X6) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X7] :
( ( plus(X0,X7) = X1
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> real_zero = a(X2,plus(X2,X7)) ) )
& ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_one = a(X2,X2) )
& ! [X7] :
( ( plus(X1,X7) = X0
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_zero = a(plus(X2,X7),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uzuyD6dJGc/Vampire---4.8_818',qii) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV488+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % 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.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 21:15:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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/tmp/tmp.uzuyD6dJGc/Vampire---4.8_818
% 0.57/0.74 % (1030)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 Vampire---4 for (2996ds/83Mi)
% 0.57/0.74 % (1031)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.57/0.74 % (1023)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.74 % (1025)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.74 % (1026)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.74 % (1024)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 Vampire---4 for (2996ds/51Mi)
% 0.57/0.74 % (1028)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.74 % (1029)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.74 % (1031)Refutation not found, incomplete strategy% (1031)------------------------------
% 0.57/0.74 % (1031)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (1031)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (1031)Memory used [KB]: 1042
% 0.57/0.74 % (1031)Time elapsed: 0.004 s
% 0.57/0.74 % (1031)Instructions burned: 3 (million)
% 0.57/0.74 % (1031)------------------------------
% 0.57/0.74 % (1031)------------------------------
% 0.57/0.74 % (1028)Refutation not found, incomplete strategy% (1028)------------------------------
% 0.57/0.74 % (1028)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (1028)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (1028)Memory used [KB]: 1044
% 0.57/0.74 % (1028)Time elapsed: 0.003 s
% 0.57/0.74 % (1028)Instructions burned: 3 (million)
% 0.57/0.74 % (1028)------------------------------
% 0.57/0.74 % (1028)------------------------------
% 0.57/0.74 % (1029)First to succeed.
% 0.57/0.75 % (1029)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1016"
% 0.57/0.75 % (1029)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for Vampire---4
% 0.57/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75 % (1029)------------------------------
% 0.57/0.75 % (1029)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (1029)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (1029)Memory used [KB]: 1061
% 0.57/0.75 % (1029)Time elapsed: 0.005 s
% 0.57/0.75 % (1029)Instructions burned: 5 (million)
% 0.57/0.75 % (1016)Success in time 0.387 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------