TSTP Solution File: SYO356^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO356^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:11:00 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 36 ( 8 unt; 14 typ; 0 def)
% Number of atoms : 171 ( 39 equ; 0 cnn)
% Maximal formula atoms : 4 ( 7 avg)
% Number of connectives : 48 ( 18 ~; 8 |; 8 &; 0 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 47 ( 46 >; 1 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 4 con; 0-6 aty)
% Number of variables : 30 ( 0 ^ 18 !; 6 ?; 30 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
v: a ).
thf(func_def_2,type,
u: a ).
thf(func_def_6,type,
sK0: a > $o ).
thf(func_def_7,type,
sK1: ( a > a > $o ) > a ).
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(f57,plain,
$false,
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
$true = $false,
inference(forward_demodulation,[],[f55,f44]) ).
thf(f44,plain,
$false = vAPP(a,$o,sK0,v),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
( ( $true != $true )
| ( $false = vAPP(a,$o,sK0,v) ) ),
inference(superposition,[],[f14,f4]) ).
thf(f4,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
introduced(fool_axiom,[]) ).
thf(f14,plain,
$true != vAPP(a,$o,sK0,v),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( $true != vAPP(a,$o,sK0,v) )
& ( $true = vAPP(a,$o,sK0,u) )
& ! [X1: a > a > $o] :
( ( $true = vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,u),v) )
| ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,vAPP(sTfun(a,sTfun(a,$o)),a,sK1,X1)),vAPP(sTfun(a,sTfun(a,$o)),a,sK1,X1)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o] :
( ( $true != vAPP(a,$o,X0,v) )
& ( $true = vAPP(a,$o,X0,u) ) )
=> ( ( $true != vAPP(a,$o,sK0,v) )
& ( $true = vAPP(a,$o,sK0,u) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X1: a > a > $o] :
( ? [X2: a] : ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,X2),X2) )
=> ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,vAPP(sTfun(a,sTfun(a,$o)),a,sK1,X1)),vAPP(sTfun(a,sTfun(a,$o)),a,sK1,X1)) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ? [X0: a > $o] :
( ( $true != vAPP(a,$o,X0,v) )
& ( $true = vAPP(a,$o,X0,u) ) )
& ! [X1: a > a > $o] :
( ( $true = vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,u),v) )
| ? [X2: a] : ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,X2),X2) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ? [X2: a > $o] :
( ( vAPP(a,$o,X2,v) != $true )
& ( vAPP(a,$o,X2,u) = $true ) )
& ! [X0: a > a > $o] :
( ( vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,u),v) = $true )
| ? [X1: a] : ( vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,X1),X1) != $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ! [X0: a > a > $o] :
( ! [X1: a] : ( vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,X1),X1) = $true )
=> ( vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,u),v) = $true ) )
=> ! [X2: a > $o] :
( ( vAPP(a,$o,X2,u) = $true )
=> ( vAPP(a,$o,X2,v) = $true ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a > a > $o] :
( ! [X1: a] : vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,X1),X1)
=> vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,u),v) )
=> ! [X2: a > $o] :
( vAPP(a,$o,X2,u)
=> vAPP(a,$o,X2,v) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a > a > $o] :
( ! [X1: a] : vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,X1),X1)
=> vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,u),v) )
=> ! [X2: a > $o] :
( vAPP(a,$o,X2,u)
=> vAPP(a,$o,X2,v) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a > a > $o] :
( ! [X1: a] : vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,X1),X1)
=> vAPP(a,$o,vAPP(a,sTfun(a,$o),X0,u),v) )
=> ! [X2: a > $o] :
( vAPP(a,$o,X2,u)
=> vAPP(a,$o,X2,v) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE1LEIBEQ2_pme) ).
thf(f55,plain,
$true = vAPP(a,$o,sK0,v),
inference(backward_demodulation,[],[f13,f53]) ).
thf(f53,plain,
u = v,
inference(equality_proxy_clausification,[],[f52]) ).
thf(f52,plain,
$true = vAPP(a,$o,vAPP(a,sTfun(a,$o),vEQ(a),u),v),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
( ( $true != $true )
| ( $true = vAPP(a,$o,vAPP(a,sTfun(a,$o),vEQ(a),u),v) ) ),
inference(boolean_simplification,[],[f48]) ).
thf(f48,plain,
( ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),vEQ(a),vAPP(sTfun(a,sTfun(a,$o)),a,sK1,vEQ(a))),vAPP(sTfun(a,sTfun(a,$o)),a,sK1,vEQ(a))) )
| ( $true = vAPP(a,$o,vAPP(a,sTfun(a,$o),vEQ(a),u),v) ) ),
inference(primitive_instantiation,[],[f12]) ).
thf(f12,plain,
! [X1: a > a > $o] :
( ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,vAPP(sTfun(a,sTfun(a,$o)),a,sK1,X1)),vAPP(sTfun(a,sTfun(a,$o)),a,sK1,X1)) )
| ( $true = vAPP(a,$o,vAPP(a,sTfun(a,$o),X1,u),v) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f13,plain,
$true = vAPP(a,$o,sK0,u),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO356^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.15/0.35 % Computer : n028.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 08:49:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (19126)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (19130)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_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 % (19133)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 % (19132)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 % (19135)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37 % (19133)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.37 % (19132)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.37 % (19136)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 % (19131)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/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.38 % Exception at run slice level
% 0.15/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.38 % (19132)Also succeeded, but the first one will report.
% 0.15/0.38 % (19135)First to succeed.
% 0.15/0.38 % (19135)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19126"
% 0.15/0.38 % (19135)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 % (19135)------------------------------
% 0.15/0.38 % (19135)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (19135)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (19135)Memory used [KB]: 768
% 0.15/0.38 % (19135)Time elapsed: 0.005 s
% 0.15/0.38 % (19135)Instructions burned: 5 (million)
% 0.15/0.38 % (19126)Success in time 0.017 s
%------------------------------------------------------------------------------