TSTP Solution File: NUM689^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM689^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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:46 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of formulae : 67 ( 13 unt; 14 typ; 0 def)
% Number of atoms : 302 ( 75 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 529 ( 59 ~; 51 |; 0 &; 408 @)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 9 con; 0-4 aty)
% Number of variables : 81 ( 22 ^ 58 !; 0 ?; 81 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% 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,
u: nat ).
thf(func_def_5,type,
lessis: nat > nat > $o ).
thf(func_def_7,type,
some: ( nat > $o ) > $o ).
thf(func_def_8,type,
diffprop: nat > nat > nat > $o ).
thf(func_def_9,type,
pl: nat > nat > nat ).
thf(func_def_10,type,
moreis: nat > nat > $o ).
thf(func_def_16,type,
ph1:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
sK2: nat ).
thf(func_def_18,type,
sK3: nat > nat > nat > nat > nat ).
thf(f99,plain,
$false,
inference(avatar_sat_refutation,[],[f76,f80,f98]) ).
thf(f98,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f97]) ).
thf(f97,plain,
( $false
| ~ spl0_5
| ~ spl0_6 ),
inference(subsumption_resolution,[],[f96,f29]) ).
thf(f29,plain,
( $true
= ( some @ ( diffprop @ u @ z ) ) ),
inference(beta_eta_normalization,[],[f22]) ).
thf(f22,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ u @ z @ Y0 ) )
= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ u @ z @ Y0 ) )
= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
( some
@ ^ [X0: nat] : ( diffprop @ u @ z @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( some
@ ^ [X0: nat] : ( diffprop @ u @ z @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(f96,plain,
( ( $true
!= ( some @ ( diffprop @ u @ z ) ) )
| ~ spl0_5
| ~ spl0_6 ),
inference(subsumption_resolution,[],[f87,f70]) ).
thf(f70,plain,
( ( ( moreis @ y @ x )
= $true )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f69,plain,
( spl0_5
<=> ( ( moreis @ y @ x )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f87,plain,
( ( ( moreis @ y @ x )
!= $true )
| ( $true
!= ( some @ ( diffprop @ u @ z ) ) )
| ~ spl0_6 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f86,plain,
( ( $true = $false )
| ( ( moreis @ y @ x )
!= $true )
| ( $true
!= ( some @ ( diffprop @ u @ z ) ) )
| ~ spl0_6 ),
inference(duplicate_literal_removal,[],[f82]) ).
thf(f82,plain,
( ( $true
!= ( some @ ( diffprop @ u @ z ) ) )
| ( $true = $false )
| ( ( moreis @ y @ x )
!= $true )
| ( $true = $false )
| ~ spl0_6 ),
inference(superposition,[],[f64,f75]) ).
thf(f75,plain,
( ( $true
= ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ z @ u @ y @ x ) ) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f73]) ).
thf(f73,plain,
( spl0_6
<=> ( $true
= ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ z @ u @ y @ x ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
thf(f64,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ X3 @ X1 @ X0 @ X2 ) )
= $false )
| ( $true
!= ( moreis @ X0 @ X2 ) )
| ( $true
!= ( some @ ( diffprop @ X1 @ X3 ) ) )
| ( ( diffprop @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) @ ( sK3 @ X3 @ X1 @ X0 @ X2 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f62]) ).
thf(f62,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( $true
!= ( moreis @ X0 @ X2 ) )
| ( $true
!= ( some @ ( diffprop @ X1 @ X3 ) ) )
| ( ( diffprop @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) @ ( sK3 @ X3 @ X1 @ X0 @ X2 ) )
!= ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ X3 @ X1 @ X0 @ X2 ) ) ) ),
inference(negative_extensionality,[],[f61]) ).
thf(f61,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) )
!= ( diffprop @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) ) )
| ( $true
!= ( some @ ( diffprop @ X1 @ X3 ) ) )
| ( $true
!= ( moreis @ X0 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f60,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( $true
!= ( some @ ( diffprop @ X1 @ X3 ) ) )
| ( ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) )
!= ( diffprop @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) ) )
| ( $true
!= ( moreis @ X0 @ X2 ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f28,f27]) ).
thf(f27,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( some @ ( diffprop @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) ) )
= $true )
| ( $true
!= ( some @ ( diffprop @ X0 @ X2 ) ) )
| ( ( moreis @ X3 @ X1 )
!= $true ) ),
inference(beta_eta_normalization,[],[f25]) ).
thf(f25,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( moreis @ X3 @ X1 )
!= $true )
| ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) @ Y0 ) ) )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X0 @ X2 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f20,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( moreis @ X3 @ X1 )
!= $true )
| ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) @ Y0 ) ) )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X0 @ X2 @ Y0 ) ) ) ),
inference(flattening,[],[f19]) ).
thf(f19,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) @ Y0 ) ) )
| ( $true
!= ( some
@ ^ [Y0: nat] : ( diffprop @ X0 @ X2 @ Y0 ) ) )
| ( ( moreis @ X3 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( moreis @ X3 @ X1 )
= $true )
=> ( ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ X0 @ X2 @ Y0 ) ) )
=> ( $true
= ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( moreis @ X3 @ X1 )
=> ( ( some
@ ^ [X4: nat] : ( diffprop @ X0 @ X2 @ X4 ) )
=> ( some
@ ^ [X5: nat] : ( diffprop @ ( pl @ X3 @ X0 ) @ ( pl @ X1 @ X2 ) @ X5 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X3: nat,X2: nat,X4: nat,X1: nat] :
( ( moreis @ X1 @ X2 )
=> ( ( some
@ ^ [X5: nat] : ( diffprop @ X3 @ X4 @ X5 ) )
=> ( some
@ ^ [X5: nat] : ( diffprop @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X4 ) @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22a) ).
thf(f28,plain,
( ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f23]) ).
thf(f23,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Y0 ) )
!= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Y0 ) )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
( ( some
@ ^ [Y0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ Y0 ) )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ( some
@ ^ [X0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ( some
@ ^ [X0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X0 ) ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
( some
@ ^ [X0: nat] : ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22c) ).
thf(f80,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f79]) ).
thf(f79,plain,
( $false
| spl0_5 ),
inference(subsumption_resolution,[],[f78,f26]) ).
thf(f26,plain,
( ( lessis @ x @ y )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( lessis @ x @ y )
= $true ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
lessis @ x @ y,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
lessis @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(f78,plain,
( ( ( lessis @ x @ y )
!= $true )
| spl0_5 ),
inference(trivial_inequality_removal,[],[f77]) ).
thf(f77,plain,
( ( ( lessis @ x @ y )
!= $true )
| ( $true != $true )
| spl0_5 ),
inference(superposition,[],[f71,f24]) ).
thf(f24,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( moreis @ X1 @ X0 ) )
| ( $true
!= ( lessis @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( moreis @ X1 @ X0 ) )
| ( $true
!= ( lessis @ X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( lessis @ X0 @ X1 ) )
=> ( $true
= ( moreis @ X1 @ X0 ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X1: nat,X2: nat] :
( ( lessis @ X1 @ X2 )
=> ( moreis @ X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz14) ).
thf(f71,plain,
( ( ( moreis @ y @ x )
!= $true )
| spl0_5 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f76,plain,
( ~ spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f67,f73,f69]) ).
thf(f67,plain,
( ( $true
= ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ z @ u @ y @ x ) ) )
| ( ( moreis @ y @ x )
!= $true ) ),
inference(subsumption_resolution,[],[f66,f29]) ).
thf(f66,plain,
( ( $true
= ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ z @ u @ y @ x ) ) )
| ( ( moreis @ y @ x )
!= $true )
| ( $true
!= ( some @ ( diffprop @ u @ z ) ) ) ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f65,plain,
( ( $true != $true )
| ( $true
!= ( some @ ( diffprop @ u @ z ) ) )
| ( $true
= ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ z @ u @ y @ x ) ) )
| ( ( moreis @ y @ x )
!= $true ) ),
inference(equality_factoring,[],[f63]) ).
thf(f63,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) @ ( sK3 @ X3 @ X1 @ X0 @ X2 ) )
= $true )
| ( $true
!= ( moreis @ X0 @ X2 ) )
| ( $true
!= ( some @ ( diffprop @ X1 @ X3 ) ) )
| ( ( diffprop @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) @ ( sK3 @ X3 @ X1 @ X0 @ X2 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM689^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % 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.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 05:45:23 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.12/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.12/0.36 % (4721)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.12/0.36 % (4727)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.36 % (4728)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.12/0.36 % (4728)Instruction limit reached!
% 0.12/0.36 % (4728)------------------------------
% 0.12/0.36 % (4728)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (4728)Termination reason: Unknown
% 0.12/0.36 % (4728)Termination phase: Saturation
% 0.12/0.36
% 0.12/0.36 % (4728)Memory used [KB]: 5500
% 0.12/0.36 % (4728)Time elapsed: 0.003 s
% 0.12/0.36 % (4728)Instructions burned: 3 (million)
% 0.12/0.36 % (4728)------------------------------
% 0.12/0.36 % (4728)------------------------------
% 0.12/0.36 % (4721)First to succeed.
% 0.12/0.36 % (4721)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (4721)------------------------------
% 0.12/0.36 % (4721)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (4721)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (4721)Memory used [KB]: 5628
% 0.12/0.36 % (4721)Time elapsed: 0.006 s
% 0.12/0.36 % (4721)Instructions burned: 9 (million)
% 0.12/0.36 % (4721)------------------------------
% 0.12/0.36 % (4721)------------------------------
% 0.12/0.36 % (4720)Success in time 0.005 s
% 0.12/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------