TSTP Solution File: SYO359^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO359^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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 09:11:00 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 18
% Syntax : Number of formulae : 46 ( 8 unt; 16 typ; 0 def)
% Number of atoms : 336 ( 71 equ; 0 cnn)
% Maximal formula atoms : 7 ( 11 avg)
% Number of connectives : 83 ( 23 ~; 29 |; 8 &; 0 @)
% ( 6 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 44 ( 43 >; 1 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 3 con; 0-6 aty)
% Number of variables : 36 ( 0 ^ 26 !; 4 ?; 36 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_7,type,
gtype: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
gtype: $tType ).
thf(func_def_2,type,
g: b > $o ).
thf(func_def_3,type,
h: ( b > $o ) > gtype ).
thf(func_def_4,type,
f: b > $o ).
thf(func_def_8,type,
sK0: b ).
thf(func_def_9,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_10,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_11,type,
vAND: $o > $o > $o ).
thf(func_def_12,type,
vOR: $o > $o > $o ).
thf(func_def_13,type,
vIMP: $o > $o > $o ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f97,plain,
$false,
inference(trivial_inequality_removal,[],[f96]) ).
thf(f96,plain,
$true = $false,
inference(superposition,[],[f71,f92]) ).
thf(f92,plain,
$false = vAPP(b,$o,g,sK0),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
( ( $true = $false )
| ( $false = vAPP(b,$o,g,sK0) ) ),
inference(superposition,[],[f83,f17]) ).
thf(f17,plain,
! [X0: b] :
( ( vAPP(b,$o,f,X0) = $true )
| ( vAPP(b,$o,g,X0) = $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
! [X0: b] : ( vAPP(b,$o,f,X0) = vAPP(b,$o,g,X0) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( vAPP(sTfun(b,$o),gtype,h,f) != vAPP(sTfun(b,$o),gtype,h,g) )
& ! [X0: b] : ( vAPP(b,$o,f,X0) = vAPP(b,$o,g,X0) )
& ( ! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( vAPP(sTfun(b,$o),$o,X1,f) != $true ) )
| ( vAPP(b,$o,f,sK0) != vAPP(b,$o,g,sK0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X2: b] : ( vAPP(b,$o,f,X2) != vAPP(b,$o,g,X2) )
=> ( vAPP(b,$o,f,sK0) != vAPP(b,$o,g,sK0) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ( vAPP(sTfun(b,$o),gtype,h,f) != vAPP(sTfun(b,$o),gtype,h,g) )
& ! [X0: b] : ( vAPP(b,$o,f,X0) = vAPP(b,$o,g,X0) )
& ( ! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( vAPP(sTfun(b,$o),$o,X1,f) != $true ) )
| ? [X2: b] : ( vAPP(b,$o,f,X2) != vAPP(b,$o,g,X2) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
( ( vAPP(sTfun(b,$o),gtype,h,f) != vAPP(sTfun(b,$o),gtype,h,g) )
& ! [X2: b] : ( vAPP(b,$o,f,X2) = vAPP(b,$o,g,X2) )
& ( ! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( vAPP(sTfun(b,$o),$o,X1,f) != $true ) )
| ? [X0: b] : ( vAPP(b,$o,f,X0) != vAPP(b,$o,g,X0) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ( vAPP(sTfun(b,$o),gtype,h,f) != vAPP(sTfun(b,$o),gtype,h,g) )
& ! [X2: b] : ( vAPP(b,$o,f,X2) = vAPP(b,$o,g,X2) )
& ( ! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( vAPP(sTfun(b,$o),$o,X1,f) != $true ) )
| ? [X0: b] : ( vAPP(b,$o,f,X0) != vAPP(b,$o,g,X0) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ! [X0: b] : ( vAPP(b,$o,f,X0) = vAPP(b,$o,g,X0) )
=> ! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,f) = $true )
=> ( vAPP(sTfun(b,$o),$o,X1,g) = $true ) ) )
=> ( ! [X2: b] : ( vAPP(b,$o,f,X2) = vAPP(b,$o,g,X2) )
=> ( vAPP(sTfun(b,$o),gtype,h,f) = vAPP(sTfun(b,$o),gtype,h,g) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: b] :
( vAPP(b,$o,f,X0)
<=> vAPP(b,$o,g,X0) )
=> ! [X1: ( b > $o ) > $o] :
( vAPP(sTfun(b,$o),$o,X1,f)
=> vAPP(sTfun(b,$o),$o,X1,g) ) )
=> ( ! [X2: b] :
( vAPP(b,$o,f,X2)
<=> vAPP(b,$o,g,X2) )
=> ( vAPP(sTfun(b,$o),gtype,h,f) = vAPP(sTfun(b,$o),gtype,h,g) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: b] :
( vAPP(b,$o,f,X0)
<=> vAPP(b,$o,g,X0) )
=> ! [X1: ( b > $o ) > $o] :
( vAPP(sTfun(b,$o),$o,X1,f)
=> vAPP(sTfun(b,$o),$o,X1,g) ) )
=> ( ! [X0: b] :
( vAPP(b,$o,f,X0)
<=> vAPP(b,$o,g,X0) )
=> ( vAPP(sTfun(b,$o),gtype,h,f) = vAPP(sTfun(b,$o),gtype,h,g) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: b] :
( vAPP(b,$o,f,X0)
<=> vAPP(b,$o,g,X0) )
=> ! [X1: ( b > $o ) > $o] :
( vAPP(sTfun(b,$o),$o,X1,f)
=> vAPP(sTfun(b,$o),$o,X1,g) ) )
=> ( ! [X0: b] :
( vAPP(b,$o,f,X0)
<=> vAPP(b,$o,g,X0) )
=> ( vAPP(sTfun(b,$o),gtype,h,f) = vAPP(sTfun(b,$o),gtype,h,g) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT1) ).
thf(f83,plain,
$false = vAPP(b,$o,f,sK0),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f82,plain,
( ( $true = $false )
| ( $false = vAPP(b,$o,f,sK0) ) ),
inference(forward_demodulation,[],[f81,f71]) ).
thf(f81,plain,
( ( $false = vAPP(b,$o,f,sK0) )
| ( $false = vAPP(b,$o,g,sK0) ) ),
inference(subsumption_resolution,[],[f72,f55]) ).
thf(f55,plain,
f != g,
inference(equality_resolution,[],[f14]) ).
thf(f14,plain,
vAPP(sTfun(b,$o),gtype,h,f) != vAPP(sTfun(b,$o),gtype,h,g),
inference(cnf_transformation,[],[f11]) ).
thf(f72,plain,
( ( $false = vAPP(b,$o,f,sK0) )
| ( $false = vAPP(b,$o,g,sK0) )
| ( f = g ) ),
inference(leibniz_equality_elimination,[],[f16]) ).
thf(f16,plain,
! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,f) != $true )
| ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( $false = vAPP(b,$o,f,sK0) )
| ( $false = vAPP(b,$o,g,sK0) ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( vAPP(sTfun(b,$o),$o,X1,f) != $true )
| ( vAPP(b,$o,f,sK0) != vAPP(b,$o,g,sK0) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f71,plain,
$true = vAPP(b,$o,g,sK0),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( $true = $false )
| ( $true = vAPP(b,$o,g,sK0) ) ),
inference(duplicate_literal_removal,[],[f66]) ).
thf(f66,plain,
( ( $true = $false )
| ( $true = vAPP(b,$o,g,sK0) )
| ( $true = vAPP(b,$o,g,sK0) ) ),
inference(superposition,[],[f65,f18]) ).
thf(f18,plain,
! [X0: b] :
( ( vAPP(b,$o,f,X0) = $false )
| ( vAPP(b,$o,g,X0) = $true ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f65,plain,
( ( $true = vAPP(b,$o,f,sK0) )
| ( $true = vAPP(b,$o,g,sK0) ) ),
inference(subsumption_resolution,[],[f56,f55]) ).
thf(f56,plain,
( ( $true = vAPP(b,$o,f,sK0) )
| ( $true = vAPP(b,$o,g,sK0) )
| ( f = g ) ),
inference(leibniz_equality_elimination,[],[f15]) ).
thf(f15,plain,
! [X1: ( b > $o ) > $o] :
( ( vAPP(sTfun(b,$o),$o,X1,f) != $true )
| ( vAPP(sTfun(b,$o),$o,X1,g) = $true )
| ( $true = vAPP(b,$o,f,sK0) )
| ( $true = vAPP(b,$o,g,sK0) ) ),
inference(binary_proxy_clausification,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO359^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n012.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 09:43:37 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % (16634)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (16637)WARNING: value z3 for option sas not known
% 0.15/0.32 % (16638)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.32 % (16636)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.32 % (16637)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.15/0.32 % (16641)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.15/0.32 % (16639)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_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.32 % (16640)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.15/0.32 % (16641)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.32 % Exception at run slice level% Exception at run slice level
% 0.15/0.32 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.32
% 0.15/0.32 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.32 % (16635)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32 % Exception at run slice level
% 0.15/0.32 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.32 % (16641)First to succeed.
% 0.15/0.32 % (16640)Also succeeded, but the first one will report.
% 0.15/0.32 % (16641)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16634"
% 0.15/0.32 % (16639)Also succeeded, but the first one will report.
% 0.15/0.32 % (16637)Also succeeded, but the first one will report.
% 0.15/0.32 % (16641)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32 % (16641)------------------------------
% 0.15/0.32 % (16641)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.32 % (16641)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (16641)Memory used [KB]: 767
% 0.15/0.32 % (16641)Time elapsed: 0.005 s
% 0.15/0.32 % (16641)Instructions burned: 7 (million)
% 0.15/0.32 % (16634)Success in time 0.017 s
%------------------------------------------------------------------------------