TSTP Solution File: PUZ082_8 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PUZ082_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n026.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 : Sun May 5 08:50:31 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 235 ( 53 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 88 ( 39 ~; 24 |; 10 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 205 ( 151 fml; 54 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 25 ( 22 !; 3 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_3,type,
bG0: $o > $o ).
tff(func_def_4,type,
bG1: $o > $o ).
tff(func_def_5,type,
bG2: $o ).
tff(func_def_6,type,
sK3: $o ).
tff(pred_def_1,type,
says: ( $i * $o ) > $o ).
tff(f55,plain,
$false,
inference(subsumption_resolution,[],[f54,f36]) ).
tff(f36,plain,
~ says(peter,$true),
inference(backward_demodulation,[],[f35,f34]) ).
tff(f34,plain,
$true = bG0($true),
inference(equality_resolution,[],[f28]) ).
tff(f28,plain,
! [X0: $o] :
( ( $true = bG0((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG0((X0)) ) )
& ( ( $true = bG0((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f7,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG0((X0)) ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).
tff(f35,plain,
~ says(peter,bG0($true)),
inference(equality_resolution,[],[f30]) ).
tff(f30,plain,
! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0))) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0))) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,plain,
! [X0: $o] :
( says(peter,bG0((X0)))
=> ( $true != (X0) ) ),
inference(flattening,[],[f8]) ).
tff(f8,plain,
~ ~ ! [X0: $o] :
( says(peter,bG0((X0)))
=> ( $true != (X0) ) ),
inference(fool_elimination,[],[f6,f7]) ).
tff(f6,plain,
~ ~ ! [X0: $o] :
( says(peter,(X0))
=> ~ (X0) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ~ ! [X0: $o] :
( says(peter,(X0))
=> ~ (X0) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
~ ! [X0: $o] :
( says(peter,(X0))
=> ~ (X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
tff(f54,plain,
says(peter,$true),
inference(forward_demodulation,[],[f53,f33]) ).
tff(f33,plain,
$true = bG1($true),
inference(equality_resolution,[],[f26]) ).
tff(f26,plain,
! [X0: $o] :
( ( $true = bG1((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG1((X0)) ) )
& ( ( $true = bG1((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f10]) ).
tff(f10,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG1((X0)) ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG1])]) ).
tff(f53,plain,
says(peter,bG1($true)),
inference(forward_demodulation,[],[f52,f50]) ).
tff(f50,plain,
$true = sK3,
inference(trivial_inequality_removal,[],[f49]) ).
tff(f49,plain,
( ( $true = $false )
| ( $true = sK3 ) ),
inference(forward_demodulation,[],[f24,f44]) ).
tff(f44,plain,
$false = bG2,
inference(subsumption_resolution,[],[f42,f36]) ).
tff(f42,plain,
( says(peter,$true)
| ( $false = bG2 ) ),
inference(superposition,[],[f31,f5]) ).
tff(f5,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f31,plain,
says(peter,bG2),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
says(peter,bG2),
inference(fool_elimination,[],[f9,f11,f10]) ).
tff(f11,plain,
( ! [X0: $o] :
( says(peter,bG1((X0)))
=> ( $true != (X0) ) )
<=> ( $true = bG2 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG2])]) ).
tff(f9,plain,
says(peter,
! [X0: $o] :
( says(peter,(X0))
=> ~ (X0) )),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
says(peter,
! [X0: $o] :
( says(peter,(X0))
=> ~ (X0) )),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(f24,plain,
( ( $true = bG2 )
| ( $true = sK3 ) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
( ( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG1((X0))) )
| ( $true != bG2 ) )
& ( ( $true = bG2 )
| ( ( $true = sK3 )
& says(peter,bG1(sK3)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f18,f19]) ).
tff(f19,plain,
( ? [X1: $o] :
( ( $true = (X1) )
& says(peter,bG1((X1))) )
=> ( ( $true = sK3 )
& says(peter,bG1(sK3)) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
( ( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG1((X0))) )
| ( $true != bG2 ) )
& ( ( $true = bG2 )
| ? [X1: $o] :
( ( $true = (X1) )
& says(peter,bG1((X1))) ) ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
( ( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG1((X0))) )
| ( $true != bG2 ) )
& ( ( $true = bG2 )
| ? [X0: $o] :
( ( $true = (X0) )
& says(peter,bG1((X0))) ) ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f15,plain,
( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG1((X0))) )
<=> ( $true = bG2 ) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
( ! [X0: $o] :
( says(peter,bG1((X0)))
=> ( $true != (X0) ) )
<=> ( $true = bG2 ) ),
inference(flattening,[],[f11]) ).
tff(f52,plain,
says(peter,bG1(sK3)),
inference(trivial_inequality_removal,[],[f51]) ).
tff(f51,plain,
( ( $true = $false )
| says(peter,bG1(sK3)) ),
inference(forward_demodulation,[],[f23,f44]) ).
tff(f23,plain,
( ( $true = bG2 )
| says(peter,bG1(sK3)) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ082_8 : TPTP v8.1.2. Released v8.0.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 18:04:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (13727)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (13731)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37 Detected minimum model sizes of [1,1]
% 0.14/0.37 Detected maximum model sizes of [1,2]
% 0.14/0.37 TRYING [1,1]
% 0.14/0.37 TRYING [1,2]
% 0.14/0.37 Cannot enumerate next child to try in an incomplete setup
% 0.14/0.37 % (13731)Refutation not found, incomplete strategy% (13731)------------------------------
% 0.14/0.37 % (13731)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.37 % (13731)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37 % (13731)Memory used [KB]: 730
% 0.14/0.37 % (13731)Time elapsed: 0.003 s
% 0.14/0.37 % (13731)Instructions burned: 4 (million)
% 0.14/0.37 % (13731)------------------------------
% 0.14/0.37 % (13731)------------------------------
% 0.14/0.37 % (13730)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.14/0.37 % (13732)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (13733)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (13729)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (13734)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.14/0.37 % (13728)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38 Detected minimum model sizes of [1,1]
% 0.14/0.38 Detected maximum model sizes of [1,2]
% 0.14/0.38 Detected minimum model sizes of [1,1]
% 0.14/0.38 Detected maximum model sizes of [1,2]
% 0.14/0.38 Detected minimum model sizes of [1,1]
% 0.14/0.38 Detected maximum model sizes of [1,2]
% 0.14/0.38 TRYING [1,1]
% 0.14/0.38 TRYING [1,1]
% 0.14/0.38 TRYING [1,1]
% 0.14/0.38 TRYING [1,2]
% 0.14/0.38 TRYING [1,2]
% 0.14/0.38 TRYING [1,2]
% 0.14/0.38 % (13733)Also succeeded, but the first one will report.
% 0.14/0.38 % (13732)First to succeed.
% 0.14/0.38 Cannot enumerate next child to try in an incomplete setup
% 0.14/0.38 Cannot enumerate next child to try in an incomplete setup
% 0.14/0.38 % (13734)Refutation not found, incomplete strategy% (13734)------------------------------
% 0.14/0.38 % (13734)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (13730)Also succeeded, but the first one will report.
% 0.14/0.38 % (13734)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38 % (13734)Memory used [KB]: 730
% 0.14/0.38 % (13734)Time elapsed: 0.003 s
% 0.14/0.38 % (13734)Instructions burned: 3 (million)
% 0.14/0.38 % (13728)Refutation not found, incomplete strategy% (13728)------------------------------
% 0.14/0.38 % (13728)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (13728)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38 % (13728)Memory used [KB]: 729
% 0.14/0.38 % (13728)Time elapsed: 0.003 s
% 0.14/0.38 Cannot enumerate next child to try in an incomplete setup
% 0.14/0.38 % (13728)Instructions burned: 3 (million)
% 0.14/0.38 % (13729)Refutation not found, incomplete strategy% (13729)------------------------------
% 0.14/0.38 % (13729)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (13729)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38 % (13729)Memory used [KB]: 730
% 0.14/0.38 % (13729)Time elapsed: 0.004 s
% 0.14/0.38 % (13729)Instructions burned: 4 (million)
% 0.14/0.38 % (13734)------------------------------
% 0.14/0.38 % (13734)------------------------------
% 0.14/0.38 % (13728)------------------------------
% 0.14/0.38 % (13728)------------------------------
% 0.14/0.38 % (13729)------------------------------
% 0.14/0.38 % (13729)------------------------------
% 0.14/0.38 % (13732)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13727"
% 0.14/0.38 % (13732)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (13732)------------------------------
% 0.14/0.38 % (13732)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (13732)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (13732)Memory used [KB]: 746
% 0.14/0.38 % (13732)Time elapsed: 0.004 s
% 0.14/0.38 % (13732)Instructions burned: 4 (million)
% 0.14/0.38 % (13727)Success in time 0.018 s
%------------------------------------------------------------------------------