TSTP Solution File: SYO357^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO357^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 : n023.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.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 46 ( 8 unt; 16 typ; 0 def)
% Number of atoms : 303 ( 90 equ; 0 cnn)
% Maximal formula atoms : 8 ( 10 avg)
% Number of connectives : 133 ( 48 ~; 38 |; 31 &; 0 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 42 ( 41 >; 1 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 7 con; 0-6 aty)
% Number of variables : 30 ( 0 ^ 19 !; 5 ?; 30 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
atype: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
atype: $tType ).
thf(func_def_1,type,
a: $o ).
thf(func_def_2,type,
v: atype ).
thf(func_def_3,type,
u: atype ).
thf(func_def_4,type,
b: $o ).
thf(func_def_8,type,
sP0: $o ).
thf(func_def_9,type,
sK1: atype > $o ).
thf(func_def_10,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_11,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_12,type,
vAND: $o > $o > $o ).
thf(func_def_13,type,
vOR: $o > $o > $o ).
thf(func_def_14,type,
vIMP: $o > $o > $o ).
thf(func_def_15,type,
vNOT: $o > $o ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f78,plain,
$false,
inference(trivial_inequality_removal,[],[f77]) ).
thf(f77,plain,
$true = $false,
inference(forward_demodulation,[],[f74,f33]) ).
thf(f33,plain,
$false = vAPP(atype,$o,sK1,v),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f31,plain,
( ( $true != $true )
| ( $false = vAPP(atype,$o,sK1,v) ) ),
inference(superposition,[],[f21,f4]) ).
thf(f4,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
introduced(fool_axiom,[]) ).
thf(f21,plain,
$true != vAPP(atype,$o,sK1,v),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( $true != vAPP(atype,$o,sK1,v) )
& ( $true = vAPP(atype,$o,sK1,u) )
& ! [X1: atype > $o] :
( ( ( vAPP(atype,$o,X1,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) )
| ( vAPP(atype,$o,X1,u) != $true )
| ( $true = sP0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f14]) ).
thf(f14,plain,
( ? [X0: atype > $o] :
( ( vAPP(atype,$o,X0,v) != $true )
& ( vAPP(atype,$o,X0,u) = $true ) )
=> ( ( $true != vAPP(atype,$o,sK1,v) )
& ( $true = vAPP(atype,$o,sK1,u) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X0: atype > $o] :
( ( vAPP(atype,$o,X0,v) != $true )
& ( vAPP(atype,$o,X0,u) = $true ) )
& ! [X1: atype > $o] :
( ( ( vAPP(atype,$o,X1,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) )
| ( vAPP(atype,$o,X1,u) != $true )
| ( $true = sP0 ) ) ),
inference(rectify,[],[f11]) ).
thf(f11,plain,
( ? [X1: atype > $o] :
( ( vAPP(atype,$o,X1,v) != $true )
& ( vAPP(atype,$o,X1,u) = $true ) )
& ! [X0: atype > $o] :
( ( ( vAPP(atype,$o,X0,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) )
| ( vAPP(atype,$o,X0,u) != $true )
| ( $true = sP0 ) ) ),
inference(definition_folding,[],[f9,f10]) ).
thf(f10,plain,
( ( ( a = $true )
& ( a != $true ) )
| ( $true != sP0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[=])]) ).
thf(f9,plain,
( ? [X1: atype > $o] :
( ( vAPP(atype,$o,X1,v) != $true )
& ( vAPP(atype,$o,X1,u) = $true ) )
& ! [X0: atype > $o] :
( ( ( vAPP(atype,$o,X0,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) )
| ( vAPP(atype,$o,X0,u) != $true )
| ( ( a = $true )
& ( a != $true ) ) ) ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
( ? [X1: atype > $o] :
( ( vAPP(atype,$o,X1,v) != $true )
& ( vAPP(atype,$o,X1,u) = $true ) )
& ! [X0: atype > $o] :
( ( ( vAPP(atype,$o,X0,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) )
| ( vAPP(atype,$o,X0,u) != $true )
| ( ( a = $true )
& ( a != $true ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
~ ( ! [X0: atype > $o] :
( ( ( vAPP(atype,$o,X0,u) = $true )
& ( ( a != $true )
| ( a = $true ) ) )
=> ( ( vAPP(atype,$o,X0,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) ) )
=> ! [X1: atype > $o] :
( ( vAPP(atype,$o,X1,u) = $true )
=> ( vAPP(atype,$o,X1,v) = $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
~ ( ! [X0: atype > $o] :
( ( ( vAPP(atype,$o,X0,u) = $true )
& ( ( a != $true )
| ( a = $true ) ) )
=> ( ( vAPP(atype,$o,X0,v) = $true )
& ( ( b != $true )
| ( b = $true ) ) ) )
=> ! [X1: atype > $o] :
( ( vAPP(atype,$o,X1,u) = $true )
=> ( vAPP(atype,$o,X1,v) = $true ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: atype > $o] :
( ( vAPP(atype,$o,X0,u)
& ( ~ a
| a ) )
=> ( vAPP(atype,$o,X0,v)
& ( ~ b
| b ) ) )
=> ! [X1: atype > $o] :
( vAPP(atype,$o,X1,u)
=> vAPP(atype,$o,X1,v) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: atype > $o] :
( ( vAPP(atype,$o,X0,u)
& ( ~ a
| a ) )
=> ( vAPP(atype,$o,X0,v)
& ( ~ b
| b ) ) )
=> ! [X1: atype > $o] :
( vAPP(atype,$o,X1,u)
=> vAPP(atype,$o,X1,v) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: atype > $o] :
( ( vAPP(atype,$o,X0,u)
& ( ~ a
| a ) )
=> ( vAPP(atype,$o,X0,v)
& ( ~ b
| b ) ) )
=> ! [X1: atype > $o] :
( vAPP(atype,$o,X1,u)
=> vAPP(atype,$o,X1,v) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE2LEIBEQ2_pme) ).
thf(f74,plain,
$true = vAPP(atype,$o,sK1,v),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f71,plain,
( ( $true != $true )
| ( $true = vAPP(atype,$o,sK1,v) ) ),
inference(superposition,[],[f65,f20]) ).
thf(f20,plain,
$true = vAPP(atype,$o,sK1,u),
inference(cnf_transformation,[],[f15]) ).
thf(f65,plain,
! [X1: atype > $o] :
( ( vAPP(atype,$o,X1,u) != $true )
| ( vAPP(atype,$o,X1,v) = $true ) ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
! [X1: atype > $o] :
( ( $true = $false )
| ( vAPP(atype,$o,X1,v) = $true )
| ( vAPP(atype,$o,X1,u) != $true ) ),
inference(forward_demodulation,[],[f19,f59]) ).
thf(f59,plain,
$false = sP0,
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( $true != $true )
| ( $false = sP0 ) ),
inference(superposition,[],[f57,f4]) ).
thf(f57,plain,
$true != sP0,
inference(subsumption_resolution,[],[f17,f16]) ).
thf(f16,plain,
( ( $true != sP0 )
| ( a != $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( ( a = $true )
& ( a != $true ) )
| ( $true != sP0 ) ),
inference(nnf_transformation,[],[f10]) ).
thf(f17,plain,
( ( a = $true )
| ( $true != sP0 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f19,plain,
! [X1: atype > $o] :
( ( vAPP(atype,$o,X1,v) = $true )
| ( vAPP(atype,$o,X1,u) != $true )
| ( $true = sP0 ) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO357^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n023.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 08:31:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % (8094)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (8099)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.36 % (8095)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.36 % (8098)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.36 % (8097)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.14/0.36 % (8098)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.36 % (8097)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.36 % Exception at run slice level
% 0.14/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.36 % Exception at run slice level
% 0.14/0.36 % (8100)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.37 % (8099)First to succeed.
% 0.14/0.37 % (8099)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-8094"
% 0.14/0.37 % (8099)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (8099)------------------------------
% 0.14/0.37 % (8099)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37 % (8099)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (8099)Memory used [KB]: 767
% 0.14/0.37 % (8099)Time elapsed: 0.004 s
% 0.14/0.37 % (8099)Instructions burned: 5 (million)
% 0.14/0.37 % (8094)Success in time 0.007 s
%------------------------------------------------------------------------------