TSTP Solution File: SYO369_8 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO369_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 : n004.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:03 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 205 ( 32 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 131 ( 51 ~; 58 |; 9 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 78 ( 76 fml; 2 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 9 usr; 10 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(func_def_3,type,
bG1: $o ).
tff(pred_def_3,type,
cP: $o > $o ).
tff(f69,plain,
$false,
inference(avatar_sat_refutation,[],[f30,f35,f40,f41,f45,f46,f49,f68]) ).
tff(f68,plain,
( spl2_2
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f67]) ).
tff(f67,plain,
( $false
| spl2_2
| spl2_4 ),
inference(resolution,[],[f64,f60]) ).
tff(f60,plain,
( cP($false)
| spl2_4 ),
inference(backward_demodulation,[],[f20,f57]) ).
tff(f57,plain,
( ( $false = bG0 )
| spl2_4 ),
inference(trivial_inequality_removal,[],[f54]) ).
tff(f54,plain,
( ( $true != $true )
| ( $false = bG0 )
| spl2_4 ),
inference(superposition,[],[f38,f4]) ).
tff(f4,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f38,plain,
( ( $true != bG0 )
| spl2_4 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f37,plain,
( spl2_4
<=> ( $true = bG0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
tff(f20,plain,
cP(bG0),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ~ cP(bG1)
& cP(bG0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( cP(bG0)
=> cP(bG1) ),
inference(fool_elimination,[],[f2,f6,f5]) ).
tff(f5,plain,
( ( cA
=> cB )
<=> ( $true = bG0 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).
tff(f6,plain,
( ( cB
| ~ cA )
<=> ( $true = bG1 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG1])]) ).
tff(f2,negated_conjecture,
~ ( cP(( cA
=> cB ))
=> cP(( cB
| ~ cA )) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( cP(( cA
=> cB ))
=> cP(( cB
| ~ cA )) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIVEXT5) ).
tff(f64,plain,
( ~ cP($false)
| spl2_2 ),
inference(backward_demodulation,[],[f21,f58]) ).
tff(f58,plain,
( ( $false = bG1 )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f52]) ).
tff(f52,plain,
( ( $true != $true )
| ( $false = bG1 )
| spl2_2 ),
inference(superposition,[],[f28,f4]) ).
tff(f28,plain,
( ( $true != bG1 )
| spl2_2 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f27,plain,
( spl2_2
<=> ( $true = bG1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f21,plain,
~ cP(bG1),
inference(cnf_transformation,[],[f9]) ).
tff(f49,plain,
( ~ spl2_1
| spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f48,f37,f32,f23]) ).
tff(f23,plain,
( spl2_1
<=> cA ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f32,plain,
( spl2_3
<=> cB ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
tff(f48,plain,
( cB
| ~ cA
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f47]) ).
tff(f47,plain,
( ( $true != $true )
| cB
| ~ cA
| ~ spl2_4 ),
inference(forward_demodulation,[],[f19,f39]) ).
tff(f39,plain,
( ( $true = bG0 )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f19,plain,
( cB
| ~ cA
| ( $true != bG0 ) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
( ( cB
| ~ cA
| ( $true != bG0 ) )
& ( ( $true = bG0 )
| ( ~ cB
& cA ) ) ),
inference(flattening,[],[f12]) ).
tff(f12,plain,
( ( cB
| ~ cA
| ( $true != bG0 ) )
& ( ( $true = bG0 )
| ( ~ cB
& cA ) ) ),
inference(nnf_transformation,[],[f8]) ).
tff(f8,plain,
( ( cB
| ~ cA )
<=> ( $true = bG0 ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f46,plain,
( ~ spl2_2
| ~ spl2_1
| spl2_3 ),
inference(avatar_split_clause,[],[f16,f32,f23,f27]) ).
tff(f16,plain,
( cB
| ~ cA
| ( $true != bG1 ) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ( cB
| ~ cA
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ( ~ cB
& cA ) ) ),
inference(flattening,[],[f10]) ).
tff(f10,plain,
( ( cB
| ~ cA
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ( ~ cB
& cA ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f45,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f44]) ).
tff(f44,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(resolution,[],[f43,f42]) ).
tff(f42,plain,
( ~ cP($true)
| ~ spl2_2 ),
inference(backward_demodulation,[],[f21,f29]) ).
tff(f29,plain,
( ( $true = bG1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f43,plain,
( cP($true)
| ~ spl2_4 ),
inference(backward_demodulation,[],[f20,f39]) ).
tff(f41,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f18,f37,f32]) ).
tff(f18,plain,
( ( $true = bG0 )
| ~ cB ),
inference(cnf_transformation,[],[f13]) ).
tff(f40,plain,
( spl2_1
| spl2_4 ),
inference(avatar_split_clause,[],[f17,f37,f23]) ).
tff(f17,plain,
( ( $true = bG0 )
| cA ),
inference(cnf_transformation,[],[f13]) ).
tff(f35,plain,
( ~ spl2_3
| spl2_2 ),
inference(avatar_split_clause,[],[f15,f27,f32]) ).
tff(f15,plain,
( ( $true = bG1 )
| ~ cB ),
inference(cnf_transformation,[],[f11]) ).
tff(f30,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f14,f27,f23]) ).
tff(f14,plain,
( ( $true = bG1 )
| cA ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYO369_8 : TPTP v8.2.0. Released v8.0.0.
% 0.09/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 10:14:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % (10011)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34 % (10018)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.11/0.34 % (10016)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.34 % (10014)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.11/0.34 % (10013)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34 % (10015)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.34 % (10012)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34 % (10017)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.34 Detected minimum model sizes of [1]
% 0.11/0.34 Detected minimum model sizes of [1]
% 0.11/0.34 Detected maximum model sizes of [4]
% 0.11/0.34 Detected minimum model sizes of [1]
% 0.11/0.34 Detected maximum model sizes of [4]
% 0.11/0.34 Detected minimum model sizes of [1]
% 0.11/0.34 Detected maximum model sizes of [4]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 Detected maximum model sizes of [4]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 % (10014)First to succeed.
% 0.11/0.34 % (10015)Also succeeded, but the first one will report.
% 0.11/0.34 % (10018)Also succeeded, but the first one will report.
% 0.11/0.34 % (10013)Also succeeded, but the first one will report.
% 0.11/0.34 % (10012)Also succeeded, but the first one will report.
% 0.11/0.34 % (10016)Also succeeded, but the first one will report.
% 0.11/0.34 % (10017)Also succeeded, but the first one will report.
% 0.11/0.34 % (10014)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10011"
% 0.11/0.34 % (10014)Refutation found. Thanks to Tanya!
% 0.11/0.34 % SZS status Theorem for theBenchmark
% 0.11/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.34 % (10014)------------------------------
% 0.11/0.34 % (10014)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.34 % (10014)Termination reason: Refutation
% 0.11/0.34
% 0.11/0.34 % (10014)Memory used [KB]: 752
% 0.11/0.34 % (10014)Time elapsed: 0.004 s
% 0.11/0.34 % (10014)Instructions burned: 4 (million)
% 0.11/0.34 % (10011)Success in time 0.017 s
%------------------------------------------------------------------------------