TSTP Solution File: SWW495_5 by Vampire-SAT---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.9
% Problem : SWW495_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d SAT
% Computer : n006.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:25 EDT 2024
% Result : Theorem 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 31 ( 31 usr; 16 con; 0-4 aty)
% Number of variables : 26 ( 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
real: $tType ).
tff(type_def_7,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_1,type,
top_top:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_3,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_4,type,
fFalse: bool ).
tff(func_def_5,type,
fTrue: bool ).
tff(func_def_6,type,
l: real ).
tff(func_def_7,type,
p: fun(real,bool) ).
tff(func_def_8,type,
y1: real ).
tff(func_def_9,type,
x: real ).
tff(func_def_10,type,
y: real ).
tff(func_def_11,type,
z: real ).
tff(func_def_12,type,
sK0: real ).
tff(func_def_13,type,
sK1: real ).
tff(func_def_14,type,
sK2: real ).
tff(func_def_15,type,
sK3:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_16,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_17,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_18,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_19,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_20,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_21,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_22,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_23,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_24,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_25,type,
sK13: real ).
tff(func_def_26,type,
sK14: real ).
tff(func_def_27,type,
sK15: real ).
tff(func_def_28,type,
sK16: real ).
tff(func_def_29,type,
sK17: real ).
tff(pred_def_1,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
top:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
isLub:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * X0 ) > $o ) ).
tff(pred_def_8,type,
isUb:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * X0 ) > $o ) ).
tff(pred_def_9,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_10,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(f1700,plain,
$false,
inference(subsumption_resolution,[],[f1692,f392]) ).
tff(f392,plain,
~ ord_less(real,y,l),
inference(cnf_transformation,[],[f122]) ).
tff(f122,plain,
~ ord_less(real,y,l),
inference(flattening,[],[f121]) ).
tff(f121,negated_conjecture,
~ ord_less(real,y,l),
inference(negated_conjecture,[],[f120]) ).
tff(f120,conjecture,
ord_less(real,y,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f1692,plain,
ord_less(real,y,l),
inference(resolution,[],[f1089,f670]) ).
tff(f670,plain,
ord_less_eq(real,z,l),
inference(resolution,[],[f491,f410]) ).
tff(f410,plain,
pp(aa(real,bool,p,z)),
inference(cnf_transformation,[],[f19]) ).
tff(f19,axiom,
pp(aa(real,bool,p,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f491,plain,
! [X0: real] :
( ~ pp(aa(real,bool,p,X0))
| ord_less_eq(real,X0,l) ),
inference(cnf_transformation,[],[f295]) ).
tff(f295,plain,
! [X0: real] :
( ord_less_eq(real,X0,l)
| ~ pp(aa(real,bool,p,X0)) ),
inference(ennf_transformation,[],[f180]) ).
tff(f180,plain,
! [X0: real] :
( pp(aa(real,bool,p,X0))
=> ord_less_eq(real,X0,l) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X3: real] :
( pp(aa(real,bool,p,X3))
=> ord_less_eq(real,X3,l) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f1089,plain,
! [X0: real] :
( ~ ord_less_eq(real,z,X0)
| ord_less(real,y,X0) ),
inference(subsumption_resolution,[],[f1074,f400]) ).
tff(f400,plain,
preorder(real),
inference(cnf_transformation,[],[f111]) ).
tff(f111,axiom,
preorder(real),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f1074,plain,
! [X0: real] :
( ~ ord_less_eq(real,z,X0)
| ord_less(real,y,X0)
| ~ preorder(real) ),
inference(resolution,[],[f469,f407]) ).
tff(f407,plain,
ord_less(real,y,z),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
ord_less(real,y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f469,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0] :
( ~ ord_less(X0,X3,X2)
| ~ ord_less_eq(X0,X2,X1)
| ord_less(X0,X3,X1)
| ~ preorder(X0) ),
inference(cnf_transformation,[],[f274]) ).
tff(f274,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] :
( ord_less(X0,X3,X1)
| ~ ord_less_eq(X0,X2,X1)
| ~ ord_less(X0,X3,X2) )
| ~ preorder(X0) ),
inference(flattening,[],[f273]) ).
tff(f273,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] :
( ord_less(X0,X3,X1)
| ~ ord_less_eq(X0,X2,X1)
| ~ ord_less(X0,X3,X2) )
| ~ preorder(X0) ),
inference(ennf_transformation,[],[f165]) ).
tff(f165,plain,
! [X0: $tType] :
( preorder(X0)
=> ! [X1: X0,X2: X0,X3: X0] :
( ord_less(X0,X3,X2)
=> ( ord_less_eq(X0,X2,X1)
=> ord_less(X0,X3,X1) ) ) ),
inference(rectify,[],[f43]) ).
tff(f43,axiom,
! [X0: $tType] :
( preorder(X0)
=> ! [X19: X0,X10: X0,X5: X0] :
( ord_less(X0,X5,X10)
=> ( ord_less_eq(X0,X10,X19)
=> ord_less(X0,X5,X19) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW495_5 : TPTP v8.2.0. Released v6.0.0.
% 0.07/0.12 % Command : run_vampire %s %d SAT
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jun 19 09:38:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 This is a TF1_THM_EQU_NAR problem
% 0.13/0.36 Running first-order model finding
% 0.13/0.36 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.40 % (18331)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.13/0.40 % Exception at run slice level
% 0.13/0.40 User error: Immediate (shared) subterms of term/literal aa(l,fTrue,p,X0) have different types/not well-typed!
% 0.21/0.42 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (18326)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (3000ds/98885Mi)
% 0.21/0.42 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (18329)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.21/0.42 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (18328)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.21/0.42 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (18327)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.21/0.42 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (18332)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.21/0.42 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (18330)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.21/0.42 % (18329)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.43 % (18332)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.43 % (18330)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.43 % Exception at run slice level
% 0.21/0.43 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.43 % (18329)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.43 % Exception at run slice level
% 0.21/0.43 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.43 % Exception at run slice level
% 0.21/0.43 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.44 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.44 % (18343)dis+11_1:3_bsr=unit_only:sil=2000:rp=on:newcnf=on:i=404:kws=precedence:lsd=100_0 on theBenchmark for (2999ds/404Mi)
% 0.21/0.44 % (18343)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.46 % (18330)First to succeed.
% 0.21/0.46 % (18330)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18325"
% 0.21/0.47 % (18325)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.47 % (18330)Refutation found. Thanks to Tanya!
% 0.21/0.47 % SZS status Theorem for theBenchmark
% 0.21/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.47 % (18330)------------------------------
% 0.21/0.47 % (18330)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.47 % (18330)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.47 % (18330)Termination reason: Refutation
% 0.21/0.47
% 0.21/0.47 % (18330)Memory used [KB]: 1443
% 0.21/0.47 % (18330)Time elapsed: 0.042 s
% 0.21/0.47 % (18330)Instructions burned: 60 (million)
% 0.21/0.47 % (18330)------------------------------
% 0.21/0.47 % (18330)------------------------------
% 0.21/0.47 % (18325)Success in time 0.098 s
%------------------------------------------------------------------------------