TSTP Solution File: ITP209^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ITP209^2 : TPTP v8.2.0. Released v8.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 : n010.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 : Mon May 20 22:34:50 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 37
% Syntax : Number of formulae : 65 ( 29 unt; 34 typ; 0 def)
% Number of atoms : 110 ( 52 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 336 ( 5 ~; 0 |; 6 &; 292 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 94 ( 94 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 32 usr; 6 con; 0-4 aty)
% ( 33 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 110 ( 43 ^ 37 !; 0 ?; 110 :)
% ( 30 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
syntax_ac_operator:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_2,type,
syntax7388354845996824322omatch:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).
thf(func_def_3,type,
syntax2379306206330768139omatch:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).
thf(func_def_4,type,
a2: a ).
thf(func_def_5,type,
b: a ).
thf(func_def_6,type,
c: a ).
thf(func_def_7,type,
f: a > a > a ).
thf(func_def_19,type,
sK0:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_20,type,
sK1:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_21,type,
sK2:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_22,type,
sK3:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_23,type,
sK4:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_25,type,
sK6:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_26,type,
sK7:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_27,type,
sK8:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_28,type,
sK9:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_29,type,
sK10:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_30,type,
sK11:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_31,type,
sK12:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_32,type,
sK13:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_33,type,
sK14:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_34,type,
sK15:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_35,type,
sK16:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_36,type,
sK17:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_37,type,
sK18:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_38,type,
sK19:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_39,type,
sK20:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_40,type,
sK21:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_41,type,
sK22:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_42,type,
sK23:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_43,type,
sK24:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_44,type,
sK25:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(f155,plain,
$false,
inference(subsumption_resolution,[],[f154,f138]) ).
thf(f138,plain,
! [X2: a,X3: a,X1: a] :
( ( f @ X3 @ ( f @ X2 @ X1 ) )
= ( f @ ( f @ X3 @ X2 ) @ X1 ) ),
inference(equality_proxy_clausification,[],[f137]) ).
thf(f137,plain,
! [X2: a,X3: a,X1: a] :
( ( ( f @ X3 @ ( f @ X2 @ X1 ) )
= ( f @ ( f @ X3 @ X2 ) @ X1 ) )
= $true ),
inference(beta_eta_normalization,[],[f136]) ).
thf(f136,plain,
! [X2: a,X3: a,X1: a] :
( ( ^ [Y0: a] :
( ( f @ Y0 @ ( f @ X2 @ X1 ) )
= ( f @ ( f @ Y0 @ X2 ) @ X1 ) )
@ X3 )
= $true ),
inference(pi_clausification,[],[f135]) ).
thf(f135,plain,
! [X2: a,X1: a] :
( ( !! @ a
@ ^ [Y0: a] :
( ( f @ Y0 @ ( f @ X2 @ X1 ) )
= ( f @ ( f @ Y0 @ X2 ) @ X1 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f134]) ).
thf(f134,plain,
! [X2: a,X1: a] :
( ( ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( ( f @ Y1 @ ( f @ Y0 @ X1 ) )
= ( f @ ( f @ Y1 @ Y0 ) @ X1 ) ) )
@ X2 )
= $true ),
inference(pi_clausification,[],[f133]) ).
thf(f133,plain,
! [X1: a] :
( ( !! @ a
@ ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( ( f @ Y1 @ ( f @ Y0 @ X1 ) )
= ( f @ ( f @ Y1 @ Y0 ) @ X1 ) ) ) )
= $true ),
inference(beta_eta_normalization,[],[f132]) ).
thf(f132,plain,
! [X1: a] :
( ( ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( !! @ a
@ ^ [Y2: a] :
( ( f @ Y2 @ ( f @ Y1 @ Y0 ) )
= ( f @ ( f @ Y2 @ Y1 ) @ Y0 ) ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f125]) ).
thf(f125,plain,
( ( !! @ a
@ ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( !! @ a
@ ^ [Y2: a] :
( ( f @ Y2 @ ( f @ Y1 @ Y0 ) )
= ( f @ ( f @ Y2 @ Y1 ) @ Y0 ) ) ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f124]) ).
thf(f124,plain,
( ( ( !! @ a
@ ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( ( f @ Y0 @ Y1 )
= ( f @ Y1 @ Y0 ) ) ) )
& ( !! @ a
@ ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( !! @ a
@ ^ [Y2: a] :
( ( f @ Y2 @ ( f @ Y1 @ Y0 ) )
= ( f @ ( f @ Y2 @ Y1 ) @ Y0 ) ) ) ) ) )
= $true ),
inference(beta_eta_normalization,[],[f65]) ).
thf(f65,plain,
( ( ^ [Y0: a > a > a] :
( ( !! @ a
@ ^ [Y1: a] :
( !! @ a
@ ^ [Y2: a] :
( ( Y0 @ Y1 @ Y2 )
= ( Y0 @ Y2 @ Y1 ) ) ) )
& ( !! @ a
@ ^ [Y1: a] :
( !! @ a
@ ^ [Y2: a] :
( !! @ a
@ ^ [Y3: a] :
( ( Y0 @ Y3 @ ( Y0 @ Y2 @ Y1 ) )
= ( Y0 @ ( Y0 @ Y3 @ Y2 ) @ Y1 ) ) ) ) ) )
@ f )
= $true ),
inference(definition_unfolding,[],[f58,f48]) ).
thf(f48,plain,
! [X0: $tType] :
( syntax_ac_operator
@ ( X0
= ( ^ [Y0: X0 > X0 > X0] :
( ( !! @ X0
@ ^ [Y1: X0] :
( !! @ X0
@ ^ [Y2: X0] :
( ( Y0 @ Y1 @ Y2 )
= ( Y0 @ Y2 @ Y1 ) ) ) )
& ( !! @ X0
@ ^ [Y1: X0] :
( !! @ X0
@ ^ [Y2: X0] :
( !! @ X0
@ ^ [Y3: X0] :
( ( Y0 @ Y3 @ ( Y0 @ Y2 @ Y1 ) )
= ( Y0 @ ( Y0 @ Y3 @ Y2 ) @ Y1 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f33,plain,
! [X0: $tType] :
( syntax_ac_operator
@ ( X0
= ( ^ [Y0: X0 > X0 > X0] :
( ( !! @ X0
@ ^ [Y1: X0] :
( !! @ X0
@ ^ [Y2: X0] :
( ( Y0 @ Y1 @ Y2 )
= ( Y0 @ Y2 @ Y1 ) ) ) )
& ( !! @ X0
@ ^ [Y1: X0] :
( !! @ X0
@ ^ [Y2: X0] :
( !! @ X0
@ ^ [Y3: X0] :
( ( Y0 @ Y3 @ ( Y0 @ Y2 @ Y1 ) )
= ( Y0 @ ( Y0 @ Y3 @ Y2 ) @ Y1 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f32]) ).
thf(f32,plain,
! [X0: $tType] :
( ( ( ^ [X1: X0 > X0 > X0] :
( ! [X2: X0,X3: X0,X4: X0] :
( ( X1 @ X2 @ ( X1 @ X3 @ X4 ) )
= ( X1 @ ( X1 @ X2 @ X3 ) @ X4 ) )
& ! [X5: X0,X6: X0] :
( ( X1 @ X6 @ X5 )
= ( X1 @ X5 @ X6 ) ) ) )
= syntax_ac_operator )
@ X0 ),
inference(rectify,[],[f12]) ).
thf(f12,axiom,
! [X0: $tType] :
( ( ( ^ [X11: X0 > X0 > X0] :
( ! [X12: X0,X13: X0,X14: X0] :
( ( X11 @ ( X11 @ X12 @ X13 ) @ X14 )
= ( X11 @ X12 @ ( X11 @ X13 @ X14 ) ) )
& ! [X12: X0,X13: X0] :
( ( X11 @ X12 @ X13 )
= ( X11 @ X13 @ X12 ) ) ) )
= syntax_ac_operator )
@ X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_11_ac__operator__def) ).
thf(f58,plain,
( ( syntax_ac_operator @ a @ f )
= $true ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
( ( syntax_ac_operator @ a @ f )
= $true ),
inference(fool_elimination,[],[f28]) ).
thf(f28,plain,
syntax_ac_operator @ a @ f,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
syntax_ac_operator @ a @ f,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_ac__operator__axioms) ).
thf(f154,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ a2 @ ( f @ b @ c ) ) ),
inference(forward_demodulation,[],[f153,f131]) ).
thf(f131,plain,
! [X2: a,X1: a] :
( ( f @ X2 @ X1 )
= ( f @ X1 @ X2 ) ),
inference(equality_proxy_clausification,[],[f130]) ).
thf(f130,plain,
! [X2: a,X1: a] :
( ( ( f @ X1 @ X2 )
= ( f @ X2 @ X1 ) )
= $true ),
inference(beta_eta_normalization,[],[f129]) ).
thf(f129,plain,
! [X2: a,X1: a] :
( ( ^ [Y0: a] :
( ( f @ X1 @ Y0 )
= ( f @ Y0 @ X1 ) )
@ X2 )
= $true ),
inference(pi_clausification,[],[f128]) ).
thf(f128,plain,
! [X1: a] :
( ( !! @ a
@ ^ [Y0: a] :
( ( f @ X1 @ Y0 )
= ( f @ Y0 @ X1 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f127]) ).
thf(f127,plain,
! [X1: a] :
( ( ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( ( f @ Y0 @ Y1 )
= ( f @ Y1 @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f126]) ).
thf(f126,plain,
( ( !! @ a
@ ^ [Y0: a] :
( !! @ a
@ ^ [Y1: a] :
( ( f @ Y0 @ Y1 )
= ( f @ Y1 @ Y0 ) ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f124]) ).
thf(f153,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ a2 @ ( f @ c @ b ) ) ),
inference(forward_demodulation,[],[f49,f138]) ).
thf(f49,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(cnf_transformation,[],[f34]) ).
thf(f34,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(flattening,[],[f14]) ).
thf(f14,negated_conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(negated_conjecture,[],[f13]) ).
thf(f13,conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
= ( f @ ( f @ a2 @ c ) @ b ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ITP209^2 : TPTP v8.2.0. Released v8.0.0.
% 0.10/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.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 18:19:52 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH1_THM_EQU_NAR problem
% 0.15/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.15/0.36 % (26916)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.37 % (26916)First to succeed.
% 0.15/0.37 % (26910)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.15/0.37 % (26912)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.15/0.37 % (26911)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.15/0.37 % (26913)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37 % (26914)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.15/0.37 % (26915)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.15/0.37 % (26916)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37 % (26916)------------------------------
% 0.15/0.37 % (26916)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (26916)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (26916)Memory used [KB]: 5628
% 0.15/0.37 % (26916)Time elapsed: 0.006 s
% 0.15/0.37 % (26916)Instructions burned: 12 (million)
% 0.15/0.37 % (26916)------------------------------
% 0.15/0.37 % (26916)------------------------------
% 0.15/0.37 % (26909)Success in time 0.004 s
% 0.15/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------