TSTP Solution File: SYO087^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO087^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 : n017.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:16 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 231 ( 62 equ)
% Maximal formula atoms : 10 ( 9 avg)
% Number of connectives : 142 ( 59 ~; 25 |; 48 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 124 ( 124 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 5 usr; 7 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 2 ( 0 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
cR: $o ).
tff(func_def_1,type,
cQ: $o ).
tff(func_def_2,type,
cP: $o ).
tff(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f26]) ).
tff(f26,plain,
~ sP1,
inference(subsumption_resolution,[],[f15,f19]) ).
tff(f19,plain,
cP != $true,
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
( ( cR != $true )
& ( ( ( cQ != $true )
& ( cP != $true ) )
| sP1 )
& ( ( ( cR = $true )
& ( cQ != $true ) )
| sP0 )
& ( cP != $true ) ),
inference(definition_folding,[],[f9,f11,f10]) ).
tff(f10,plain,
( ( ( cR != $true )
& ( cQ = $true ) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f11,plain,
( ( ( cQ = $true )
& ( cP = $true ) )
| ~ sP1 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
tff(f9,plain,
( ( cR != $true )
& ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
& ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) ),
inference(flattening,[],[f8]) ).
tff(f8,plain,
( ( cR != $true )
& ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
& ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( ( ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) )
=> ( ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
=> ( cR = $true ) ) ),
inference(flattening,[],[f6]) ).
tff(f6,plain,
~ ( ( ( ( ( cR = $true )
& ( cQ != $true ) )
| ( ( cR != $true )
& ( cQ = $true ) ) )
& ( cP != $true ) )
=> ( ( ( ( cQ != $true )
& ( cP != $true ) )
| ( ( cQ = $true )
& ( cP = $true ) ) )
=> ( cR = $true ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X0] :
( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X0] :
( ( ( ( cR
& ~ cQ )
| ( ~ cR
& cQ ) )
& ~ cP )
=> ( ( ( ~ cQ
& ~ cP )
| ( cQ
& cP ) )
=> cR ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50_13) ).
tff(f15,plain,
( ( cP = $true )
| ~ sP1 ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
( ( ( cQ = $true )
& ( cP = $true ) )
| ~ sP1 ),
inference(nnf_transformation,[],[f11]) ).
tff(f31,plain,
sP1,
inference(trivial_inequality_removal,[],[f28]) ).
tff(f28,plain,
( ( $true != $true )
| sP1 ),
inference(backward_demodulation,[],[f23,f27]) ).
tff(f27,plain,
cQ = $true,
inference(subsumption_resolution,[],[f17,f25]) ).
tff(f25,plain,
sP0,
inference(subsumption_resolution,[],[f21,f24]) ).
tff(f24,plain,
cR != $true,
inference(cnf_transformation,[],[f12]) ).
tff(f21,plain,
( ( cR = $true )
| sP0 ),
inference(cnf_transformation,[],[f12]) ).
tff(f17,plain,
( ( cQ = $true )
| ~ sP0 ),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
( ( ( cR != $true )
& ( cQ = $true ) )
| ~ sP0 ),
inference(nnf_transformation,[],[f10]) ).
tff(f23,plain,
( ( cQ != $true )
| sP1 ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYO087^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:00:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (26412)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (26417)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38 % (26413)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38 % (26416)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.38 % (26414)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (26418)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38 % (26415)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.38 % (26417)First to succeed.
% 0.15/0.38 % (26419)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.38 Detected minimum model sizes of [1]
% 0.15/0.38 Detected maximum model sizes of [5]
% 0.15/0.38 % (26417)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26412"
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 Detected minimum model sizes of [1]
% 0.15/0.38 Detected maximum model sizes of [5]
% 0.15/0.38 Detected minimum model sizes of [1]
% 0.15/0.38 Detected maximum model sizes of [5]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 Detected minimum model sizes of [1]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 % (26418)Also succeeded, but the first one will report.
% 0.15/0.38 Detected maximum model sizes of [5]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [5]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 TRYING [4]
% 0.15/0.38 % (26415)Also succeeded, but the first one will report.
% 0.15/0.38 % (26413)Also succeeded, but the first one will report.
% 0.15/0.38 TRYING [4]
% 0.15/0.38 % (26417)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 % (26417)------------------------------
% 0.15/0.38 % (26417)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (26417)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (26417)Memory used [KB]: 740
% 0.15/0.38 % (26417)Time elapsed: 0.003 s
% 0.15/0.38 % (26417)Instructions burned: 3 (million)
% 0.15/0.38 % (26412)Success in time 0.017 s
%------------------------------------------------------------------------------