TSTP Solution File: NUM651^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM651^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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 01:44:12 EDT 2024
% Result : Theorem 0.24s 0.41s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 65 ( 13 unt; 9 typ; 0 def)
% Number of atoms : 141 ( 97 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 353 ( 92 ~; 44 |; 12 &; 176 @)
% ( 5 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 12 con; 0-2 aty)
% Number of variables : 64 ( 0 ^ 48 !; 16 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
pl: nat > nat > nat ).
thf(func_def_7,type,
sK0: nat ).
thf(func_def_8,type,
sK1: nat ).
thf(func_def_9,type,
sK2: nat ).
thf(func_def_10,type,
sK3: nat ).
thf(f138,plain,
$false,
inference(avatar_sat_refutation,[],[f48,f62,f67,f77,f128,f133,f137]) ).
thf(f137,plain,
( ~ spl4_1
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f136]) ).
thf(f136,plain,
( $false
| ~ spl4_1
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f135,f70]) ).
thf(f70,plain,
! [X0: nat,X1: nat] :
( ( pl @ X1 @ X0 )
!= X1 ),
inference(superposition,[],[f25,f27]) ).
thf(f27,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X1: nat,X0: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz6) ).
thf(f25,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
!= X1 ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
!= X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz7) ).
thf(f135,plain,
( ( x
= ( pl @ x @ sK1 ) )
| ~ spl4_1
| ~ spl4_4 ),
inference(forward_demodulation,[],[f56,f43]) ).
thf(f43,plain,
( ( x = y )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f41,plain,
( spl4_1
<=> ( x = y ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f56,plain,
( ( x
= ( pl @ y @ sK1 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl4_4
<=> ( x
= ( pl @ y @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f133,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f132]) ).
thf(f132,plain,
( $false
| ~ spl4_1
| ~ spl4_3 ),
inference(subsumption_resolution,[],[f131,f70]) ).
thf(f131,plain,
( ( x
= ( pl @ x @ sK0 ) )
| ~ spl4_1
| ~ spl4_3 ),
inference(forward_demodulation,[],[f52,f43]) ).
thf(f52,plain,
( ( y
= ( pl @ x @ sK0 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl4_3
<=> ( y
= ( pl @ x @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f128,plain,
( ~ spl4_2
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f127]) ).
thf(f127,plain,
( $false
| ~ spl4_2
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f124]) ).
thf(f124,plain,
( ( x != x )
| ~ spl4_2
| ~ spl4_5 ),
inference(superposition,[],[f118,f47]) ).
thf(f47,plain,
( ( x
= ( pl @ y @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl4_2
<=> ( x
= ( pl @ y @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f118,plain,
( ! [X0: nat] :
( x
!= ( pl @ y @ X0 ) )
| ~ spl4_5 ),
inference(superposition,[],[f112,f27]) ).
thf(f112,plain,
( ! [X0: nat] :
( x
!= ( pl @ X0 @ y ) )
| ~ spl4_5 ),
inference(superposition,[],[f91,f61]) ).
thf(f61,plain,
( ( y
= ( pl @ x @ sK2 ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl4_5
<=> ( y
= ( pl @ x @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
thf(f91,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( pl @ X2 @ ( pl @ X1 @ X0 ) )
!= X1 ),
inference(superposition,[],[f88,f27]) ).
thf(f88,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( pl @ X0 @ ( pl @ X1 @ X2 ) )
!= X2 ),
inference(superposition,[],[f25,f26]) ).
thf(f26,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( pl @ X1 @ ( pl @ X0 @ X2 ) )
= ( pl @ ( pl @ X1 @ X0 ) @ X2 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( pl @ X1 @ ( pl @ X0 @ X2 ) )
= ( pl @ ( pl @ X1 @ X0 ) @ X2 ) ),
inference(rectify,[],[f10]) ).
thf(f10,plain,
! [X1: nat,X0: nat,X2: nat] :
( ( pl @ X0 @ ( pl @ X1 @ X2 ) )
= ( pl @ ( pl @ X0 @ X1 ) @ X2 ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X0: nat,X1: nat,X3: nat] :
( ( pl @ ( pl @ X0 @ X1 ) @ X3 )
= ( pl @ X0 @ ( pl @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz5) ).
thf(f77,plain,
( ~ spl4_1
| ~ spl4_5 ),
inference(avatar_split_clause,[],[f73,f59,f41]) ).
thf(f73,plain,
( ( x != y )
| ~ spl4_5 ),
inference(superposition,[],[f70,f61]) ).
thf(f67,plain,
( spl4_5
| spl4_4
| spl4_3 ),
inference(avatar_split_clause,[],[f32,f50,f54,f59]) ).
thf(f32,plain,
( ( y
= ( pl @ x @ sK0 ) )
| ( y
= ( pl @ x @ sK2 ) )
| ( x
= ( pl @ y @ sK1 ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( ( x = y )
& ( y
= ( pl @ x @ sK0 ) ) )
| ( ( x
= ( pl @ y @ sK1 ) )
& ( x = y ) )
| ( ( y
= ( pl @ x @ sK2 ) )
& ( x
= ( pl @ y @ sK3 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f19,f23,f22,f21,f20]) ).
thf(f20,plain,
( ? [X0: nat] :
( y
= ( pl @ x @ X0 ) )
=> ( y
= ( pl @ x @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f21,plain,
( ? [X1: nat] :
( x
= ( pl @ y @ X1 ) )
=> ( x
= ( pl @ y @ sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f22,plain,
( ? [X2: nat] :
( y
= ( pl @ x @ X2 ) )
=> ( y
= ( pl @ x @ sK2 ) ) ),
introduced(choice_axiom,[]) ).
thf(f23,plain,
( ? [X3: nat] :
( x
= ( pl @ y @ X3 ) )
=> ( x
= ( pl @ y @ sK3 ) ) ),
introduced(choice_axiom,[]) ).
thf(f19,plain,
( ( ( x = y )
& ? [X0: nat] :
( y
= ( pl @ x @ X0 ) ) )
| ( ? [X1: nat] :
( x
= ( pl @ y @ X1 ) )
& ( x = y ) )
| ( ? [X2: nat] :
( y
= ( pl @ x @ X2 ) )
& ? [X3: nat] :
( x
= ( pl @ y @ X3 ) ) ) ),
inference(rectify,[],[f15]) ).
thf(f15,plain,
( ( ( x = y )
& ? [X3: nat] :
( y
= ( pl @ x @ X3 ) ) )
| ( ? [X0: nat] :
( x
= ( pl @ y @ X0 ) )
& ( x = y ) )
| ( ? [X2: nat] :
( y
= ( pl @ x @ X2 ) )
& ? [X1: nat] :
( x
= ( pl @ y @ X1 ) ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
( ( ( x = y )
& ? [X3: nat] :
( y
= ( pl @ x @ X3 ) ) )
| ( ? [X2: nat] :
( y
= ( pl @ x @ X2 ) )
& ? [X1: nat] :
( x
= ( pl @ y @ X1 ) ) )
| ( ? [X0: nat] :
( x
= ( pl @ y @ X0 ) )
& ( x = y ) ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( x = y )
=> ! [X0: nat] :
( x
!= ( pl @ y @ X0 ) ) )
=> ( ( ~ ! [X1: nat] :
( x
!= ( pl @ y @ X1 ) )
=> ! [X2: nat] :
( y
!= ( pl @ x @ X2 ) ) )
=> ~ ( ~ ! [X3: nat] :
( y
!= ( pl @ x @ X3 ) )
=> ( x != y ) ) ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
~ ~ ( ( ( x = y )
=> ~ ~ ! [X0: nat] :
( x
!= ( pl @ y @ X0 ) ) )
=> ~ ~ ( ( ~ ! [X1: nat] :
( x
!= ( pl @ y @ X1 ) )
=> ~ ~ ! [X2: nat] :
( y
!= ( pl @ x @ X2 ) ) )
=> ~ ( ~ ! [X3: nat] :
( y
!= ( pl @ x @ X3 ) )
=> ( x != y ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ~ ( ( ( x = y )
=> ~ ~ ! [X4: nat] :
( x
!= ( pl @ y @ X4 ) ) )
=> ~ ~ ( ( ~ ! [X4: nat] :
( x
!= ( pl @ y @ X4 ) )
=> ~ ~ ! [X4: nat] :
( y
!= ( pl @ x @ X4 ) ) )
=> ~ ( ~ ! [X4: nat] :
( y
!= ( pl @ x @ X4 ) )
=> ( x != y ) ) ) ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
~ ( ( ( x = y )
=> ~ ~ ! [X4: nat] :
( x
!= ( pl @ y @ X4 ) ) )
=> ~ ~ ( ( ~ ! [X4: nat] :
( x
!= ( pl @ y @ X4 ) )
=> ~ ~ ! [X4: nat] :
( y
!= ( pl @ x @ X4 ) ) )
=> ~ ( ~ ! [X4: nat] :
( y
!= ( pl @ x @ X4 ) )
=> ( x != y ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz9b) ).
thf(f62,plain,
( spl4_5
| spl4_1 ),
inference(avatar_split_clause,[],[f38,f41,f59]) ).
thf(f38,plain,
( ( y
= ( pl @ x @ sK2 ) )
| ( x = y ) ),
inference(duplicate_literal_removal,[],[f34]) ).
thf(f34,plain,
( ( y
= ( pl @ x @ sK2 ) )
| ( x = y )
| ( x = y ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f48,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f39,f45,f41]) ).
thf(f39,plain,
( ( x = y )
| ( x
= ( pl @ y @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f33]) ).
thf(f33,plain,
( ( x
= ( pl @ y @ sK3 ) )
| ( x = y )
| ( x = y ) ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM651^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.38 % Computer : n005.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 06:51:08 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.38 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/sandbox2/benchmark/theBenchmark.p
% 0.24/0.40 % (5955)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.24/0.40 % (5954)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.24/0.40 % (5957)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.24/0.40 % (5956)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.24/0.40 % (5958)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.24/0.40 % (5959)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.24/0.40 % (5960)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.24/0.40 % (5961)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.24/0.40 % (5957)Instruction limit reached!
% 0.24/0.40 % (5957)------------------------------
% 0.24/0.40 % (5957)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.40 % (5957)Termination reason: Unknown
% 0.24/0.40 % (5957)Termination phase: Saturation
% 0.24/0.40 % (5958)Instruction limit reached!
% 0.24/0.40 % (5958)------------------------------
% 0.24/0.40 % (5958)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.40 % (5958)Termination reason: Unknown
% 0.24/0.40 % (5958)Termination phase: Property scanning
% 0.24/0.40
% 0.24/0.40 % (5958)Memory used [KB]: 895
% 0.24/0.40 % (5958)Time elapsed: 0.003 s
% 0.24/0.40 % (5958)Instructions burned: 2 (million)
% 0.24/0.40 % (5958)------------------------------
% 0.24/0.40 % (5958)------------------------------
% 0.24/0.40
% 0.24/0.40 % (5957)Memory used [KB]: 895
% 0.24/0.40 % (5957)Time elapsed: 0.003 s
% 0.24/0.40 % (5957)Instructions burned: 2 (million)
% 0.24/0.40 % (5957)------------------------------
% 0.24/0.40 % (5957)------------------------------
% 0.24/0.40 % (5961)Instruction limit reached!
% 0.24/0.40 % (5961)------------------------------
% 0.24/0.40 % (5961)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.40 % (5961)Termination reason: Unknown
% 0.24/0.40 % (5961)Termination phase: Saturation
% 0.24/0.40
% 0.24/0.40 % (5961)Memory used [KB]: 5500
% 0.24/0.40 % (5961)Time elapsed: 0.003 s
% 0.24/0.40 % (5961)Instructions burned: 3 (million)
% 0.24/0.40 % (5961)------------------------------
% 0.24/0.40 % (5961)------------------------------
% 0.24/0.40 % (5955)Instruction limit reached!
% 0.24/0.40 % (5955)------------------------------
% 0.24/0.40 % (5955)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.40 % (5955)Termination reason: Unknown
% 0.24/0.40 % (5955)Termination phase: Saturation
% 0.24/0.40
% 0.24/0.40 % (5955)Memory used [KB]: 5500
% 0.24/0.40 % (5955)Time elapsed: 0.005 s
% 0.24/0.40 % (5955)Instructions burned: 5 (million)
% 0.24/0.40 % (5955)------------------------------
% 0.24/0.40 % (5955)------------------------------
% 0.24/0.41 % (5960)First to succeed.
% 0.24/0.41 % (5954)Also succeeded, but the first one will report.
% 0.24/0.41 % (5960)Refutation found. Thanks to Tanya!
% 0.24/0.41 % SZS status Theorem for theBenchmark
% 0.24/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.41 % (5960)------------------------------
% 0.24/0.41 % (5960)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (5960)Termination reason: Refutation
% 0.24/0.41
% 0.24/0.41 % (5960)Memory used [KB]: 5628
% 0.24/0.41 % (5960)Time elapsed: 0.013 s
% 0.24/0.41 % (5960)Instructions burned: 15 (million)
% 0.24/0.41 % (5960)------------------------------
% 0.24/0.41 % (5960)------------------------------
% 0.24/0.41 % (5953)Success in time 0.021 s
% 0.24/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------