TSTP Solution File: SET630^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET630^5 : TPTP v8.2.0. Released v4.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 : n025.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 03:12:33 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 23 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 121 ( 48 equ; 0 cnn)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 154 ( 33 ~; 12 |; 40 &; 66 @)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 ^ 10 !; 14 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a ).
thf(f29,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f26,f28]) ).
thf(f28,plain,
spl3_2,
inference(avatar_split_clause,[],[f16,f22]) ).
thf(f22,plain,
( spl3_2
<=> ( ( sK1 @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f16,plain,
( ( sK1 @ sK2 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( sK1 @ sK2 )
= $true )
& ( ( sK0 @ sK2 )
= $true )
& ( ( ( ( sK1 @ sK2 )
!= $true )
& ( ( sK0 @ sK2 )
= $true ) )
| ( ( ( sK0 @ sK2 )
!= $true )
& ( ( sK1 @ sK2 )
= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true )
& ( ( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) ) )
=> ( ( ( sK1 @ sK2 )
= $true )
& ( ( sK0 @ sK2 )
= $true )
& ( ( ( ( sK1 @ sK2 )
!= $true )
& ( ( sK0 @ sK2 )
= $true ) )
| ( ( ( sK0 @ sK2 )
!= $true )
& ( ( sK1 @ sK2 )
= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true )
& ( ( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true )
& ( ( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a > $o,X1: a > $o] :
~ ? [X2: a] :
( ( ( X1 @ X2 )
= $true )
& ( ( X0 @ X2 )
= $true )
& ( ( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
~ ? [X2: a] :
( ( ( ( ( X1 @ X2 )
!= $true )
& ( ( X0 @ X2 )
= $true ) )
| ( ( ( X0 @ X2 )
!= $true )
& ( ( X1 @ X2 )
= $true ) ) )
& ( ( X0 @ X2 )
= $true )
& ( ( X1 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
~ ? [X2: a] :
( ( ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) )
| ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) ) )
& ( X0 @ X2 )
& ( X1 @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
~ ? [X2: a] :
( ( ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) )
& ( X1 @ X2 )
& ( X0 @ X2 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
~ ? [X2: a] :
( ( ( ~ ( X0 @ X2 )
& ( X1 @ X2 ) )
| ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) )
& ( X1 @ X2 )
& ( X0 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_112_pme) ).
thf(f26,plain,
spl3_1,
inference(avatar_split_clause,[],[f15,f18]) ).
thf(f18,plain,
( spl3_1
<=> ( ( sK0 @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f15,plain,
( ( sK0 @ sK2 )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f25,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f14,f22,f18]) ).
thf(f14,plain,
( ( ( sK0 @ sK2 )
!= $true )
| ( ( sK1 @ sK2 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET630^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 12:31:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34 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 % (697)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.13/0.36 % (698)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.13/0.36 % (698)First to succeed.
% 0.13/0.36 % (697)Instruction limit reached!
% 0.13/0.36 % (697)------------------------------
% 0.13/0.36 % (697)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (697)Termination reason: Unknown
% 0.13/0.36 % (697)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (697)Memory used [KB]: 5500
% 0.13/0.36 % (697)Time elapsed: 0.003 s
% 0.13/0.36 % (697)Instructions burned: 2 (million)
% 0.13/0.36 % (697)------------------------------
% 0.13/0.36 % (697)------------------------------
% 0.13/0.36 % (700)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.13/0.36 % (698)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 % (698)------------------------------
% 0.13/0.36 % (698)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (698)Termination reason: Refutation
% 0.13/0.36
% 0.13/0.36 % (698)Memory used [KB]: 5500
% 0.13/0.36 % (698)Time elapsed: 0.003 s
% 0.13/0.36 % (698)Instructions burned: 1 (million)
% 0.13/0.36 % (698)------------------------------
% 0.13/0.36 % (698)------------------------------
% 0.13/0.36 % (692)Success in time 0.014 s
% 0.13/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------