TSTP Solution File: SEV196^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV196^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.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 04:12:20 EDT 2024
% Result : Theorem 0.22s 0.38s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 226 ( 135 equ; 0 cnn)
% Maximal formula atoms : 22 ( 9 avg)
% Number of connectives : 551 ( 81 ~; 68 |; 49 &; 342 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 11 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-3 aty)
% Number of variables : 140 ( 0 ^ 107 !; 33 ?; 140 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
y: a ).
thf(func_def_2,type,
x: a ).
thf(func_def_3,type,
cP: a > a > a ).
thf(func_def_4,type,
c0: a ).
thf(func_def_8,type,
sK0: a > a > a > $o ).
thf(f25,plain,
$false,
inference(subsumption_resolution,[],[f24,f21]) ).
thf(f21,plain,
! [X2: a] :
( ( sK0 @ c0 @ X2 @ X2 )
= $true ),
inference(equality_resolution,[],[f20]) ).
thf(f20,plain,
! [X2: a,X1: a] :
( ( X1 != X2 )
| ( ( sK0 @ c0 @ X1 @ X2 )
= $true ) ),
inference(equality_resolution,[],[f11]) ).
thf(f11,plain,
! [X2: a,X3: a,X1: a] :
( ( c0 != X3 )
| ( X1 != X2 )
| ( ( sK0 @ X3 @ X1 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( $true
!= ( sK0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) )
& ! [X1: a,X2: a,X3: a] :
( ( ! [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( cP @ X8 @ X7 )
!= X3 )
| ( ( cP @ X6 @ X5 )
!= X2 )
| ( $true
!= ( sK0 @ X7 @ X9 @ X5 ) )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( sK0 @ X8 @ X4 @ X6 ) ) )
& ( ( X2 != X3 )
| ( c0 != X1 ) )
& ( ( c0 != X3 )
| ( X1 != X2 ) ) )
| ( ( sK0 @ X3 @ X1 @ X2 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X0: a > a > a > $o] :
( ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
!= $true )
& ! [X1: a,X2: a,X3: a] :
( ( ! [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( cP @ X8 @ X7 )
!= X3 )
| ( ( cP @ X6 @ X5 )
!= X2 )
| ( ( X0 @ X7 @ X9 @ X5 )
!= $true )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( X0 @ X8 @ X4 @ X6 ) ) )
& ( ( X2 != X3 )
| ( c0 != X1 ) )
& ( ( c0 != X3 )
| ( X1 != X2 ) ) )
| ( $true
= ( X0 @ X3 @ X1 @ X2 ) ) ) )
=> ( ( $true
!= ( sK0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) )
& ! [X3: a,X2: a,X1: a] :
( ( ! [X9: a,X8: a,X7: a,X6: a,X5: a,X4: a] :
( ( ( cP @ X8 @ X7 )
!= X3 )
| ( ( cP @ X6 @ X5 )
!= X2 )
| ( $true
!= ( sK0 @ X7 @ X9 @ X5 ) )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( sK0 @ X8 @ X4 @ X6 ) ) )
& ( ( X2 != X3 )
| ( c0 != X1 ) )
& ( ( c0 != X3 )
| ( X1 != X2 ) ) )
| ( ( sK0 @ X3 @ X1 @ X2 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > a > a > $o] :
( ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
!= $true )
& ! [X1: a,X2: a,X3: a] :
( ( ! [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( cP @ X8 @ X7 )
!= X3 )
| ( ( cP @ X6 @ X5 )
!= X2 )
| ( ( X0 @ X7 @ X9 @ X5 )
!= $true )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( X0 @ X8 @ X4 @ X6 ) ) )
& ( ( X2 != X3 )
| ( c0 != X1 ) )
& ( ( c0 != X3 )
| ( X1 != X2 ) ) )
| ( $true
= ( X0 @ X3 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > a > a > $o] :
( ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
!= $true )
& ! [X2: a,X3: a,X1: a] :
( ( ! [X5: a,X4: a,X9: a,X7: a,X8: a,X6: a] :
( ( ( cP @ X8 @ X7 )
!= X1 )
| ( ( cP @ X9 @ X4 )
!= X3 )
| ( $true
!= ( X0 @ X7 @ X6 @ X4 ) )
| ( ( cP @ X5 @ X6 )
!= X2 )
| ( $true
!= ( X0 @ X8 @ X5 @ X9 ) ) )
& ( ( X1 != X3 )
| ( c0 != X2 ) )
& ( ( c0 != X1 )
| ( X2 != X3 ) ) )
| ( ( X0 @ X1 @ X2 @ X3 )
= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a > a > a > $o] :
( ! [X3: a,X1: a,X2: a] :
( ( ? [X8: a,X4: a,X9: a,X5: a,X7: a,X6: a] :
( ( ( cP @ X8 @ X7 )
= X1 )
& ( $true
= ( X0 @ X8 @ X5 @ X9 ) )
& ( $true
= ( X0 @ X7 @ X6 @ X4 ) )
& ( ( cP @ X5 @ X6 )
= X2 )
& ( ( cP @ X9 @ X4 )
= X3 ) )
| ( ( X2 = X3 )
& ( c0 = X1 ) )
| ( ( c0 = X2 )
& ( X1 = X3 ) ) )
=> ( ( X0 @ X1 @ X2 @ X3 )
= $true ) )
=> ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
= $true ) ),
inference(true_and_false_elimination,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > a > $o] :
( ( $true
& ! [X3: a,X1: a,X2: a] :
( ( ? [X8: a,X4: a,X9: a,X5: a,X7: a,X6: a] :
( ( ( cP @ X8 @ X7 )
= X1 )
& ( $true
= ( X0 @ X8 @ X5 @ X9 ) )
& ( $true
= ( X0 @ X7 @ X6 @ X4 ) )
& ( ( cP @ X5 @ X6 )
= X2 )
& ( ( cP @ X9 @ X4 )
= X3 ) )
| ( ( X2 = X3 )
& ( c0 = X1 ) )
| ( ( c0 = X2 )
& ( X1 = X3 ) ) )
=> ( ( X0 @ X1 @ X2 @ X3 )
= $true ) ) )
=> ( ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > a > $o] :
( ( $true
& ! [X1: a,X2: a,X3: a] :
( ( ( ( X1 = X3 )
& ( c0 = X2 ) )
| ( ( c0 = X1 )
& ( X2 = X3 ) )
| ? [X4: a,X5: a,X6: a,X7: a,X8: a,X9: a] :
( ( ( cP @ X9 @ X4 )
= X3 )
& ( X0 @ X7 @ X6 @ X4 )
& ( X0 @ X8 @ X5 @ X9 )
& ( ( cP @ X5 @ X6 )
= X2 )
& ( ( cP @ X8 @ X7 )
= X1 ) ) )
=> ( X0 @ X1 @ X2 @ X3 ) ) )
=> ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > a > $o] :
( ( $true
& ! [X1: a,X2: a,X3: a] :
( ( ( ( X1 = X3 )
& ( c0 = X2 ) )
| ( ( c0 = X1 )
& ( X2 = X3 ) )
| ? [X9: a,X6: a,X7: a,X5: a,X4: a,X8: a] :
( ( ( cP @ X8 @ X9 )
= X3 )
& ( X0 @ X5 @ X7 @ X9 )
& ( X0 @ X4 @ X6 @ X8 )
& ( ( cP @ X6 @ X7 )
= X2 )
& ( ( cP @ X4 @ X5 )
= X1 ) ) )
=> ( X0 @ X1 @ X2 @ X3 ) ) )
=> ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > a > $o] :
( ( $true
& ! [X1: a,X2: a,X3: a] :
( ( ( ( X1 = X3 )
& ( c0 = X2 ) )
| ( ( c0 = X1 )
& ( X2 = X3 ) )
| ? [X9: a,X6: a,X7: a,X5: a,X4: a,X8: a] :
( ( ( cP @ X8 @ X9 )
= X3 )
& ( X0 @ X5 @ X7 @ X9 )
& ( X0 @ X4 @ X6 @ X8 )
& ( ( cP @ X6 @ X7 )
= X2 )
& ( ( cP @ X4 @ X5 )
= X1 ) ) )
=> ( X0 @ X1 @ X2 @ X3 ) ) )
=> ( X0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_JOIN_LEM2_pme) ).
thf(f24,plain,
( ( sK0 @ c0 @ y @ y )
!= $true ),
inference(subsumption_resolution,[],[f23,f19]) ).
thf(f19,plain,
! [X3: a] :
( $true
= ( sK0 @ X3 @ c0 @ X3 ) ),
inference(equality_resolution,[],[f18]) ).
thf(f18,plain,
! [X3: a,X1: a] :
( ( c0 != X1 )
| ( ( sK0 @ X3 @ X1 @ X3 )
= $true ) ),
inference(equality_resolution,[],[f12]) ).
thf(f12,plain,
! [X2: a,X3: a,X1: a] :
( ( X2 != X3 )
| ( c0 != X1 )
| ( ( sK0 @ X3 @ X1 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f23,plain,
( ( ( sK0 @ x @ c0 @ x )
!= $true )
| ( ( sK0 @ c0 @ y @ y )
!= $true ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
( ( ( sK0 @ c0 @ y @ y )
!= $true )
| ( ( sK0 @ x @ c0 @ x )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f14,f17]) ).
thf(f17,plain,
! [X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( ( sK0 @ ( cP @ X8 @ X7 ) @ ( cP @ X4 @ X9 ) @ ( cP @ X6 @ X5 ) )
= $true )
| ( $true
!= ( sK0 @ X7 @ X9 @ X5 ) )
| ( $true
!= ( sK0 @ X8 @ X4 @ X6 ) ) ),
inference(equality_resolution,[],[f16]) ).
thf(f16,plain,
! [X1: a,X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( $true
!= ( sK0 @ X7 @ X9 @ X5 ) )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( sK0 @ X8 @ X4 @ X6 ) )
| ( ( sK0 @ ( cP @ X8 @ X7 ) @ X1 @ ( cP @ X6 @ X5 ) )
= $true ) ),
inference(equality_resolution,[],[f15]) ).
thf(f15,plain,
! [X2: a,X1: a,X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( ( cP @ X6 @ X5 )
!= X2 )
| ( $true
!= ( sK0 @ X7 @ X9 @ X5 ) )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( sK0 @ X8 @ X4 @ X6 ) )
| ( $true
= ( sK0 @ ( cP @ X8 @ X7 ) @ X1 @ X2 ) ) ),
inference(equality_resolution,[],[f13]) ).
thf(f13,plain,
! [X2: a,X3: a,X1: a,X8: a,X6: a,X9: a,X7: a,X4: a,X5: a] :
( ( ( cP @ X8 @ X7 )
!= X3 )
| ( ( cP @ X6 @ X5 )
!= X2 )
| ( $true
!= ( sK0 @ X7 @ X9 @ X5 ) )
| ( ( cP @ X4 @ X9 )
!= X1 )
| ( $true
!= ( sK0 @ X8 @ X4 @ X6 ) )
| ( ( sK0 @ X3 @ X1 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f14,plain,
( $true
!= ( sK0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEV196^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % 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.14/0.35 % Computer : n020.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 18:51:53 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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.38 % (8334)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.22/0.38 % (8331)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.22/0.38 % (8333)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.38 % (8332)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.22/0.38 % (8335)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.22/0.38 % (8336)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.38 % (8330)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.22/0.38 % (8337)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.22/0.38 % (8333)Instruction limit reached!
% 0.22/0.38 % (8333)------------------------------
% 0.22/0.38 % (8333)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (8333)Termination reason: Unknown
% 0.22/0.38 % (8333)Termination phase: Property scanning
% 0.22/0.38 % (8334)Instruction limit reached!
% 0.22/0.38 % (8334)------------------------------
% 0.22/0.38 % (8334)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (8334)Termination reason: Unknown
% 0.22/0.38 % (8334)Termination phase: Property scanning
% 0.22/0.38
% 0.22/0.38 % (8334)Memory used [KB]: 1023
% 0.22/0.38 % (8334)Time elapsed: 0.003 s
% 0.22/0.38 % (8334)Instructions burned: 2 (million)
% 0.22/0.38 % (8334)------------------------------
% 0.22/0.38 % (8334)------------------------------
% 0.22/0.38
% 0.22/0.38 % (8333)Memory used [KB]: 895
% 0.22/0.38 % (8333)Time elapsed: 0.003 s
% 0.22/0.38 % (8333)Instructions burned: 2 (million)
% 0.22/0.38 % (8333)------------------------------
% 0.22/0.38 % (8333)------------------------------
% 0.22/0.38 % (8337)Instruction limit reached!
% 0.22/0.38 % (8337)------------------------------
% 0.22/0.38 % (8337)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (8337)Termination reason: Unknown
% 0.22/0.38 % (8337)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (8337)Memory used [KB]: 5500
% 0.22/0.38 % (8337)Time elapsed: 0.004 s
% 0.22/0.38 % (8337)Instructions burned: 3 (million)
% 0.22/0.38 % (8337)------------------------------
% 0.22/0.38 % (8337)------------------------------
% 0.22/0.38 % (8335)First to succeed.
% 0.22/0.38 % (8331)Instruction limit reached!
% 0.22/0.38 % (8331)------------------------------
% 0.22/0.38 % (8331)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (8331)Termination reason: Unknown
% 0.22/0.38 % (8331)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (8331)Memory used [KB]: 5500
% 0.22/0.38 % (8331)Time elapsed: 0.006 s
% 0.22/0.38 % (8331)Instructions burned: 5 (million)
% 0.22/0.38 % (8331)------------------------------
% 0.22/0.38 % (8331)------------------------------
% 0.22/0.38 % (8330)Also succeeded, but the first one will report.
% 0.22/0.38 % (8335)Refutation found. Thanks to Tanya!
% 0.22/0.38 % SZS status Theorem for theBenchmark
% 0.22/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38 % (8335)------------------------------
% 0.22/0.38 % (8335)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (8335)Termination reason: Refutation
% 0.22/0.38
% 0.22/0.38 % (8335)Memory used [KB]: 5500
% 0.22/0.38 % (8335)Time elapsed: 0.006 s
% 0.22/0.38 % (8335)Instructions burned: 3 (million)
% 0.22/0.38 % (8335)------------------------------
% 0.22/0.38 % (8335)------------------------------
% 0.22/0.38 % (8329)Success in time 0.017 s
% 0.22/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------