TSTP Solution File: SYO021^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO021^1 : TPTP v8.2.0. Released v3.7.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 : n023.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:02:15 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 188 ( 77 equ)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 118 ( 51 ~; 36 |; 25 &)
% ( 4 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 163 ( 107 fml; 56 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 20 ( 10 !; 10 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(f35,plain,
$false,
inference(avatar_sat_refutation,[],[f31,f33,f34]) ).
tff(f34,plain,
spl2_2,
inference(avatar_split_clause,[],[f19,f27]) ).
tff(f27,plain,
( spl2_2
<=> ( $true = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f19,plain,
$true = sK0,
inference(duplicate_literal_removal,[],[f15]) ).
tff(f15,plain,
( ( $true = sK0 )
| ( $true = sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
( ( ( $true != sK1 )
| ( $true != sK0 )
| ( $true != sK0 )
| ( $true != sK1 ) )
& ( ( ( $true = sK1 )
& ( $true = sK0 ) )
| ( ( $true = sK0 )
& ( $true = sK1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f12]) ).
tff(f12,plain,
( ? [X0: $o,X1: $o] :
( ( ( $true != (X1) )
| ( $true != (X0) )
| ( $true != (X0) )
| ( $true != (X1) ) )
& ( ( ( $true = (X1) )
& ( $true = (X0) ) )
| ( ( $true = (X0) )
& ( $true = (X1) ) ) ) )
=> ( ( ( $true != sK1 )
| ( $true != sK0 )
| ( $true != sK0 )
| ( $true != sK1 ) )
& ( ( ( $true = sK1 )
& ( $true = sK0 ) )
| ( ( $true = sK0 )
& ( $true = sK1 ) ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
? [X0: $o,X1: $o] :
( ( ( $true != (X1) )
| ( $true != (X0) )
| ( $true != (X0) )
| ( $true != (X1) ) )
& ( ( ( $true = (X1) )
& ( $true = (X0) ) )
| ( ( $true = (X0) )
& ( $true = (X1) ) ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
? [X1: $o,X0: $o] :
( ( ( $true != (X0) )
| ( $true != (X1) )
| ( $true != (X1) )
| ( $true != (X0) ) )
& ( ( ( $true = (X0) )
& ( $true = (X1) ) )
| ( ( $true = (X1) )
& ( $true = (X0) ) ) ) ),
inference(flattening,[],[f9]) ).
tff(f9,plain,
? [X1: $o,X0: $o] :
( ( ( $true != (X0) )
| ( $true != (X1) )
| ( $true != (X1) )
| ( $true != (X0) ) )
& ( ( ( $true = (X0) )
& ( $true = (X1) ) )
| ( ( $true = (X1) )
& ( $true = (X0) ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
tff(f8,plain,
? [X1: $o,X0: $o] :
( ( ( $true = (X1) )
& ( $true = (X0) ) )
<~> ( ( $true = (X0) )
& ( $true = (X1) ) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ! [X0: $o,X1: $o] :
( ( ( $true = (X0) )
& ( $true = (X1) ) )
<=> ~ ( ( $true != (X0) )
| ( $true != (X1) ) ) ),
inference(flattening,[],[f6]) ).
tff(f6,plain,
~ ! [X0: $o,X1: $o] :
( ( ( $true = (X0) )
& ( $true = (X1) ) )
<=> ~ ( ( $true != (X0) )
| ( $true != (X1) ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ! [X0: $o,X1: $o] :
( (X1)
& ( (X0)
= ( ~ ( ~ (X0)
| ~ (X1) ) ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X1: $o,X0: $o] :
( (X0)
& ( (X1)
= ( ~ ( ~ (X1)
| ~ (X0) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X1: $o,X0: $o] :
( (X0)
& ( (X1)
= ( ~ ( ~ (X1)
| ~ (X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f33,plain,
spl2_1,
inference(avatar_split_clause,[],[f20,f23]) ).
tff(f23,plain,
( spl2_1
<=> ( $true = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f20,plain,
$true = sK1,
inference(duplicate_literal_removal,[],[f16]) ).
tff(f16,plain,
( ( $true = sK1 )
| ( $true = sK1 ) ),
inference(cnf_transformation,[],[f13]) ).
tff(f31,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f21,f27,f23]) ).
tff(f21,plain,
( ( $true != sK0 )
| ( $true != sK1 ) ),
inference(duplicate_literal_removal,[],[f18]) ).
tff(f18,plain,
( ( $true != sK1 )
| ( $true != sK1 )
| ( $true != sK0 )
| ( $true != sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO021^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n023.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 : Mon May 20 09:36:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.37 % (17609)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (17609)First to succeed.
% 0.14/0.37 % (17607)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.14/0.37 % (17608)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.14/0.37 % (17606)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.14/0.37 % (17610)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (17611)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.14/0.37 % (17612)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37 % (17613)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.37 % (17607)Also succeeded, but the first one will report.
% 0.14/0.37 % (17609)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (17609)------------------------------
% 0.14/0.37 % (17609)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (17609)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (17609)Memory used [KB]: 5500
% 0.14/0.37 % (17609)Time elapsed: 0.003 s
% 0.14/0.37 % (17609)Instructions burned: 1 (million)
% 0.14/0.37 % (17609)------------------------------
% 0.14/0.37 % (17609)------------------------------
% 0.14/0.37 % (17605)Success in time 0.004 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------