TSTP Solution File: NUM662^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM662^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 : n006.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:22 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 20 unt; 8 typ; 0 def)
% Number of atoms : 24 ( 23 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 91 ( 15 ~; 0 |; 0 &; 74 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 ^ 18 !; 4 ?; 22 :)
% 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,
z: nat ).
thf(func_def_4,type,
pl: nat > nat > nat ).
thf(func_def_8,type,
sK0: nat ).
thf(func_def_9,type,
sK1: nat ).
thf(f32,plain,
$false,
inference(equality_resolution,[],[f30]) ).
thf(f30,plain,
! [X0: nat] :
( ( pl @ x @ X0 )
!= ( pl @ x @ ( pl @ sK0 @ sK1 ) ) ),
inference(superposition,[],[f27,f23]) ).
thf(f23,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( pl @ ( pl @ X0 @ X1 ) @ X2 )
= ( pl @ X0 @ ( pl @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( pl @ ( pl @ X0 @ X1 ) @ X2 )
= ( pl @ X0 @ ( pl @ X1 @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X1: nat,X3: nat,X4: nat] :
( ( pl @ ( pl @ X1 @ X3 ) @ X4 )
= ( pl @ X1 @ ( pl @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz5) ).
thf(f27,plain,
! [X0: nat] :
( ( pl @ x @ X0 )
!= ( pl @ ( pl @ x @ sK0 ) @ sK1 ) ),
inference(definition_unfolding,[],[f21,f26]) ).
thf(f26,plain,
( z
= ( pl @ ( pl @ x @ sK0 ) @ sK1 ) ),
inference(definition_unfolding,[],[f24,f22]) ).
thf(f22,plain,
( y
= ( pl @ x @ sK0 ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( y
= ( pl @ x @ sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f16,f17]) ).
thf(f17,plain,
( ? [X0: nat] :
( y
= ( pl @ x @ X0 ) )
=> ( y
= ( pl @ x @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f16,plain,
? [X0: nat] :
( y
= ( pl @ x @ X0 ) ),
inference(ennf_transformation,[],[f1]) ).
thf(f1,axiom,
~ ! [X0: nat] :
( y
!= ( pl @ x @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(f24,plain,
( z
= ( pl @ y @ sK1 ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f20,plain,
( z
= ( pl @ y @ sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f19]) ).
thf(f19,plain,
( ? [X0: nat] :
( z
= ( pl @ y @ X0 ) )
=> ( z
= ( pl @ y @ sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
? [X0: nat] :
( z
= ( pl @ y @ X0 ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f12,plain,
~ ! [X0: nat] :
( z
!= ( pl @ y @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
~ ! [X1: nat] :
( z
!= ( pl @ y @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
thf(f21,plain,
! [X0: nat] :
( ( pl @ x @ X0 )
!= z ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: nat] :
( ( pl @ x @ X0 )
!= z ),
inference(flattening,[],[f6]) ).
thf(f6,negated_conjecture,
~ ~ ! [X0: nat] :
( ( pl @ x @ X0 )
!= z ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
~ ! [X0: nat] :
( ( pl @ x @ X0 )
!= z ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz15) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM662^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/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.15/0.38 % Computer : n006.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon May 20 03:41:53 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.15/0.38 This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.39 % (7543)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.39 % (7539)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.15/0.40 % (7542)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.15/0.40 % (7540)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.40 % (7543)First to succeed.
% 0.15/0.40 % (7540)Instruction limit reached!
% 0.15/0.40 % (7540)------------------------------
% 0.15/0.40 % (7540)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (7540)Termination reason: Unknown
% 0.15/0.40 % (7540)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (7540)Memory used [KB]: 5373
% 0.15/0.40 % (7540)Time elapsed: 0.002 s
% 0.15/0.40 % (7540)Instructions burned: 2 (million)
% 0.15/0.40 % (7540)------------------------------
% 0.15/0.40 % (7540)------------------------------
% 0.15/0.40 % (7538)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.15/0.40 % (7541)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.15/0.40 % (7542)Also succeeded, but the first one will report.
% 0.15/0.40 % (7539)Also succeeded, but the first one will report.
% 0.15/0.40 % (7541)Instruction limit reached!
% 0.15/0.40 % (7541)------------------------------
% 0.15/0.40 % (7541)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (7541)Termination reason: Unknown
% 0.15/0.40 % (7541)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (7541)Memory used [KB]: 895
% 0.15/0.40 % (7541)Time elapsed: 0.002 s
% 0.15/0.40 % (7541)Instructions burned: 2 (million)
% 0.15/0.40 % (7541)------------------------------
% 0.15/0.40 % (7541)------------------------------
% 0.15/0.40 % (7543)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40 % (7543)------------------------------
% 0.15/0.40 % (7543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (7543)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (7543)Memory used [KB]: 5500
% 0.15/0.40 % (7543)Time elapsed: 0.004 s
% 0.15/0.40 % (7543)Instructions burned: 2 (million)
% 0.15/0.40 % (7543)------------------------------
% 0.15/0.40 % (7543)------------------------------
% 0.15/0.40 % (7536)Success in time 0.004 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------