TSTP Solution File: SET625^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET625^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 : n014.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:12:31 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 148 ( 59 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 161 ( 29 ~; 16 |; 32 &; 74 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 ^ 30 !; 26 ?; 57 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: a > $o ).
thf(func_def_8,type,
sK3: a ).
thf(f21,plain,
$false,
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
$true != $true,
inference(superposition,[],[f19,f17]) ).
thf(f17,plain,
( $true
= ( sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f16,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true != $true ) ),
inference(superposition,[],[f12,f15]) ).
thf(f15,plain,
( $true
= ( sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( $true
= ( sK2 @ sK3 ) )
& ( $true
= ( sK0 @ sK3 ) )
& ! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( $true
!= ( sK0 @ X4 ) ) )
& ! [X5: a] :
( ( $true
= ( sK1 @ X5 ) )
| ( $true
!= ( sK2 @ X5 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X2 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
!= ( X1 @ X4 ) )
| ( $true
!= ( X0 @ X4 ) ) )
& ! [X5: a] :
( ( $true
= ( X1 @ X5 ) )
| ( $true
!= ( X2 @ X5 ) ) ) )
=> ( ? [X3: a] :
( ( $true
= ( sK2 @ X3 ) )
& ( $true
= ( sK0 @ X3 ) ) )
& ! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( $true
!= ( sK0 @ X4 ) ) )
& ! [X5: a] :
( ( $true
= ( sK1 @ X5 ) )
| ( $true
!= ( sK2 @ X5 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: a] :
( ( $true
= ( sK2 @ X3 ) )
& ( $true
= ( sK0 @ X3 ) ) )
=> ( ( $true
= ( sK2 @ sK3 ) )
& ( $true
= ( sK0 @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X2 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
!= ( X1 @ X4 ) )
| ( $true
!= ( X0 @ X4 ) ) )
& ! [X5: a] :
( ( $true
= ( X1 @ X5 ) )
| ( $true
!= ( X2 @ X5 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X4: a] :
( ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X0 @ X4 ) ) )
& ! [X5: a] :
( ( $true
!= ( X1 @ X5 ) )
| ( ( X0 @ X5 )
!= $true ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
!= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X2: a > $o,X1: a > $o,X0: a > $o] :
( ! [X5: a] :
( ( $true
!= ( X1 @ X5 ) )
| ( ( X0 @ X5 )
!= $true ) )
& ? [X4: a] :
( ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X0 @ X4 ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ? [X4: a] :
( ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X0 @ X4 ) ) )
& ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
=> ( ( X1 @ X3 )
= $true ) ) )
=> ? [X5: a] :
( ( $true
= ( X1 @ X5 ) )
& ( ( X0 @ X5 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X1 @ X3 ) )
& ? [X4: a] :
( ( X2 @ X4 )
& ( X0 @ X4 ) ) )
=> ? [X5: a] :
( ( X1 @ X5 )
& ( X0 @ X5 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
& ? [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) ) )
=> ? [X3: a] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
& ? [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) ) )
=> ? [X3: a] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_101_pme) ).
thf(f12,plain,
! [X5: a] :
( ( $true
!= ( sK2 @ X5 ) )
| ( $true
= ( sK1 @ X5 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f19,plain,
( $true
!= ( sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
( ( $true != $true )
| ( $true
!= ( sK1 @ sK3 ) ) ),
inference(superposition,[],[f13,f14]) ).
thf(f14,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f13,plain,
! [X4: a] :
( ( $true
!= ( sK0 @ X4 ) )
| ( ( sK1 @ X4 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET625^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/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.15/0.35 % Computer : n014.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 : Mon May 20 11:34:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.37 % (15812)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.37 % (15810)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.37 % (15813)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.37 % (15809)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.37 % (15814)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.37 % (15811)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (15815)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.15/0.38 % (15812)Instruction limit reached!
% 0.15/0.38 % (15812)------------------------------
% 0.15/0.38 % (15812)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (15812)Termination reason: Unknown
% 0.15/0.38 % (15812)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (15812)Memory used [KB]: 5500
% 0.15/0.38 % (15812)Time elapsed: 0.004 s
% 0.15/0.38 % (15812)Instructions burned: 2 (million)
% 0.15/0.38 % (15812)------------------------------
% 0.15/0.38 % (15812)------------------------------
% 0.15/0.38 % (15810)First to succeed.
% 0.15/0.38 % (15811)Instruction limit reached!
% 0.15/0.38 % (15811)------------------------------
% 0.15/0.38 % (15811)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (15811)Termination reason: Unknown
% 0.15/0.38 % (15811)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (15811)Memory used [KB]: 5500
% 0.15/0.38 % (15811)Time elapsed: 0.004 s
% 0.15/0.38 % (15811)Instructions burned: 2 (million)
% 0.15/0.38 % (15811)------------------------------
% 0.15/0.38 % (15811)------------------------------
% 0.15/0.38 % (15808)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.15/0.38 % (15813)Also succeeded, but the first one will report.
% 0.15/0.38 % (15810)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (15810)------------------------------
% 0.15/0.38 % (15810)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (15810)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (15810)Memory used [KB]: 5500
% 0.15/0.38 % (15810)Time elapsed: 0.004 s
% 0.15/0.38 % (15810)Instructions burned: 2 (million)
% 0.15/0.38 % (15810)------------------------------
% 0.15/0.38 % (15810)------------------------------
% 0.15/0.38 % (15807)Success in time 0.005 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------