TSTP Solution File: SYO018^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO018^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 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 : Tue May 21 09:09:58 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 36 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 260 ( 23 equ; 0 cnn)
% Maximal formula atoms : 2 ( 10 avg)
% Number of connectives : 43 ( 17 ~; 13 |; 7 &; 0 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 23 >; 1 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 5 con; 0-6 aty)
% Number of variables : 13 ( 6 ^ 1 !; 0 ?; 13 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
f: $o > $i > $i ).
thf(func_def_1,type,
p: ( $i > $i ) > $o ).
thf(func_def_2,type,
a: ( $i > $i ) > $o ).
thf(func_def_3,type,
b: $o ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
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,
vOR: $o > $o > $o ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f88,plain,
$false,
inference(avatar_sat_refutation,[],[f61,f77,f87]) ).
thf(f87,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f86]) ).
thf(f86,plain,
( $false
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f85,f84]) ).
thf(f84,plain,
( ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,$false)) )
| ~ spl0_3 ),
inference(boolean_simplification,[],[f81]) ).
thf(f81,plain,
( ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$false))),$false))) )
| ~ spl0_3 ),
inference(backward_demodulation,[],[f8,f56]) ).
thf(f56,plain,
( ( b = $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl0_3
<=> ( b = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f8,plain,
$true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))),b))),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( $true != vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))))) )
& ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))),b))) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))),b))) )
=> ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))))) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( vAPP(sTfun($i,$i),$o,p,
^ [X0: $i] :
vAPP($i,$i,
vAPP($o,sTfun($i,$i),f,
( b
& vAPP(sTfun($i,$i),$o,a,
^ [X1: $i] : vAPP($i,$i,vAPP($o,sTfun($i,$i),f,b),X1)) )),
X0))
=> vAPP(sTfun($i,$i),$o,p,
vAPP($o,sTfun($i,$i),f,
( vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))
& b ))) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( vAPP(sTfun($i,$i),$o,p,
^ [X0: $i] :
vAPP($i,$i,
vAPP($o,sTfun($i,$i),f,
( b
& vAPP(sTfun($i,$i),$o,a,
^ [X0: $i] : vAPP($i,$i,vAPP($o,sTfun($i,$i),f,b),X0)) )),
X0))
=> vAPP(sTfun($i,$i),$o,p,
vAPP($o,sTfun($i,$i),f,
( vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))
& b ))) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( vAPP(sTfun($i,$i),$o,p,
^ [X0: $i] :
vAPP($i,$i,
vAPP($o,sTfun($i,$i),f,
( b
& vAPP(sTfun($i,$i),$o,a,
^ [X0: $i] : vAPP($i,$i,vAPP($o,sTfun($i,$i),f,b),X0)) )),
X0))
=> vAPP(sTfun($i,$i),$o,p,
vAPP($o,sTfun($i,$i),f,
( vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))
& b ))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f85,plain,
( ( $true != vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,$false)) )
| ~ spl0_3 ),
inference(boolean_simplification,[],[f80]) ).
thf(f80,plain,
( ( $true != vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,$false),vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$false))))) )
| ~ spl0_3 ),
inference(backward_demodulation,[],[f9,f56]) ).
thf(f9,plain,
$true != vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,b))))),
inference(cnf_transformation,[],[f7]) ).
thf(f77,plain,
( spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f76,f58,f54]) ).
thf(f58,plain,
( spl0_4
<=> ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$true)))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f76,plain,
( ( $true != vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$true)))) )
| ( b = $false ) ),
inference(boolean_simplification,[],[f67]) ).
thf(f67,plain,
( ( $true != vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,$true),vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$true))))) )
| ( b = $false ) ),
inference(superposition,[],[f9,f4]) ).
thf(f4,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
introduced(fool_axiom,[]) ).
thf(f61,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f42,f58,f54]) ).
thf(f42,plain,
( ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$true)))) )
| ( b = $false ) ),
inference(boolean_simplification,[],[f39]) ).
thf(f39,plain,
( ( $true = vAPP(sTfun($i,$i),$o,p,vAPP($o,sTfun($i,$i),f,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP(sTfun($i,$i),$o,a,vAPP($o,sTfun($i,$i),f,$true))),$true))) )
| ( b = $false ) ),
inference(superposition,[],[f8,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO018^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 09:55:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (17742)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (17749)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % Exception at run slice level
% 0.15/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.37 % (17743)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % (17744)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37 % (17745)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.37 % (17746)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.37 % (17747)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.37 % (17748)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37 % (17746)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.37 % (17745)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.37 % Exception at run slice level
% 0.15/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.37 % Exception at run slice level
% 0.15/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.37 % Exception at run slice level
% 0.15/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.37 % (17748)First to succeed.
% 0.15/0.37 % (17748)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17742"
% 0.15/0.38 % (17745)Also succeeded, but the first one will report.
% 0.15/0.38 % (17748)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (17748)------------------------------
% 0.15/0.38 % (17748)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (17748)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (17748)Memory used [KB]: 782
% 0.15/0.38 % (17748)Time elapsed: 0.005 s
% 0.15/0.38 % (17748)Instructions burned: 6 (million)
% 0.15/0.38 % (17742)Success in time 0.018 s
%------------------------------------------------------------------------------