TSTP Solution File: SWW504_5 by Vampire-SAT---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.9
% Problem : SWW504_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d SAT
% Computer : n016.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:53:27 EDT 2024
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 12 ~; 0 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-5 aty)
% Number of functors : 47 ( 47 usr; 5 con; 0-5 aty)
% Number of variables : 19 ( 8 !; 11 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
com: $tType ).
tff(type_def_6,type,
state: $tType ).
tff(type_def_7,type,
node: ( $tType * $tType ) > $tType ).
tff(type_def_8,type,
bool: $tType ).
tff(type_def_9,type,
hoare_28830079triple: $tType > $tType ).
tff(type_def_10,type,
int: $tType ).
tff(type_def_11,type,
nat: $tType ).
tff(type_def_12,type,
char: $tType ).
tff(type_def_13,type,
literal: $tType ).
tff(type_def_14,type,
nibble: $tType ).
tff(type_def_15,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_16,type,
sum_sum: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
sgn_sgn:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_2,type,
uminus_uminus:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
bool_size: bool > nat ).
tff(func_def_5,type,
equal_equal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_6,type,
hoare_689268419triple:
!>[X0: $tType] : fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),hoare_28830079triple(X0)) ).
tff(func_def_7,type,
hoare_334633230triple:
!>[X0: $tType] : fun(hoare_28830079triple(X0),fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool)) ).
tff(func_def_8,type,
hoare_1841697145triple:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) ) > hoare_28830079triple(X0) ) ).
tff(func_def_9,type,
hoare_376461865e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_10,type,
hoare_678420151le_rec:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_11,type,
hoare_711253694ep_set:
!>[X0: $tType] : fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),bool) ).
tff(func_def_12,type,
hoare_47506394e_size:
!>[X0: $tType] : ( ( fun(X0,nat) * hoare_28830079triple(X0) ) > nat ) ).
tff(func_def_13,type,
nat_size: nat > nat ).
tff(func_def_14,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_15,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_16,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_17,type,
char1: ( nibble * nibble ) > char ).
tff(func_def_18,type,
char_case:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char ) > X0 ) ).
tff(func_def_19,type,
char_rec:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char ) > X0 ) ).
tff(func_def_20,type,
char_size: char > nat ).
tff(func_def_21,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_22,type,
fFalse: bool ).
tff(func_def_23,type,
fTrue: bool ).
tff(func_def_24,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_25,type,
sK0: state ).
tff(func_def_26,type,
sK1: state ).
tff(func_def_27,type,
sK2: state ).
tff(func_def_28,type,
sK3: char > nibble ).
tff(func_def_29,type,
sK4: char > nibble ).
tff(func_def_30,type,
sK5: fun(nat,bool) > nat ).
tff(func_def_31,type,
sK6:
!>[X0: $tType] : ( fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool) > hoare_28830079triple(X0) ) ).
tff(func_def_32,type,
sK7:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool) ) ).
tff(func_def_33,type,
sK8:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).
tff(func_def_34,type,
sK9:
!>[X0: $tType] : ( hoare_28830079triple(X0) > com ) ).
tff(func_def_35,type,
sK10:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).
tff(func_def_36,type,
sK11:
!>[X0: $tType] : ( fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),bool) > hoare_28830079triple(X0) ) ).
tff(func_def_37,type,
sK12:
!>[X0: $tType] : ( fun(hoare_28830079triple(X0),bool) > fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool) ) ).
tff(func_def_38,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_39,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,X0) ) > X1 ) ).
tff(func_def_40,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,bool) * fun(X1,X0) ) > X1 ) ).
tff(func_def_41,type,
sK16:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,bool) * fun(X0,X1) ) > X0 ) ).
tff(func_def_42,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,bool) * fun(X0,bool) * fun(X0,X1) ) > X0 ) ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cl_HOL_Oequal:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
sgn_if:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
semigroup:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > $o ) ).
tff(pred_def_17,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
type_definition:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * fun(X1,X0) * fun(X1,bool) ) > $o ) ).
tff(pred_def_19,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_20,type,
pp: bool > $o ).
tff(f585,plain,
$false,
inference(subsumption_resolution,[],[f584,f369]) ).
tff(f369,plain,
! [X1: state] : ( sK0 = X1 ),
inference(cnf_transformation,[],[f312]) ).
tff(f312,plain,
! [X1: state] : ( sK0 = X1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f236,f311]) ).
tff(f311,plain,
( ? [X0: state] :
! [X1: state] : ( X0 = X1 )
=> ! [X1: state] : ( sK0 = X1 ) ),
introduced(choice_axiom,[]) ).
tff(f236,plain,
? [X0: state] :
! [X1: state] : ( X0 = X1 ),
inference(ennf_transformation,[],[f142]) ).
tff(f142,plain,
~ ! [X0: state] :
? [X1: state] : ( X0 != X1 ),
inference(rectify,[],[f141]) ).
tff(f141,negated_conjecture,
~ ! [X53: state] :
? [X54: state] : ( X53 != X54 ),
inference(negated_conjecture,[],[f140]) ).
tff(f140,conjecture,
! [X53: state] :
? [X54: state] : ( X53 != X54 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f584,plain,
sK0 != sK1,
inference(forward_demodulation,[],[f370,f369]) ).
tff(f370,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f314]) ).
tff(f314,plain,
sK1 != sK2,
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f143,f313]) ).
tff(f313,plain,
( ? [X0: state,X1: state] : ( X0 != X1 )
=> ( sK1 != sK2 ) ),
introduced(choice_axiom,[]) ).
tff(f143,plain,
? [X0: state,X1: state] : ( X0 != X1 ),
inference(rectify,[],[f139]) ).
tff(f139,axiom,
? [X52: state,X53: state] : ( X52 != X53 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW504_5 : TPTP v8.2.0. Released v6.0.0.
% 0.06/0.12 % Command : run_vampire %s %d SAT
% 0.12/0.32 % Computer : n016.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 04:16:54 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.34 This is a TF1_THM_EQU_NAR problem
% 0.12/0.35 Running first-order model finding
% 0.12/0.35 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26208)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (3000ds/146Mi)
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26207)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26205)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26206)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (3000ds/152523Mi)
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26209)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (3000ds/115Mi)
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26204)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency:i=99418_0 on theBenchmark for (3000ds/99418Mi)
% 0.20/0.42 % (26207)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42 % (26206)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42 % (26209)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42 % (26206)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.42 % Exception at run slice level
% 0.20/0.42 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.42 % Exception at run slice level
% 0.20/0.42 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.42 % (26208)First to succeed.
% 0.20/0.42 % (26208)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26202"
% 0.20/0.42 % (26202)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (26208)Refutation found. Thanks to Tanya!
% 0.20/0.42 % SZS status Theorem for theBenchmark
% 0.20/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.42 % (26208)------------------------------
% 0.20/0.42 % (26208)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.20/0.42 % (26208)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.20/0.42 % (26208)Termination reason: Refutation
% 0.20/0.42
% 0.20/0.42 % (26208)Memory used [KB]: 990
% 0.20/0.42 % (26208)Time elapsed: 0.008 s
% 0.20/0.42 % (26208)Instructions burned: 10 (million)
% 0.20/0.42 % (26208)------------------------------
% 0.20/0.42 % (26208)------------------------------
% 0.20/0.42 % (26202)Success in time 0.061 s
%------------------------------------------------------------------------------