TSTP Solution File: SEU891^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU891^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 : n015.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:52:05 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 47 ( 1 unt; 10 typ; 0 def)
% Number of atoms : 208 ( 85 equ; 0 cnn)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 230 ( 44 ~; 44 |; 36 &; 95 @)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 36 ( 0 ^ 11 !; 25 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
cF: b > a ).
thf(func_def_3,type,
cS: b > $o ).
thf(func_def_4,type,
cR: b > $o ).
thf(func_def_8,type,
sK0: a ).
thf(func_def_9,type,
sK1: b ).
thf(func_def_10,type,
sK2: b ).
thf(f46,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f31,f36,f37,f41,f45]) ).
thf(f45,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f44]) ).
thf(f44,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f43,f35]) ).
thf(f35,plain,
( ( sK0
= ( cF @ sK2 ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f33,plain,
( spl3_4
<=> ( sK0
= ( cF @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f43,plain,
( ( sK0
!= ( cF @ sK2 ) )
| ~ spl3_1 ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f42,plain,
( ( $true != $true )
| ( sK0
!= ( cF @ sK2 ) )
| ~ spl3_1 ),
inference(superposition,[],[f13,f21]) ).
thf(f21,plain,
( ( $true
= ( cS @ sK2 ) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl3_1
<=> ( $true
= ( cS @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f13,plain,
! [X3: b] :
( ( $true
!= ( cS @ X3 ) )
| ( ( cF @ X3 )
!= sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( ( ( sK0
= ( cF @ sK1 ) )
& ( $true
= ( cR @ sK1 ) ) )
| ( ( $true
= ( cS @ sK2 ) )
& ( sK0
= ( cF @ sK2 ) ) ) )
& ! [X3: b] :
( ( ( $true
!= ( cS @ X3 ) )
& ( $true
!= ( cR @ X3 ) ) )
| ( ( cF @ X3 )
!= sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: a] :
( ( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( ( cR @ X1 )
= $true ) )
| ? [X2: b] :
( ( $true
= ( cS @ X2 ) )
& ( ( cF @ X2 )
= X0 ) ) )
& ! [X3: b] :
( ( ( $true
!= ( cS @ X3 ) )
& ( $true
!= ( cR @ X3 ) ) )
| ( ( cF @ X3 )
!= X0 ) ) )
=> ( ( ? [X1: b] :
( ( ( cF @ X1 )
= sK0 )
& ( ( cR @ X1 )
= $true ) )
| ? [X2: b] :
( ( $true
= ( cS @ X2 ) )
& ( ( cF @ X2 )
= sK0 ) ) )
& ! [X3: b] :
( ( ( $true
!= ( cS @ X3 ) )
& ( $true
!= ( cR @ X3 ) ) )
| ( ( cF @ X3 )
!= sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X1: b] :
( ( ( cF @ X1 )
= sK0 )
& ( ( cR @ X1 )
= $true ) )
=> ( ( sK0
= ( cF @ sK1 ) )
& ( $true
= ( cR @ sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X2: b] :
( ( $true
= ( cS @ X2 ) )
& ( ( cF @ X2 )
= sK0 ) )
=> ( ( $true
= ( cS @ sK2 ) )
& ( sK0
= ( cF @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a] :
( ( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( ( cR @ X1 )
= $true ) )
| ? [X2: b] :
( ( $true
= ( cS @ X2 ) )
& ( ( cF @ X2 )
= X0 ) ) )
& ! [X3: b] :
( ( ( $true
!= ( cS @ X3 ) )
& ( $true
!= ( cR @ X3 ) ) )
| ( ( cF @ X3 )
!= X0 ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ( ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( $true
= ( cR @ X2 ) ) )
| ? [X1: b] :
( ( ( cS @ X1 )
= $true )
& ( ( cF @ X1 )
= X0 ) ) )
& ! [X3: b] :
( ( ( $true
!= ( cS @ X3 ) )
& ( $true
!= ( cR @ X3 ) ) )
| ( ( cF @ X3 )
!= X0 ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ( ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( $true
= ( cR @ X2 ) ) )
| ? [X1: b] :
( ( ( cS @ X1 )
= $true )
& ( ( cF @ X1 )
= X0 ) ) )
=> ? [X3: b] :
( ( ( $true
= ( cS @ X3 ) )
| ( $true
= ( cR @ X3 ) ) )
& ( ( cF @ X3 )
= X0 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ? [X1: b] :
( ( cS @ X1 )
& ( ( cF @ X1 )
= X0 ) )
| ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( cR @ X2 ) ) )
=> ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cS @ X3 )
| ( cR @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ? [X1: b] :
( ( cS @ X1 )
& ( ( cF @ X1 )
= X0 ) )
| ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( cR @ X1 ) ) )
=> ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( ( cS @ X1 )
| ( cR @ X1 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ( ? [X1: b] :
( ( cS @ X1 )
& ( ( cF @ X1 )
= X0 ) )
| ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( cR @ X1 ) ) )
=> ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( ( cS @ X1 )
| ( cR @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM34B_pme) ).
thf(f41,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f40]) ).
thf(f40,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f39,f30]) ).
thf(f30,plain,
( ( sK0
= ( cF @ sK1 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f28,plain,
( spl3_3
<=> ( sK0
= ( cF @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f39,plain,
( ( sK0
!= ( cF @ sK1 ) )
| ~ spl3_2 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ( sK0
!= ( cF @ sK1 ) )
| ~ spl3_2 ),
inference(superposition,[],[f12,f25]) ).
thf(f25,plain,
( ( $true
= ( cR @ sK1 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f23,plain,
( spl3_2
<=> ( $true
= ( cR @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f12,plain,
! [X3: b] :
( ( $true
!= ( cR @ X3 ) )
| ( ( cF @ X3 )
!= sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f37,plain,
( spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f16,f28,f33]) ).
thf(f16,plain,
( ( sK0
= ( cF @ sK1 ) )
| ( sK0
= ( cF @ sK2 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f36,plain,
( spl3_4
| spl3_2 ),
inference(avatar_split_clause,[],[f14,f23,f33]) ).
thf(f14,plain,
( ( sK0
= ( cF @ sK2 ) )
| ( $true
= ( cR @ sK1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f31,plain,
( spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f17,f28,f19]) ).
thf(f17,plain,
( ( $true
= ( cS @ sK2 ) )
| ( sK0
= ( cF @ sK1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f26,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f15,f23,f19]) ).
thf(f15,plain,
( ( $true
= ( cS @ sK2 ) )
| ( $true
= ( cR @ sK1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU891^5 : TPTP v8.2.0. Released v4.0.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 : n015.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 : Sun May 19 17:45:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 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.21/0.39 % (14918)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 (2999ds/275Mi)
% 0.21/0.39 % (14916)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.39 % (14920)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.39 % (14917)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 (2999ds/2Mi)
% 0.21/0.39 % (14919)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.39 % (14914)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 (2999ds/4Mi)
% 0.21/0.39 % (14915)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 (2999ds/27Mi)
% 0.21/0.39 % (14913)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.39 % (14917)Instruction limit reached!
% 0.21/0.39 % (14917)------------------------------
% 0.21/0.39 % (14917)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (14917)Termination reason: Unknown
% 0.21/0.39 % (14917)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (14917)Memory used [KB]: 895
% 0.21/0.39 % (14917)Time elapsed: 0.005 s
% 0.21/0.39 % (14917)Instructions burned: 2 (million)
% 0.21/0.39 % (14917)------------------------------
% 0.21/0.39 % (14917)------------------------------
% 0.21/0.39 % (14916)Instruction limit reached!
% 0.21/0.39 % (14916)------------------------------
% 0.21/0.39 % (14916)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (14916)Termination reason: Unknown
% 0.21/0.39 % (14916)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (14916)Memory used [KB]: 5500
% 0.21/0.39 % (14916)Time elapsed: 0.006 s
% 0.21/0.39 % (14916)Instructions burned: 2 (million)
% 0.21/0.39 % (14916)------------------------------
% 0.21/0.39 % (14916)------------------------------
% 0.21/0.40 % (14913)First to succeed.
% 0.21/0.40 % (14920)Instruction limit reached!
% 0.21/0.40 % (14920)------------------------------
% 0.21/0.40 % (14920)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (14920)Termination reason: Unknown
% 0.21/0.40 % (14920)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (14920)Memory used [KB]: 5500
% 0.21/0.40 % (14920)Time elapsed: 0.007 s
% 0.21/0.40 % (14920)Instructions burned: 3 (million)
% 0.21/0.40 % (14920)------------------------------
% 0.21/0.40 % (14920)------------------------------
% 0.21/0.40 % (14918)Also succeeded, but the first one will report.
% 0.21/0.40 % (14914)Also succeeded, but the first one will report.
% 0.21/0.40 % (14913)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40 % (14913)------------------------------
% 0.21/0.40 % (14913)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (14913)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (14913)Memory used [KB]: 5500
% 0.21/0.40 % (14913)Time elapsed: 0.008 s
% 0.21/0.40 % (14913)Instructions burned: 2 (million)
% 0.21/0.40 % (14913)------------------------------
% 0.21/0.40 % (14913)------------------------------
% 0.21/0.40 % (14912)Success in time 0.02 s
% 0.21/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------