TSTP Solution File: NUM652^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM652^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 : n007.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:13 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 145 ( 59 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 203 ( 64 ~; 15 |; 6 &; 94 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 19 !; 0 ?; 19 :)
% 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,
more: nat > nat > $o ).
thf(func_def_5,type,
less: nat > nat > $o ).
thf(f40,plain,
$false,
inference(subsumption_resolution,[],[f38,f30]) ).
thf(f30,plain,
! [X1: nat] :
( ( less @ X1 @ X1 )
!= $true ),
inference(equality_resolution,[],[f26]) ).
thf(f26,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
| ( $true
!= ( less @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( $true
!= ( less @ X0 @ X1 ) ) )
& ( ( $true
!= ( more @ X0 @ X1 ) )
| ( X0 != X1 ) )
& ( ( $true
!= ( less @ X0 @ X1 ) )
| ( $true
!= ( more @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f22]) ).
thf(f22,plain,
! [X1: nat,X0: nat] :
( ( ( X0 != X1 )
| ( $true
!= ( less @ X1 @ X0 ) ) )
& ( ( ( more @ X1 @ X0 )
!= $true )
| ( X0 != X1 ) )
& ( ( $true
!= ( less @ X1 @ X0 ) )
| ( ( more @ X1 @ X0 )
!= $true ) ) ),
inference(flattening,[],[f21]) ).
thf(f21,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
| ( $true
!= ( less @ X1 @ X0 ) ) )
& ( ( $true
!= ( less @ X1 @ X0 ) )
| ( ( more @ X1 @ X0 )
!= $true ) )
& ( ( ( more @ X1 @ X0 )
!= $true )
| ( X0 != X1 ) ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( ( more @ X1 @ X0 )
!= $true ) )
=> ( ( ( ( more @ X1 @ X0 )
= $true )
=> ( $true
!= ( less @ X1 @ X0 ) ) )
=> ~ ( ( $true
= ( less @ X1 @ X0 ) )
=> ( X0 != X1 ) ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ( ( more @ X1 @ X0 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X1 @ X0 )
= $true )
=> ( $true
!= ( less @ X1 @ X0 ) ) )
=> ~ ( ( $true
= ( less @ X1 @ X0 ) )
=> ( X0 != X1 ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
~ ( ( ( X0 = X1 )
=> ~ ( more @ X1 @ X0 ) )
=> ~ ~ ( ( ( more @ X1 @ X0 )
=> ~ ( less @ X1 @ X0 ) )
=> ~ ( ( less @ X1 @ X0 )
=> ( X0 != X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X2: nat,X1: nat] :
~ ( ( ( X1 = X2 )
=> ~ ( more @ X1 @ X2 ) )
=> ~ ~ ( ( ( more @ X1 @ X2 )
=> ~ ( less @ X1 @ X2 ) )
=> ~ ( ( less @ X1 @ X2 )
=> ( X1 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).
thf(f38,plain,
( ( less @ x @ x )
= $true ),
inference(superposition,[],[f28,f36]) ).
thf(f36,plain,
x = y,
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( x = y )
| ( $true != $true ) ),
inference(superposition,[],[f34,f29]) ).
thf(f29,plain,
( ( ( more @ x @ y )
= $true )
| ( x = y ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f20,plain,
( ( ( more @ x @ y )
= $true )
| ( x = y ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f10]) ).
thf(f10,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f34,plain,
( ( more @ x @ y )
!= $true ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f33,plain,
( ( $true != $true )
| ( ( more @ x @ y )
!= $true ) ),
inference(superposition,[],[f24,f28]) ).
thf(f24,plain,
! [X0: nat,X1: nat] :
( ( $true
!= ( less @ X0 @ X1 ) )
| ( $true
!= ( more @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f28,plain,
( ( less @ x @ y )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( less @ x @ y )
= $true ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
~ ( ( ( less @ x @ y )
!= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
~ ~ ( less @ x @ y ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ~ ( less @ x @ y ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
~ ( less @ x @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM652^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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 : n007.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 06:45:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.37 % (21895)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 % (21896)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 % (21895)First to succeed.
% 0.15/0.37 % (21896)Also succeeded, but the first one will report.
% 0.15/0.37 % (21895)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 % (21895)------------------------------
% 0.15/0.37 % (21895)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (21895)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (21895)Memory used [KB]: 5500
% 0.15/0.37 % (21895)Time elapsed: 0.003 s
% 0.15/0.37 % (21895)Instructions burned: 2 (million)
% 0.15/0.37 % (21895)------------------------------
% 0.15/0.37 % (21895)------------------------------
% 0.15/0.37 % (21889)Success in time 0.004 s
% 0.15/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------