TSTP Solution File: NUM683^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM683^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 : n024.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:41 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 19 unt; 8 typ; 0 def)
% Number of atoms : 71 ( 23 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 133 ( 10 ~; 4 |; 0 &; 116 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 26 !; 0 ?; 27 :)
% ( 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,
more: nat > nat > $o ).
thf(func_def_5,type,
pl: nat > nat > nat ).
thf(func_def_7,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(f31,plain,
$false,
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
$true != $true,
inference(superposition,[],[f21,f29]) ).
thf(f29,plain,
( ( more @ x @ y )
= $true ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f28,plain,
( ( ( more @ x @ y )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f18,f23]) ).
thf(f23,plain,
( $true
= ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ),
inference(forward_demodulation,[],[f22,f20]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(rectify,[],[f14]) ).
thf(f14,plain,
! [X1: nat,X0: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X1: nat,X0: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz6) ).
thf(f22,plain,
( $true
= ( more @ ( pl @ x @ z ) @ ( pl @ z @ y ) ) ),
inference(forward_demodulation,[],[f19,f20]) ).
thf(f19,plain,
( ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
more @ ( pl @ z @ x ) @ ( pl @ z @ y ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
more @ ( pl @ z @ x ) @ ( pl @ z @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(f18,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true
!= ( more @ ( pl @ X1 @ X0 ) @ ( pl @ X2 @ X0 ) ) )
| ( $true
= ( more @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
!= ( more @ ( pl @ X1 @ X0 ) @ ( pl @ X2 @ X0 ) ) )
| ( $true
= ( more @ X1 @ X2 ) ) ),
inference(rectify,[],[f15]) ).
thf(f15,plain,
! [X1: nat,X0: nat,X2: nat] :
( ( $true
!= ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) ) )
| ( $true
= ( more @ X0 @ X2 ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
! [X1: nat,X2: nat,X0: nat] :
( ( $true
= ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) ) )
=> ( $true
= ( more @ X0 @ X2 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X1 ) )
=> ( more @ X0 @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: nat,X2: nat,X1: nat] :
( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
=> ( more @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20a) ).
thf(f21,plain,
( ( more @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( more @ x @ y )
!= $true ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
( ( more @ x @ y )
!= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ( more @ x @ y ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ( more @ x @ y ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
more @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20d) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM683^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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 : n024.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 03:44:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.37 % (32643)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.14/0.37 % (32643)First to succeed.
% 0.14/0.37 % (32643)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (32643)------------------------------
% 0.14/0.37 % (32643)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (32643)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (32643)Memory used [KB]: 5500
% 0.14/0.37 % (32643)Time elapsed: 0.004 s
% 0.14/0.37 % (32643)Instructions burned: 2 (million)
% 0.14/0.37 % (32643)------------------------------
% 0.14/0.37 % (32643)------------------------------
% 0.14/0.37 % (32640)Success in time 0.003 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------