TSTP Solution File: SYO198^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO198^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 : n014.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.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 25 ( 3 unt; 10 typ; 0 def)
% Number of atoms : 86 ( 22 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 33 ( 19 ~; 9 |; 4 &; 0 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 29 ( 28 >; 1 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 4 con; 0-6 aty)
% Number of variables : 33 ( 0 ^ 19 !; 8 ?; 33 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
sK0: $o ).
thf(func_def_4,type,
sK1: $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(f106,plain,
$false,
inference(subsumption_resolution,[],[f105,f66]) ).
thf(f66,plain,
! [X0: $o] : ( $true = X0 ),
inference(duplicate_literal_removal,[],[f65]) ).
thf(f65,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $true = X0 ) ),
inference(binary_proxy_clausification,[],[f63]) ).
thf(f63,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $true != vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X0),sK0) ) ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f41,plain,
! [X0: $o] :
( ( $true != vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X0),sK1) )
| ( $true != vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X0),sK0) ) ),
inference(primitive_instantiation,[],[f10]) ).
thf(f10,plain,
! [X2: $o > $o] :
( ( $true != vAPP($o,$o,X2,sK1) )
| ( $true != vAPP($o,$o,X2,sK0) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
! [X2: $o > $o] :
( ( $true != vAPP($o,$o,X2,sK1) )
| ( $true != vAPP($o,$o,X2,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( vAPP($o,$o,X2,X1) != $true )
| ( vAPP($o,$o,X2,X0) != $true ) )
=> ! [X2: $o > $o] :
( ( $true != vAPP($o,$o,X2,sK1) )
| ( $true != vAPP($o,$o,X2,sK0) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( vAPP($o,$o,X2,X1) != $true )
| ( vAPP($o,$o,X2,X0) != $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( ( vAPP($o,$o,X2,X1) = $true )
& ( vAPP($o,$o,X2,X0) = $true ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( vAPP($o,$o,X2,X1)
& vAPP($o,$o,X2,X0) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( vAPP($o,$o,X2,X1)
& vAPP($o,$o,X2,X0) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: $o,X1: $o] :
? [X2: $o > $o] :
( vAPP($o,$o,X2,X1)
& vAPP($o,$o,X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT8) ).
thf(f105,plain,
! [X2: $o > $o] : ( $true != vAPP($o,$o,X2,sK1) ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
! [X2: $o > $o] :
( ( $true != $true )
| ( $true != vAPP($o,$o,X2,sK1) ) ),
inference(backward_demodulation,[],[f10,f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO198^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 08:47:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (15372)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.35 % (15377)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.36 % (15377)First to succeed.
% 0.13/0.36 % (15377)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15372"
% 0.13/0.36 % (15377)Refutation found. Thanks to Tanya!
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36 % (15377)------------------------------
% 0.13/0.36 % (15377)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.36 % (15377)Termination reason: Refutation
% 0.13/0.36
% 0.13/0.36 % (15377)Memory used [KB]: 768
% 0.13/0.36 % (15377)Time elapsed: 0.003 s
% 0.13/0.36 % (15377)Instructions burned: 5 (million)
% 0.13/0.36 % (15372)Success in time 0.013 s
%------------------------------------------------------------------------------