TSTP Solution File: SYO202^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO202^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 : n028.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:10:35 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 21 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 113 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 9 avg)
% Number of connectives : 26 ( 17 ~; 0 |; 8 &; 0 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 25 ( 24 >; 1 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 2 con; 0-6 aty)
% Number of variables : 12 ( 0 ^ 0 !; 6 ?; 12 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_4,type,
sK0: $o > $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(f14,plain,
$false,
inference(subsumption_resolution,[],[f12,f13]) ).
thf(f13,plain,
$true != vAPP($o,$o,sK0,$true),
inference(boolean_simplification,[],[f11]) ).
thf(f11,plain,
$true != vAPP($o,$o,sK0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),sK0),sK0)),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( $true != vAPP($o,$o,sK0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),sK0),sK0)) )
& ( $true = vAPP($o,$o,sK0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),sK0),sK0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: $o > $o] :
( ( $true != vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),X0),X0)) )
& ( $true = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),X0),X0)) ) )
=> ( ( $true != vAPP($o,$o,sK0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),sK0),sK0)) )
& ( $true = vAPP($o,$o,sK0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),sK0),sK0)) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: $o > $o] :
( ( $true != vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),X0),X0)) )
& ( $true = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),X0),X0)) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
~ ~ ? [X0: $o > $o] :
( ( $true != vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),X0),X0)) )
& ( $true = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),X0),X0)) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ~ ? [X0: $o > $o] :
( ~ vAPP($o,$o,X0,X0 = X0)
& vAPP($o,$o,X0,X0 = X0) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ~ ? [X0: $o > $o] :
( ~ vAPP($o,$o,X0,X0 = X0)
& vAPP($o,$o,X0,X0 = X0) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
~ ? [X0: $o > $o] :
( ~ vAPP($o,$o,X0,X0 = X0)
& vAPP($o,$o,X0,X0 = X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT22) ).
thf(f12,plain,
$true = vAPP($o,$o,sK0,$true),
inference(boolean_simplification,[],[f10]) ).
thf(f10,plain,
$true = vAPP($o,$o,sK0,vAPP(sTfun($o,$o),$o,vAPP(sTfun($o,$o),sTfun(sTfun($o,$o),$o),vEQ(sTfun($o,$o)),sK0),sK0)),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYO202^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.37 % Computer : n028.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 09:45:22 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.38 % (18210)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.39 % (18213)WARNING: value z3 for option sas not known
% 0.16/0.39 % (18216)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.16/0.39 % (18217)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.16/0.39 % (18217)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.39 % (18217)First to succeed.
% 0.16/0.39 % (18216)Also succeeded, but the first one will report.
% 0.16/0.39 % (18211)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.39 % (18213)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.16/0.39 % (18217)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18210"
% 0.16/0.39 % Exception at run slice level
% 0.16/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.39 % (18217)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39 % (18217)------------------------------
% 0.16/0.39 % (18217)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.39 % (18217)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (18217)Memory used [KB]: 749
% 0.16/0.39 % (18217)Time elapsed: 0.002 s
% 0.16/0.39 % (18217)Instructions burned: 3 (million)
% 0.16/0.39 % (18210)Success in time 0.016 s
%------------------------------------------------------------------------------