TSTP Solution File: SWW492_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWW492_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.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:27:10 EDT 2024
% Result : Theorem 0.19s 0.36s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 55
% Syntax : Number of formulae : 68 ( 6 unt; 53 typ; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 44 ( 22 ~; 11 |; 4 &)
% ( 4 <=>; 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 : 59 ( 37 >; 22 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 38 ( 38 usr; 3 con; 0-5 aty)
% Number of variables : 44 ( 3 !; 0 ?; 44 :)
% ( 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,
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:
!>[X0: $tType] : ( poly(X0) > X0 ) ).
tff(func_def_24,type,
sK1:
!>[X0: $tType] : ( poly(X0) > poly(X0) ) ).
tff(func_def_25,type,
sK2:
!>[X0: $tType] : ( fun(poly(X0),bool) > X0 ) ).
tff(func_def_26,type,
sK3:
!>[X0: $tType] : ( fun(poly(X0),bool) > poly(X0) ) ).
tff(func_def_27,type,
sK4:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).
tff(func_def_28,type,
sK5:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).
tff(func_def_29,type,
sK6:
!>[X0: $tType] : ( fun(nat,X0) > nat ) ).
tff(func_def_30,type,
sK7: nat > nat ).
tff(func_def_31,type,
sK8: nat > nat ).
tff(func_def_32,type,
sK9: nat > nat ).
tff(func_def_33,type,
sK10: fun(nat,bool) > nat ).
tff(func_def_34,type,
sK11: fun(nat,bool) > nat ).
tff(func_def_35,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
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(f788,plain,
$false,
inference(subsumption_resolution,[],[f787,f576]) ).
tff(f576,plain,
p != zero_zero(poly(a)),
inference(duplicate_literal_removal,[],[f388]) ).
tff(f388,plain,
( ( p != zero_zero(poly(a)) )
| ( p != zero_zero(poly(a)) ) ),
inference(cnf_transformation,[],[f338]) ).
tff(f338,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,[],[f337]) ).
tff(f337,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,[],[f241]) ).
tff(f241,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/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f787,plain,
p = zero_zero(poly(a)),
inference(subsumption_resolution,[],[f577,f405]) ).
tff(f405,plain,
! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
inference(cnf_transformation,[],[f132]) ).
tff(f132,plain,
! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X6: nat] : ( zero_zero(nat) != suc(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_Zero__not__Suc) ).
tff(f577,plain,
( ( zero_zero(nat) = suc(degree(a,p)) )
| ( p = zero_zero(poly(a)) ) ),
inference(duplicate_literal_removal,[],[f390]) ).
tff(f390,plain,
( ( zero_zero(nat) = suc(degree(a,p)) )
| ( p = zero_zero(poly(a)) )
| ( p = zero_zero(poly(a)) ) ),
inference(cnf_transformation,[],[f338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWW492_5 : TPTP v8.2.0. Released v6.0.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat May 18 19:31:38 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.33 % (19095)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.34 % (19102)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.34 % (19098)WARNING: value z3 for option sas not known
% 0.13/0.35 % (19098)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.35 % (19102)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.13/0.35 % (19096)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.35 % (19097)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.19/0.36 % Exception at run slice level
% 0.19/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.36 % Exception at run slice level
% 0.19/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.36 % (19098)First to succeed.
% 0.19/0.36 % (19098)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19095"
% 0.19/0.36 % (19101)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.19/0.36 % (19098)Refutation found. Thanks to Tanya!
% 0.19/0.36 % SZS status Theorem for theBenchmark
% 0.19/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.36 % (19098)------------------------------
% 0.19/0.36 % (19098)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.36 % (19098)Termination reason: Refutation
% 0.19/0.36
% 0.19/0.36 % (19098)Memory used [KB]: 1132
% 0.19/0.36 % (19098)Time elapsed: 0.015 s
% 0.19/0.36 % (19098)Instructions burned: 25 (million)
% 0.19/0.36 % (19095)Success in time 0.026 s
%------------------------------------------------------------------------------