TSTP Solution File: SEU886^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU886^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 04:06:56 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 38 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 261 ( 80 equ; 0 cnn)
% Maximal formula atoms : 14 ( 12 avg)
% Number of connectives : 115 ( 43 ~; 27 |; 39 &; 0 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 21 ( 20 >; 1 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 4 con; 0-6 aty)
% Number of variables : 46 ( 0 ^ 20 !; 20 ?; 46 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
f: b > a ).
thf(func_def_3,type,
y: b > $o ).
thf(func_def_4,type,
x: b > $o ).
thf(func_def_8,type,
sK0: a ).
thf(func_def_9,type,
sK1: b ).
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(f55,plain,
$false,
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
$true != $true,
inference(superposition,[],[f51,f13]) ).
thf(f13,plain,
$true = vAPP(b,$o,y,sK1),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( ! [X1: b] :
( ( vAPP(b,a,f,X1) != sK0 )
| ( vAPP(b,$o,y,X1) != $true ) )
| ! [X2: b] :
( ( vAPP(b,a,f,X2) != sK0 )
| ( $true != vAPP(b,$o,x,X2) ) ) )
& ( sK0 = vAPP(b,a,f,sK1) )
& ( $true = vAPP(b,$o,y,sK1) )
& ( $true = vAPP(b,$o,x,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a] :
( ( ! [X1: b] :
( ( vAPP(b,a,f,X1) != X0 )
| ( vAPP(b,$o,y,X1) != $true ) )
| ! [X2: b] :
( ( vAPP(b,a,f,X2) != X0 )
| ( $true != vAPP(b,$o,x,X2) ) ) )
& ? [X3: b] :
( ( vAPP(b,a,f,X3) = X0 )
& ( $true = vAPP(b,$o,y,X3) )
& ( $true = vAPP(b,$o,x,X3) ) ) )
=> ( ( ! [X1: b] :
( ( vAPP(b,a,f,X1) != sK0 )
| ( vAPP(b,$o,y,X1) != $true ) )
| ! [X2: b] :
( ( vAPP(b,a,f,X2) != sK0 )
| ( $true != vAPP(b,$o,x,X2) ) ) )
& ? [X3: b] :
( ( vAPP(b,a,f,X3) = sK0 )
& ( $true = vAPP(b,$o,y,X3) )
& ( $true = vAPP(b,$o,x,X3) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: b] :
( ( vAPP(b,a,f,X3) = sK0 )
& ( $true = vAPP(b,$o,y,X3) )
& ( $true = vAPP(b,$o,x,X3) ) )
=> ( ( sK0 = vAPP(b,a,f,sK1) )
& ( $true = vAPP(b,$o,y,sK1) )
& ( $true = vAPP(b,$o,x,sK1) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a] :
( ( ! [X1: b] :
( ( vAPP(b,a,f,X1) != X0 )
| ( vAPP(b,$o,y,X1) != $true ) )
| ! [X2: b] :
( ( vAPP(b,a,f,X2) != X0 )
| ( $true != vAPP(b,$o,x,X2) ) ) )
& ? [X3: b] :
( ( vAPP(b,a,f,X3) = X0 )
& ( $true = vAPP(b,$o,y,X3) )
& ( $true = vAPP(b,$o,x,X3) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a] :
( ( ! [X2: b] :
( ( vAPP(b,a,f,X2) != X0 )
| ( $true != vAPP(b,$o,y,X2) ) )
| ! [X3: b] :
( ( vAPP(b,a,f,X3) != X0 )
| ( $true != vAPP(b,$o,x,X3) ) ) )
& ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& ( vAPP(b,$o,y,X1) = $true )
& ( vAPP(b,$o,x,X1) = $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& ( vAPP(b,$o,y,X1) = $true )
& ( vAPP(b,$o,x,X1) = $true ) )
=> ( ? [X2: b] :
( ( vAPP(b,a,f,X2) = X0 )
& ( $true = vAPP(b,$o,y,X2) ) )
& ? [X3: b] :
( ( vAPP(b,a,f,X3) = X0 )
& ( $true = vAPP(b,$o,x,X3) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,y,X1)
& vAPP(b,$o,x,X1) )
=> ( ? [X2: b] :
( ( vAPP(b,a,f,X2) = X0 )
& vAPP(b,$o,y,X2) )
& ? [X3: b] :
( ( vAPP(b,a,f,X3) = X0 )
& vAPP(b,$o,x,X3) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,y,X1)
& vAPP(b,$o,x,X1) )
=> ( ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,y,X1) )
& ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,x,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,y,X1)
& vAPP(b,$o,x,X1) )
=> ( ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,y,X1) )
& ? [X1: b] :
( ( vAPP(b,a,f,X1) = X0 )
& vAPP(b,$o,x,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5203_pme) ).
thf(f51,plain,
$true != vAPP(b,$o,y,sK1),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( sK0 != sK0 )
| ( $true != vAPP(b,$o,y,sK1) ) ),
inference(superposition,[],[f49,f14]) ).
thf(f14,plain,
sK0 = vAPP(b,a,f,sK1),
inference(cnf_transformation,[],[f11]) ).
thf(f49,plain,
! [X0: b] :
( ( sK0 != vAPP(b,a,f,X0) )
| ( $true != vAPP(b,$o,y,X0) ) ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f48,plain,
! [X0: b] :
( ( sK0 != sK0 )
| ( $true != vAPP(b,$o,y,X0) )
| ( sK0 != vAPP(b,a,f,X0) ) ),
inference(superposition,[],[f47,f14]) ).
thf(f47,plain,
! [X0: b] :
( ( sK0 != vAPP(b,a,f,sK1) )
| ( $true != vAPP(b,$o,y,X0) )
| ( sK0 != vAPP(b,a,f,X0) ) ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
! [X0: b] :
( ( $true != $true )
| ( $true != vAPP(b,$o,y,X0) )
| ( sK0 != vAPP(b,a,f,sK1) )
| ( sK0 != vAPP(b,a,f,X0) ) ),
inference(superposition,[],[f15,f12]) ).
thf(f12,plain,
$true = vAPP(b,$o,x,sK1),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X2: b,X1: b] :
( ( $true != vAPP(b,$o,x,X2) )
| ( vAPP(b,$o,y,X1) != $true )
| ( vAPP(b,a,f,X2) != sK0 )
| ( vAPP(b,a,f,X1) != sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU886^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.34 % Computer : n028.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sun May 19 15:52:37 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (9200)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.36 % (9203)WARNING: value z3 for option sas not known
% 0.15/0.37 % (9204)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37 % (9206)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.15/0.37 % (9205)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.37 % (9203)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.15/0.37 % (9201)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/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 % 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 % (9206)First to succeed.
% 0.15/0.37 % (9205)Also succeeded, but the first one will report.
% 0.15/0.37 % (9203)Also succeeded, but the first one will report.
% 0.15/0.37 % (9206)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9200"
% 0.15/0.37 % (9206)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37 % (9206)------------------------------
% 0.15/0.37 % (9206)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.37 % (9206)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (9206)Memory used [KB]: 774
% 0.15/0.37 % (9206)Time elapsed: 0.005 s
% 0.15/0.37 % (9206)Instructions burned: 6 (million)
% 0.15/0.37 % (9200)Success in time 0.01 s
%------------------------------------------------------------------------------