TSTP Solution File: SWW492_5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWW492_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n021.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 : Mon Jun 24 18:33:15 EDT 2024
% Result : Theorem 0.17s 0.37s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 39 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 56 ( 28 ~; 15 |; 4 &)
% ( 6 <=>; 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 : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 3 prp; 0-3 aty)
% Number of functors : 38 ( 38 usr; 3 con; 0-5 aty)
% Number of variables : 3 ( 3 !; 0 ?; 3 :)
% 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(f593,plain,
$false,
inference(avatar_sat_refutation,[],[f586,f588,f592]) ).
tff(f592,plain,
~ spl13_2,
inference(avatar_contradiction_clause,[],[f591]) ).
tff(f591,plain,
( $false
| ~ spl13_2 ),
inference(trivial_inequality_removal,[],[f590]) ).
tff(f590,plain,
( ( zero_zero(nat) != zero_zero(nat) )
| ~ spl13_2 ),
inference(superposition,[],[f405,f585]) ).
tff(f585,plain,
( ( zero_zero(nat) = suc(degree(a,p)) )
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f583]) ).
tff(f583,plain,
( spl13_2
<=> ( zero_zero(nat) = suc(degree(a,p)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
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',unknown) ).
tff(f588,plain,
~ spl13_1,
inference(avatar_split_clause,[],[f576,f579]) ).
tff(f579,plain,
( spl13_1
<=> ( p = zero_zero(poly(a)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
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',unknown) ).
tff(f586,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f577,f583,f579]) ).
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.11 % Command : run_vampire %s %d THM
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Wed Jun 19 05:43:39 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.32 This is a TF1_THM_EQU_NAR problem
% 0.15/0.32 Running first-order theorem proving
% 0.15/0.32 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.37 % (27816)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.37 % (27818)dis+11_1:1_nwc=5.0:s2a=on:i=66616:s2at=3.0:sil=128000:bd=off_0 on theBenchmark for (2999ds/66616Mi)
% 0.17/0.37 % (27816)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.37 % (27819)lrs+1010_2201:262144_anc=all:drc=encompass:sil=256000:sims=off:sp=frequency:spb=goal_then_units:rp=on:lwlo=on:st=3.0:i=179501:bs=unit_only:nm=6:ins=2:fsd=on:ss=axioms:sgt=16:afr=on:tgt=ground:awrs=decay:awrsf=200:acc=on:ccuc=first_0 on theBenchmark for (2999ds/179501Mi)
% 0.17/0.37 % (27818)First to succeed.
% 0.17/0.37 % (27818)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27816"
% 0.17/0.37 % (27816)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.37 % (27818)Refutation found. Thanks to Tanya!
% 0.17/0.37 % SZS status Theorem for theBenchmark
% 0.17/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.37 % (27818)------------------------------
% 0.17/0.37 % (27818)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.17/0.37 % (27818)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.17/0.37 % (27818)Termination reason: Refutation
% 0.17/0.37
% 0.17/0.37 % (27818)Memory used [KB]: 1360
% 0.17/0.37 % (27818)Time elapsed: 0.005 s
% 0.17/0.37 % (27818)Instructions burned: 12 (million)
% 0.17/0.37 % (27818)------------------------------
% 0.17/0.37 % (27818)------------------------------
% 0.17/0.37 % (27816)Success in time 0.025 s
%------------------------------------------------------------------------------