TSTP Solution File: SYO017_8 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO017_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n032.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:09:58 EDT 2024
% Result : Theorem 0.16s 0.32s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 186 ( 25 equ)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 80 ( 29 ~; 39 |; 5 &)
% ( 6 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 104 ( 102 fml; 2 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 1 ( 1 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_2,type,
bG0: $o ).
tff(pred_def_1,type,
h: $o > $o ).
tff(f63,plain,
$false,
inference(subsumption_resolution,[],[f60,f61]) ).
tff(f61,plain,
~ h($false),
inference(duplicate_literal_removal,[],[f58]) ).
tff(f58,plain,
( ~ h($false)
| ~ h($false) ),
inference(superposition,[],[f20,f55]) ).
tff(f55,plain,
$false = bG0,
inference(subsumption_resolution,[],[f54,f47]) ).
tff(f47,plain,
( h($false)
| ( $false = bG0 ) ),
inference(subsumption_resolution,[],[f45,f37]) ).
tff(f37,plain,
( sP1
| ( $false = bG0 ) ),
inference(trivial_inequality_removal,[],[f33]) ).
tff(f33,plain,
( ( $true != $true )
| sP1
| ( $false = bG0 ) ),
inference(superposition,[],[f18,f4]) ).
tff(f4,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f18,plain,
( ( $true != bG0 )
| sP1 ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ( sP1
| ( $true != bG0 ) )
& ( ( $true = bG0 )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f9]) ).
tff(f9,plain,
( sP1
<=> ( $true = bG0 ) ),
inference(definition_folding,[],[f5,f8]) ).
tff(f8,plain,
( sP1
<=> ( h($true)
<=> h($false) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
tff(f5,plain,
( ( h($true)
<=> h($false) )
<=> ( $true = bG0 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).
tff(f45,plain,
( h($false)
| ( $false = bG0 )
| ~ sP1 ),
inference(duplicate_literal_removal,[],[f43]) ).
tff(f43,plain,
( h($false)
| ( $false = bG0 )
| h($false)
| ~ sP1 ),
inference(resolution,[],[f35,f13]) ).
tff(f13,plain,
( ~ h($true)
| h($false)
| ~ sP1 ),
inference(cnf_transformation,[],[f10]) ).
tff(f10,plain,
( ( sP1
| ( ( ~ h($false)
| ~ h($true) )
& ( h($false)
| h($true) ) ) )
& ( ( ( h($true)
| ~ h($false) )
& ( h($false)
| ~ h($true) ) )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f8]) ).
tff(f35,plain,
( h($true)
| h($false)
| ( $false = bG0 ) ),
inference(superposition,[],[f19,f4]) ).
tff(f19,plain,
( h(bG0)
| h($false) ),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
( ( ~ h($false)
| ~ h(bG0) )
& ( h($false)
| h(bG0) ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f7,plain,
( h(bG0)
<~> h($false) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
~ ( h(bG0)
<=> h($false) ),
inference(fool_elimination,[],[f2,f5]) ).
tff(f2,negated_conjecture,
h(h($true) = h($false)) != h($false),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
h(h($true) = h($false)) = h($false),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f54,plain,
( ( $false = bG0 )
| ~ h($false) ),
inference(duplicate_literal_removal,[],[f50]) ).
tff(f50,plain,
( ( $false = bG0 )
| ~ h($false)
| ( $false = bG0 ) ),
inference(resolution,[],[f49,f34]) ).
tff(f34,plain,
( ~ h($true)
| ~ h($false)
| ( $false = bG0 ) ),
inference(superposition,[],[f20,f4]) ).
tff(f49,plain,
( h($true)
| ( $false = bG0 ) ),
inference(subsumption_resolution,[],[f48,f37]) ).
tff(f48,plain,
( ( $false = bG0 )
| h($true)
| ~ sP1 ),
inference(resolution,[],[f47,f14]) ).
tff(f14,plain,
( ~ h($false)
| h($true)
| ~ sP1 ),
inference(cnf_transformation,[],[f10]) ).
tff(f20,plain,
( ~ h(bG0)
| ~ h($false) ),
inference(cnf_transformation,[],[f12]) ).
tff(f60,plain,
h($false),
inference(duplicate_literal_removal,[],[f59]) ).
tff(f59,plain,
( h($false)
| h($false) ),
inference(superposition,[],[f19,f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SYO017_8 : TPTP v8.2.0. Released v8.0.0.
% 0.03/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 09:08:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % (10943)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.31 % (10947)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.31 % (10945)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.31 % (10944)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.31 % (10948)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.16/0.32 % (10949)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.32 % (10950)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.32 Detected minimum model sizes of [1]
% 0.16/0.32 Detected maximum model sizes of [3]
% 0.16/0.32 Detected minimum model sizes of [1]
% 0.16/0.32 Detected maximum model sizes of [6]
% 0.16/0.32 TRYING [1]
% 0.16/0.32 TRYING [2]
% 0.16/0.32 TRYING [1]
% 0.16/0.32 TRYING [3]
% 0.16/0.32 TRYING [2]
% 0.16/0.32 % (10950)First to succeed.
% 0.16/0.32 % (10947)Also succeeded, but the first one will report.
% 0.16/0.32 TRYING [3]
% 0.16/0.32 % (10950)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10943"
% 0.16/0.32 % (10949)Also succeeded, but the first one will report.
% 0.16/0.32 TRYING [4]
% 0.16/0.32 Detected minimum model sizes of [1]
% 0.16/0.32 Detected maximum model sizes of [3]
% 0.16/0.32 TRYING [1]
% 0.16/0.32 TRYING [5]
% 0.16/0.32 TRYING [2]
% 0.16/0.32 % (10950)Refutation found. Thanks to Tanya!
% 0.16/0.32 % SZS status Theorem for theBenchmark
% 0.16/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.32 % (10950)------------------------------
% 0.16/0.32 % (10950)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.32 % (10950)Termination reason: Refutation
% 0.16/0.32
% 0.16/0.32 % (10950)Memory used [KB]: 755
% 0.16/0.32 % (10950)Time elapsed: 0.002 s
% 0.16/0.32 % (10950)Instructions burned: 4 (million)
% 0.16/0.32 % (10943)Success in time 0.002 s
%------------------------------------------------------------------------------