TSTP Solution File: SWW488_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW488_5 : TPTP v8.1.2. Released v6.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 : 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 : Wed May 1 04:19:37 EDT 2024
% Result : Theorem 0.60s 0.82s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 52
% Syntax : Number of formulae : 67 ( 11 unt; 48 typ; 0 def)
% Number of atoms : 27 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 4 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 29 ( 16 >; 13 *; 0 +; 0 <<)
% Number of predicates : 27 ( 25 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 4 con; 0-5 aty)
% Number of variables : 59 ( 18 !; 0 ?; 59 :)
% ( 41 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
poly1: $tType > $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
fundam296178794t_poly:
!>[X0: $tType] : ( ( poly1(X0) * X0 ) > poly1(X0) ) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
ring_1_Ints:
!>[X0: $tType] : fun(X0,bool) ).
tff(func_def_5,type,
coeff:
!>[X0: $tType] : ( poly1(X0) > fun(nat,X0) ) ).
tff(func_def_6,type,
monom:
!>[X0: $tType] : ( ( X0 * nat ) > poly1(X0) ) ).
tff(func_def_7,type,
order:
!>[X0: $tType] : ( ( X0 * poly1(X0) ) > nat ) ).
tff(func_def_8,type,
pcompose:
!>[X0: $tType] : ( ( poly1(X0) * poly1(X0) ) > poly1(X0) ) ).
tff(func_def_9,type,
poly:
!>[X0: $tType] : ( poly1(X0) > fun(X0,X0) ) ).
tff(func_def_10,type,
poly_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(poly1(X1),fun(X0,X0))) * poly1(X1) ) > X0 ) ).
tff(func_def_11,type,
synthetic_div:
!>[X0: $tType] : ( ( poly1(X0) * X0 ) > poly1(X0) ) ).
tff(func_def_12,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_13,type,
fFalse: bool ).
tff(func_def_14,type,
fTrue: bool ).
tff(func_def_15,type,
h: a ).
tff(func_def_16,type,
x: a ).
tff(func_def_17,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
comm_ring_1:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cancel1352612707id_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
idom:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
comm_semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
ordere216010020id_add:
!>[X0: $tType] : $o ).
tff(pred_def_20,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_21,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_22,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_23,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_24,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_25,type,
pp: bool > $o ).
tff(f180,plain,
$false,
inference(subsumption_resolution,[],[f179,f176]) ).
tff(f176,plain,
! [X0: a] : ( zero_zero(a) = aa(a,a,poly(a,zero_zero(poly1(a))),X0) ),
inference(unit_resulting_resolution,[],[f162,f165]) ).
tff(f165,plain,
! [X0: $tType,X1: X0] :
( ( zero_zero(X0) = aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X1) )
| ~ comm_semiring_0(X0) ),
inference(cnf_transformation,[],[f156]) ).
tff(f156,plain,
! [X0: $tType] :
( ! [X1: X0] : ( zero_zero(X0) = aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X1) )
| ~ comm_semiring_0(X0) ),
inference(ennf_transformation,[],[f150]) ).
tff(f150,plain,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X1: X0] : ( zero_zero(X0) = aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X1) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X3: X0] : ( aa(X0,X0,poly(X0,zero_zero(poly1(X0))),X3) = zero_zero(X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ePAqbYgguv/Vampire---4.8_8046',fact_1_poly__0) ).
tff(f162,plain,
comm_semiring_0(a),
inference(cnf_transformation,[],[f145]) ).
tff(f145,axiom,
comm_semiring_0(a),
file('/export/starexec/sandbox2/tmp/tmp.ePAqbYgguv/Vampire---4.8_8046',tfree_0) ).
tff(f179,plain,
aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)) != zero_zero(a),
inference(backward_demodulation,[],[f173,f176]) ).
tff(f173,plain,
aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)) != aa(a,a,poly(a,zero_zero(poly1(a))),x),
inference(backward_demodulation,[],[f161,f171]) ).
tff(f171,plain,
! [X0: a] : ( zero_zero(poly1(a)) = fundam296178794t_poly(a,zero_zero(poly1(a)),X0) ),
inference(unit_resulting_resolution,[],[f162,f163]) ).
tff(f163,plain,
! [X0: $tType,X1: X0] :
( ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X1) )
| ~ comm_semiring_0(X0) ),
inference(cnf_transformation,[],[f154]) ).
tff(f154,plain,
! [X0: $tType] :
( ! [X1: X0] : ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X1) )
| ~ comm_semiring_0(X0) ),
inference(ennf_transformation,[],[f147]) ).
tff(f147,plain,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X1: X0] : ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X1) ) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X2: X0] : ( zero_zero(poly1(X0)) = fundam296178794t_poly(X0,zero_zero(poly1(X0)),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ePAqbYgguv/Vampire---4.8_8046',fact_0_offset__poly__0) ).
tff(f161,plain,
aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) != aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)),
inference(cnf_transformation,[],[f146]) ).
tff(f146,plain,
aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) != aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)),
inference(flattening,[],[f144]) ).
tff(f144,negated_conjecture,
( ~ aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) = aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)) ),
inference(negated_conjecture,[],[f143]) ).
tff(f143,conjecture,
aa(a,a,poly(a,fundam296178794t_poly(a,zero_zero(poly1(a)),h)),x) = aa(a,a,poly(a,zero_zero(poly1(a))),plus_plus(a,h,x)),
file('/export/starexec/sandbox2/tmp/tmp.ePAqbYgguv/Vampire---4.8_8046',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SWW488_5 : TPTP v8.1.2. Released v6.0.0.
% 0.04/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.10/0.32 % Computer : n017.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 30 17:27:34 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.10/0.33 This is a TF1_THM_EQU_NAR problem
% 0.10/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/tmp/tmp.ePAqbYgguv/Vampire---4.8_8046
% 0.60/0.81 % (8157)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.81 % (8160)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.81 % (8158)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.81 % (8155)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 (2995ds/34Mi)
% 0.60/0.81 % (8159)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 (2995ds/34Mi)
% 0.60/0.81 % (8161)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 (2995ds/83Mi)
% 0.60/0.81 % (8156)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 (2995ds/51Mi)
% 0.60/0.81 % (8162)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 (2995ds/56Mi)
% 0.60/0.81 % (8161)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.82 % (8161)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.82 % (8158)First to succeed.
% 0.60/0.82 % (8162)Refutation not found, incomplete strategy% (8162)------------------------------
% 0.60/0.82 % (8162)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (8162)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (8162)Memory used [KB]: 1087
% 0.60/0.82 % (8162)Time elapsed: 0.003 s
% 0.60/0.82 % (8162)Instructions burned: 4 (million)
% 0.60/0.82 % (8162)------------------------------
% 0.60/0.82 % (8162)------------------------------
% 0.60/0.82 % (8160)Also succeeded, but the first one will report.
% 0.60/0.82 % (8158)Refutation found. Thanks to Tanya!
% 0.60/0.82 % SZS status Theorem for Vampire---4
% 0.60/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.82 % (8158)------------------------------
% 0.60/0.82 % (8158)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (8158)Termination reason: Refutation
% 0.60/0.82
% 0.60/0.82 % (8158)Memory used [KB]: 1108
% 0.60/0.82 % (8158)Time elapsed: 0.005 s
% 0.60/0.82 % (8158)Instructions burned: 4 (million)
% 0.60/0.82 % (8158)------------------------------
% 0.60/0.82 % (8158)------------------------------
% 0.60/0.82 % (8153)Success in time 0.484 s
% 0.60/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------