TSTP Solution File: PUZ137_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ137_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n029.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 02:28:50 EDT 2024
% Result : Theorem 0.48s 0.70s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 61 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 292 ( 47 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 122 ( 52 ~; 46 |; 9 &)
% ( 9 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 211 ( 169 fml; 42 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 14 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 23 ( 18 !; 5 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_3,type,
bG0: $o > $o ).
tff(func_def_4,type,
bG1: $o ).
tff(func_def_5,type,
bG2: $o > $o ).
tff(func_def_6,type,
sK3: $o ).
tff(func_def_7,type,
sK4: $o ).
tff(pred_def_1,type,
says: ( $i * $o ) > $o ).
tff(f103,plain,
$false,
inference(avatar_sat_refutation,[],[f44,f49,f54,f77,f102]) ).
tff(f102,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_contradiction_clause,[],[f101]) ).
tff(f101,plain,
( $false
| ~ spl5_1
| spl5_2 ),
inference(subsumption_resolution,[],[f97,f100]) ).
tff(f100,plain,
( says(peter,$true)
| ~ spl5_1 ),
inference(backward_demodulation,[],[f25,f38]) ).
tff(f38,plain,
( ( $true = bG1 )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f37,plain,
( spl5_1
<=> ( $true = bG1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
tff(f25,plain,
says(peter,bG1),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
says(peter,bG1),
inference(fool_elimination,[],[f6,f8,f7]) ).
tff(f7,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG0((X0)) ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).
tff(f8,plain,
( ! [X0: $o] :
( says(peter,bG0((X0)))
=> ( $true != (X0) ) )
<=> ( $true = bG1 ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG1])]) ).
tff(f6,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(f97,plain,
( ~ says(peter,$true)
| spl5_2 ),
inference(forward_demodulation,[],[f43,f35]) ).
tff(f35,plain,
$true = bG0($true),
inference(equality_resolution,[],[f31]) ).
tff(f31,plain,
! [X0: $o] :
( ( $true = bG0((X0)) )
| ( $true != (X0) ) ),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
! [X0: $o] :
( ( ( $true = (X0) )
| ( $true != bG0((X0)) ) )
& ( ( $true = bG0((X0)) )
| ( $true != (X0) ) ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f43,plain,
( ~ says(peter,bG0($true))
| spl5_2 ),
inference(avatar_component_clause,[],[f41]) ).
tff(f41,plain,
( spl5_2
<=> says(peter,bG0($true)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
tff(f77,plain,
( spl5_1
| ~ spl5_3
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f76]) ).
tff(f76,plain,
( $false
| spl5_1
| ~ spl5_3
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f75,f56]) ).
tff(f56,plain,
( says(peter,$true)
| ~ spl5_3
| ~ spl5_4 ),
inference(forward_demodulation,[],[f55,f35]) ).
tff(f55,plain,
( says(peter,bG0($true))
| ~ spl5_3
| ~ spl5_4 ),
inference(backward_demodulation,[],[f53,f48]) ).
tff(f48,plain,
( ( $true = sK4 )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f46]) ).
tff(f46,plain,
( spl5_3
<=> ( $true = sK4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f53,plain,
( says(peter,bG0(sK4))
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f51]) ).
tff(f51,plain,
( spl5_4
<=> says(peter,bG0(sK4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
tff(f75,plain,
( ~ says(peter,$true)
| spl5_1 ),
inference(backward_demodulation,[],[f24,f74]) ).
tff(f74,plain,
( ( $true = bG2(sK3) )
| spl5_1 ),
inference(subsumption_resolution,[],[f65,f73]) ).
tff(f73,plain,
( says(peter,$false)
| spl5_1 ),
inference(subsumption_resolution,[],[f64,f39]) ).
tff(f39,plain,
( ( $true != bG1 )
| spl5_1 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f64,plain,
( says(peter,$false)
| ( $true = bG1 ) ),
inference(superposition,[],[f25,f5]) ).
tff(f5,plain,
! [X0: $o] :
( ( $false = (X0) )
| ( $true = (X0) ) ),
introduced(fool_axiom,[]) ).
tff(f65,plain,
( ~ says(peter,$false)
| ( $true = bG2(sK3) ) ),
inference(superposition,[],[f24,f5]) ).
tff(f24,plain,
~ says(peter,bG2(sK3)),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
~ says(peter,bG2(sK3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f14,f16]) ).
tff(f16,plain,
( ? [X0: $o] : ~ says(peter,bG2((X0)))
=> ~ says(peter,bG2(sK3)) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
? [X0: $o] : ~ says(peter,bG2((X0))),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
~ ! [X0: $o] : says(peter,bG2((X0))),
inference(fool_elimination,[],[f10,f11]) ).
tff(f11,plain,
! [X0: $o] :
( ( $true = (X0) )
<=> ( $true = bG2((X0)) ) ),
introduced(fool_formula_definition,[new_symbols(definition,[bG2])]) ).
tff(f10,plain,
~ ! [X0: $o] : says(peter,(X0)),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ! [X0: $o] : says(peter,(X0)),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
! [X0: $o] : says(peter,(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
tff(f54,plain,
( spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f26,f37,f51]) ).
tff(f26,plain,
( ( $true = bG1 )
| says(peter,bG0(sK4)) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0))) )
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ( ( $true = sK4 )
& says(peter,bG0(sK4)) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f19,f20]) ).
tff(f20,plain,
( ? [X1: $o] :
( ( $true = (X1) )
& says(peter,bG0((X1))) )
=> ( ( $true = sK4 )
& says(peter,bG0(sK4)) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
( ( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0))) )
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ? [X1: $o] :
( ( $true = (X1) )
& says(peter,bG0((X1))) ) ) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
( ( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0))) )
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ? [X0: $o] :
( ( $true = (X0) )
& says(peter,bG0((X0))) ) ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f15,plain,
( ! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0))) )
<=> ( $true = bG1 ) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
( ! [X0: $o] :
( says(peter,bG0((X0)))
=> ( $true != (X0) ) )
<=> ( $true = bG1 ) ),
inference(flattening,[],[f8]) ).
tff(f49,plain,
( spl5_3
| spl5_1 ),
inference(avatar_split_clause,[],[f27,f37,f46]) ).
tff(f27,plain,
( ( $true = bG1 )
| ( $true = sK4 ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f44,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f33,f41,f37]) ).
tff(f33,plain,
( ~ says(peter,bG0($true))
| ( $true != bG1 ) ),
inference(equality_resolution,[],[f28]) ).
tff(f28,plain,
! [X0: $o] :
( ( $true != (X0) )
| ~ says(peter,bG0((X0)))
| ( $true != bG1 ) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : PUZ137_8 : TPTP v8.2.0. Released v8.0.0.
% 0.09/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat May 18 10:54:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TX0_THM_NEQ_NAR problem
% 0.13/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.70 % (3636)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.48/0.70 % (3637)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.48/0.70 % (3638)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.48/0.70 % (3639)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.48/0.70 % (3640)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.48/0.70 % (3641)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.48/0.70 % (3634)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.48/0.70 % (3639)Refutation not found, incomplete strategy% (3639)------------------------------
% 0.48/0.70 % (3639)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.70 % (3641)Refutation not found, incomplete strategy% (3641)------------------------------
% 0.48/0.70 % (3641)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.70 % (3641)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.70
% 0.48/0.70 % (3641)Memory used [KB]: 946
% 0.48/0.70 % (3641)Time elapsed: 0.002 s
% 0.48/0.70 % (3641)Instructions burned: 2 (million)
% 0.48/0.70 % (3639)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.70
% 0.48/0.70 % (3637)Refutation not found, incomplete strategy% (3637)------------------------------
% 0.48/0.70 % (3637)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.70 % (3639)Memory used [KB]: 946
% 0.48/0.70 % (3639)Time elapsed: 0.002 s
% 0.48/0.70 % (3639)Instructions burned: 2 (million)
% 0.48/0.70 % (3637)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.70
% 0.48/0.70 % (3637)Memory used [KB]: 964
% 0.48/0.70 % (3638)Refutation not found, incomplete strategy% (3638)------------------------------
% 0.48/0.70 % (3638)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.70 % (3637)Time elapsed: 0.002 s
% 0.48/0.70 % (3637)Instructions burned: 2 (million)
% 0.48/0.70 % (3638)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.70
% 0.48/0.70 % (3638)Memory used [KB]: 954
% 0.48/0.70 % (3638)Time elapsed: 0.002 s
% 0.48/0.70 % (3638)Instructions burned: 2 (million)
% 0.48/0.70 % (3641)------------------------------
% 0.48/0.70 % (3641)------------------------------
% 0.48/0.70 % (3639)------------------------------
% 0.48/0.70 % (3639)------------------------------
% 0.48/0.70 % (3637)------------------------------
% 0.48/0.70 % (3637)------------------------------
% 0.48/0.70 % (3636)First to succeed.
% 0.48/0.70 % (3638)------------------------------
% 0.48/0.70 % (3638)------------------------------
% 0.48/0.70 % (3640)Also succeeded, but the first one will report.
% 0.48/0.70 % (3636)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3633"
% 0.48/0.70 % (3634)Refutation not found, incomplete strategy% (3634)------------------------------
% 0.48/0.70 % (3634)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.70 % (3634)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.70
% 0.48/0.70 % (3634)Memory used [KB]: 971
% 0.48/0.70 % (3634)Time elapsed: 0.003 s
% 0.48/0.70 % (3634)Instructions burned: 2 (million)
% 0.48/0.70 % (3636)Refutation found. Thanks to Tanya!
% 0.48/0.70 % SZS status Theorem for theBenchmark
% 0.48/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.48/0.70 % (3636)------------------------------
% 0.48/0.70 % (3636)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.70 % (3636)Termination reason: Refutation
% 0.48/0.70
% 0.48/0.70 % (3636)Memory used [KB]: 994
% 0.48/0.70 % (3636)Time elapsed: 0.003 s
% 0.48/0.70 % (3636)Instructions burned: 5 (million)
% 0.48/0.70 % (3633)Success in time 0.358 s
% 0.48/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------