TSTP Solution File: SWW492_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW492_5 : TPTP v8.2.0. 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/sandbox/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 07:00:52 EDT 2024
% Result : Theorem 0.54s 0.74s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 49
% Syntax : Number of formulae : 65 ( 7 unt; 46 typ; 0 def)
% Number of atoms : 45 ( 33 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 25 ~; 14 |; 4 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 50 ( 30 >; 20 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 30 ( 30 usr; 3 con; 0-5 aty)
% Number of variables : 42 ( 7 !; 0 ?; 42 :)
% ( 35 !>; 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,
poly: $tType > $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
fundam296178794t_poly:
!>[X0: $tType] : ( ( poly(X0) * X0 ) > poly(X0) ) ).
tff(func_def_1,type,
fundam1280195782_psize:
!>[X0: $tType] : ( poly(X0) > nat ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
suc: nat > nat ).
tff(func_def_5,type,
nat_case:
!>[X0: $tType] : ( ( X0 * fun(nat,X0) ) > fun(nat,X0) ) ).
tff(func_def_6,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_7,type,
abs_poly:
!>[X0: $tType] : ( fun(nat,X0) > poly(X0) ) ).
tff(func_def_8,type,
coeff:
!>[X0: $tType] : ( poly(X0) > fun(nat,X0) ) ).
tff(func_def_9,type,
degree:
!>[X0: $tType] : ( poly(X0) > nat ) ).
tff(func_def_10,type,
monom:
!>[X0: $tType] : ( ( X0 * nat ) > poly(X0) ) ).
tff(func_def_11,type,
order1:
!>[X0: $tType] : ( ( X0 * poly(X0) ) > nat ) ).
tff(func_def_12,type,
pCons:
!>[X0: $tType] : ( ( X0 * poly(X0) ) > poly(X0) ) ).
tff(func_def_13,type,
pcompose:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > poly(X0) ) ).
tff(func_def_14,type,
poly1:
!>[X0: $tType] : ( poly(X0) > fun(X0,X0) ) ).
tff(func_def_15,type,
poly_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(poly(X1),fun(X0,X0))) * poly(X1) ) > X0 ) ).
tff(func_def_16,type,
smult:
!>[X0: $tType] : ( ( X0 * poly(X0) ) > poly(X0) ) ).
tff(func_def_17,type,
synthetic_div:
!>[X0: $tType] : ( ( poly(X0) * X0 ) > poly(X0) ) ).
tff(func_def_18,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_19,type,
fFalse: bool ).
tff(func_def_20,type,
fTrue: bool ).
tff(func_def_21,type,
fequal:
!>[X0: $tType] : ( ( X0 * X0 ) > bool ) ).
tff(func_def_22,type,
p: poly(a) ).
tff(func_def_23,type,
sK0: nat > nat ).
tff(func_def_24,type,
sK1: nat > nat ).
tff(func_def_25,type,
sK2: nat > nat ).
tff(func_def_26,type,
sK3:
!>[X0: $tType] : ( poly(X0) > X0 ) ).
tff(func_def_27,type,
sK4:
!>[X0: $tType] : ( poly(X0) > poly(X0) ) ).
tff(pred_def_1,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
idom:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
comm_semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(pred_def_13,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f320,plain,
$false,
inference(subsumption_resolution,[],[f317,f319]) ).
tff(f319,plain,
sQ5_eqProxy(poly(a),p,zero_zero(poly(a))),
inference(subsumption_resolution,[],[f318,f293]) ).
tff(f293,plain,
! [X0: nat] : ~ sQ5_eqProxy(nat,zero_zero(nat),suc(X0)),
inference(equality_proxy_replacement,[],[f226,f279]) ).
tff(f279,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ5_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
tff(f226,plain,
! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
inference(cnf_transformation,[],[f139]) ).
tff(f139,plain,
! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X6: nat] : ( zero_zero(nat) != suc(X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_Zero__not__Suc) ).
tff(f318,plain,
( sQ5_eqProxy(nat,zero_zero(nat),suc(degree(a,p)))
| sQ5_eqProxy(poly(a),p,zero_zero(poly(a))) ),
inference(duplicate_literal_removal,[],[f280]) ).
tff(f280,plain,
( sQ5_eqProxy(nat,zero_zero(nat),suc(degree(a,p)))
| sQ5_eqProxy(poly(a),p,zero_zero(poly(a)))
| sQ5_eqProxy(poly(a),p,zero_zero(poly(a))) ),
inference(equality_proxy_replacement,[],[f214,f279]) ).
tff(f214,plain,
( ( zero_zero(nat) = suc(degree(a,p)) )
| ( p = zero_zero(poly(a)) )
| ( p = zero_zero(poly(a)) ) ),
inference(cnf_transformation,[],[f192]) ).
tff(f192,plain,
( ( ( zero_zero(nat) = suc(degree(a,p)) )
| ( p = zero_zero(poly(a)) )
| ( p = zero_zero(poly(a)) ) )
& ( ( p != zero_zero(poly(a)) )
| ( ( zero_zero(nat) != suc(degree(a,p)) )
& ( p != zero_zero(poly(a)) ) ) ) ),
inference(flattening,[],[f191]) ).
tff(f191,plain,
( ( ( zero_zero(nat) = suc(degree(a,p)) )
| ( p = zero_zero(poly(a)) )
| ( p = zero_zero(poly(a)) ) )
& ( ( p != zero_zero(poly(a)) )
| ( ( zero_zero(nat) != suc(degree(a,p)) )
& ( p != zero_zero(poly(a)) ) ) ) ),
inference(nnf_transformation,[],[f166]) ).
tff(f166,plain,
( ( ( zero_zero(nat) = suc(degree(a,p)) )
| ( p = zero_zero(poly(a)) ) )
<=> ( p != zero_zero(poly(a)) ) ),
inference(ennf_transformation,[],[f128]) ).
tff(f128,plain,
( ( ( p != zero_zero(poly(a)) )
=> ( zero_zero(nat) = suc(degree(a,p)) ) )
<=> ( p != zero_zero(poly(a)) ) ),
inference(flattening,[],[f126]) ).
tff(f126,negated_conjecture,
~ ~ ( ( ( p != zero_zero(poly(a)) )
=> ( zero_zero(nat) = suc(degree(a,p)) ) )
<=> ( p != zero_zero(poly(a)) ) ),
inference(negated_conjecture,[],[f125]) ).
tff(f125,conjecture,
~ ( ( ( p != zero_zero(poly(a)) )
=> ( zero_zero(nat) = suc(degree(a,p)) ) )
<=> ( p != zero_zero(poly(a)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f317,plain,
~ sQ5_eqProxy(poly(a),p,zero_zero(poly(a))),
inference(duplicate_literal_removal,[],[f282]) ).
tff(f282,plain,
( ~ sQ5_eqProxy(poly(a),p,zero_zero(poly(a)))
| ~ sQ5_eqProxy(poly(a),p,zero_zero(poly(a))) ),
inference(equality_proxy_replacement,[],[f212,f279]) ).
tff(f212,plain,
( ( p != zero_zero(poly(a)) )
| ( p != zero_zero(poly(a)) ) ),
inference(cnf_transformation,[],[f192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWW492_5 : TPTP v8.2.0. Released v6.0.0.
% 0.12/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 19:31:37 EDT 2024
% 0.19/0.34 % CPUTime :
% 0.19/0.34 This is a TF1_THM_EQU_NAR problem
% 0.19/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.54/0.74 % (4994)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 (2996ds/56Mi)
% 0.54/0.74 % (4987)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 (2996ds/34Mi)
% 0.54/0.74 % (4989)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.74 % (4988)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 (2996ds/51Mi)
% 0.54/0.74 % (4990)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.74 % (4994)First to succeed.
% 0.54/0.74 % (4994)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4986"
% 0.54/0.74 % (4994)Refutation found. Thanks to Tanya!
% 0.54/0.74 % SZS status Theorem for theBenchmark
% 0.54/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.74 % (4994)------------------------------
% 0.54/0.74 % (4994)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (4994)Termination reason: Refutation
% 0.54/0.74
% 0.54/0.74 % (4994)Memory used [KB]: 1143
% 0.54/0.74 % (4994)Time elapsed: 0.003 s
% 0.54/0.74 % (4994)Instructions burned: 6 (million)
% 0.54/0.74 % (4986)Success in time 0.393 s
% 0.54/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------