TSTP Solution File: SYO371^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO371^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 : n004.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:03 EDT 2024
% Result : Theorem 0.21s 0.36s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 136 ( 35 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 33 ( 8 ~; 13 |; 1 &; 0 @)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 24 ( 23 >; 1 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 4 con; 0-6 aty)
% Number of variables : 12 ( 0 ^ 6 !; 0 ?; 12 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cQ: $o ).
thf(func_def_1,type,
cP: $o ).
thf(func_def_5,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_6,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
vOR: $o > $o > $o ).
thf(func_def_9,type,
vIMP: $o > $o > $o ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(func_def_11,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f105,plain,
$false,
inference(trivial_inequality_removal,[],[f102]) ).
thf(f102,plain,
$true = $false,
inference(backward_demodulation,[],[f99,f101]) ).
thf(f101,plain,
cP = $false,
inference(trivial_inequality_removal,[],[f100]) ).
thf(f100,plain,
( ( $true = $false )
| ( cP = $false ) ),
inference(forward_demodulation,[],[f85,f92]) ).
thf(f92,plain,
cQ = $false,
inference(trivial_inequality_removal,[],[f91]) ).
thf(f91,plain,
( ( $true = $false )
| ( cQ = $false ) ),
inference(duplicate_literal_removal,[],[f90]) ).
thf(f90,plain,
( ( $true = $false )
| ( cQ = $false )
| ( cQ = $false ) ),
inference(superposition,[],[f11,f61]) ).
thf(f61,plain,
( ( cP = $true )
| ( cQ = $false ) ),
inference(not_proxy_clausification,[],[f60]) ).
thf(f60,plain,
( ( cP = $true )
| ( $true = vAPP($o,$o,vNOT,cQ) ) ),
inference(not_proxy_clausification,[],[f54]) ).
thf(f54,plain,
( ( $true != vAPP($o,$o,vNOT,cP) )
| ( $true = vAPP($o,$o,vNOT,cQ) ) ),
inference(primitive_instantiation,[],[f8]) ).
thf(f8,plain,
! [X0: $o > $o] :
( ( vAPP($o,$o,X0,cP) != $true )
| ( vAPP($o,$o,X0,cQ) = $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( ( cP != cQ )
& ! [X0: $o > $o] :
( ( vAPP($o,$o,X0,cQ) = $true )
| ( vAPP($o,$o,X0,cP) != $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ! [X0: $o > $o] :
( ( vAPP($o,$o,X0,cP) = $true )
=> ( vAPP($o,$o,X0,cQ) = $true ) )
=> ( cP = cQ ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: $o > $o] :
( vAPP($o,$o,X0,cP)
=> vAPP($o,$o,X0,cQ) )
=> ( cP
<=> cQ ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: $o > $o] :
( vAPP($o,$o,X0,cP)
=> vAPP($o,$o,X0,cQ) )
=> ( cP
<=> cQ ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: $o > $o] :
( vAPP($o,$o,X0,cP)
=> vAPP($o,$o,X0,cQ) )
=> ( cP
<=> cQ ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEXT_O_LEIB) ).
thf(f11,plain,
( ( cP = $false )
| ( cQ = $false ) ),
inference(binary_proxy_clausification,[],[f9]) ).
thf(f9,plain,
cP != cQ,
inference(cnf_transformation,[],[f7]) ).
thf(f85,plain,
( ( cP = $false )
| ( cQ = $true ) ),
inference(binary_proxy_clausification,[],[f47]) ).
thf(f47,plain,
cP = cQ,
inference(leibniz_equality_elimination,[],[f8]) ).
thf(f99,plain,
cP = $true,
inference(trivial_inequality_removal,[],[f96]) ).
thf(f96,plain,
( ( $true = $false )
| ( cP = $true ) ),
inference(backward_demodulation,[],[f10,f92]) ).
thf(f10,plain,
( ( cP = $true )
| ( cQ = $true ) ),
inference(binary_proxy_clausification,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO371^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 09:43:37 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 % (25854)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.36 % (25859)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.36 % (25861)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.21/0.36 % Exception at run slice level
% 0.21/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.36 % (25855)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.36 % (25858)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.21/0.36 % (25857)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.21/0.36 % (25856)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.36 % (25858)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.36 % Exception at run slice level
% 0.21/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs% (25857)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.36
% 0.21/0.36 % Exception at run slice level
% 0.21/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.36 % Exception at run slice level
% 0.21/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.36 % (25860)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.36 % (25859)First to succeed.
% 0.21/0.36 % (25859)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25854"
% 0.21/0.36 % (25859)Refutation found. Thanks to Tanya!
% 0.21/0.36 % SZS status Theorem for theBenchmark
% 0.21/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.36 % (25859)------------------------------
% 0.21/0.36 % (25859)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.36 % (25859)Termination reason: Refutation
% 0.21/0.36
% 0.21/0.36 % (25859)Memory used [KB]: 769
% 0.21/0.36 % (25859)Time elapsed: 0.004 s
% 0.21/0.36 % (25859)Instructions burned: 5 (million)
% 0.21/0.36 % (25854)Success in time 0.004 s
%------------------------------------------------------------------------------