TSTP Solution File: SYO019^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO019^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 : n014.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:14 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 185 ( 74 equ)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 121 ( 51 ~; 36 |; 25 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 160 ( 104 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,[],[f30,f32,f34]) ).
tff(f34,plain,
spl2_1,
inference(avatar_split_clause,[],[f19,f23]) ).
tff(f23,plain,
( spl2_1
<=> ( $true = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f19,plain,
$true = sK1,
inference(duplicate_literal_removal,[],[f14]) ).
tff(f14,plain,
( ( $true = sK1 )
| ( $true = sK1 ) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
( ( ( $true != sK0 )
| ( $true != sK1 )
| ( $true != sK0 )
| ( $true != sK1 ) )
& ( ( ( $true = sK0 )
& ( $true = sK1 ) )
| ( ( $true = sK0 )
& ( $true = sK1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f12]) ).
tff(f12,plain,
( ? [X0: $o,X1: $o] :
( ( ( $true != (X0) )
| ( $true != (X1) )
| ( $true != (X0) )
| ( $true != (X1) ) )
& ( ( ( $true = (X0) )
& ( $true = (X1) ) )
| ( ( $true = (X0) )
& ( $true = (X1) ) ) ) )
=> ( ( ( $true != sK0 )
| ( $true != sK1 )
| ( $true != sK0 )
| ( $true != sK1 ) )
& ( ( ( $true = sK0 )
& ( $true = sK1 ) )
| ( ( $true = sK0 )
& ( $true = sK1 ) ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
? [X0: $o,X1: $o] :
( ( ( $true != (X0) )
| ( $true != (X1) )
| ( $true != (X0) )
| ( $true != (X1) ) )
& ( ( ( $true = (X0) )
& ( $true = (X1) ) )
| ( ( $true = (X0) )
& ( $true = (X1) ) ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
? [X1: $o,X0: $o] :
( ( ( $true != (X1) )
| ( $true != (X0) )
| ( $true != (X1) )
| ( $true != (X0) ) )
& ( ( ( $true = (X1) )
& ( $true = (X0) ) )
| ( ( $true = (X1) )
& ( $true = (X0) ) ) ) ),
inference(flattening,[],[f9]) ).
tff(f9,plain,
? [X1: $o,X0: $o] :
( ( ( $true != (X1) )
| ( $true != (X0) )
| ( $true != (X1) )
| ( $true != (X0) ) )
& ( ( ( $true = (X1) )
& ( $true = (X0) ) )
| ( ( $true = (X1) )
& ( $true = (X0) ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
tff(f8,plain,
? [X1: $o,X0: $o] :
( ( ( $true = (X1) )
& ( $true = (X0) ) )
<~> ( ( $true = (X1) )
& ( $true = (X0) ) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ! [X0: $o,X1: $o] :
( ( ( $true = (X1) )
& ( $true = (X0) ) )
<=> ~ ( ( $true != (X1) )
| ( $true != (X0) ) ) ),
inference(flattening,[],[f6]) ).
tff(f6,plain,
~ ! [X0: $o,X1: $o] :
( ~ ( ( $true != (X1) )
| ( $true != (X0) ) )
<=> ( ( $true = (X1) )
& ( $true = (X0) ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ! [X0: $o,X1: $o] :
( ~ ( ~ (X1)
| ~ (X0) )
<=> ( (X1)
& (X0) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X1: $o,X0: $o] :
( ~ ( ~ (X0)
| ~ (X1) )
<=> ( (X0)
& (X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X1: $o,X0: $o] :
( ~ ( ~ (X0)
| ~ (X1) )
<=> ( (X0)
& (X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f32,plain,
spl2_2,
inference(avatar_split_clause,[],[f20,f27]) ).
tff(f27,plain,
( spl2_2
<=> ( $true = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f20,plain,
$true = sK0,
inference(duplicate_literal_removal,[],[f17]) ).
tff(f17,plain,
( ( $true = sK0 )
| ( $true = sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
tff(f30,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f21,f27,f23]) ).
tff(f21,plain,
( ( $true != sK1 )
| ( $true != sK0 ) ),
inference(duplicate_literal_removal,[],[f18]) ).
tff(f18,plain,
( ( $true != sK1 )
| ( $true != sK0 )
| ( $true != sK1 )
| ( $true != sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO019^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.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 09:07:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/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.13/0.36 % (22044)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.13/0.36 % (22044)First to succeed.
% 0.13/0.36 % (22044)Refutation found. Thanks to Tanya!
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36 % (22044)------------------------------
% 0.13/0.36 % (22044)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (22044)Termination reason: Refutation
% 0.13/0.36
% 0.13/0.36 % (22044)Memory used [KB]: 5500
% 0.13/0.36 % (22044)Time elapsed: 0.002 s
% 0.13/0.36 % (22044)------------------------------
% 0.13/0.36 % (22044)------------------------------
% 0.13/0.37 % (22043)Success in time 0.001 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------