TSTP Solution File: SYO353^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO353^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.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 09:04:07 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 59 ( 26 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 97 ( 14 ~; 4 |; 8 &; 58 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 ^ 22 !; 3 ?; 26 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
v: a ).
thf(func_def_2,type,
u: a ).
thf(func_def_6,type,
sK0: a > a > $o ).
thf(func_def_9,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f29,plain,
$false,
inference(subsumption_resolution,[],[f28,f11]) ).
thf(f11,plain,
! [X1: a] :
( $true
= ( sK0 @ X1 @ X1 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( ( sK0 @ u @ v )
!= $true )
& ! [X1: a] :
( $true
= ( sK0 @ X1 @ X1 ) )
& ! [X2: a > $o] :
( ( $true
= ( X2 @ v ) )
| ( ( X2 @ u )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: a > a > $o] :
( ( $true
!= ( X0 @ u @ v ) )
& ! [X1: a] :
( $true
= ( X0 @ X1 @ X1 ) ) )
=> ( ( ( sK0 @ u @ v )
!= $true )
& ! [X1: a] :
( $true
= ( sK0 @ X1 @ X1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
( ? [X0: a > a > $o] :
( ( $true
!= ( X0 @ u @ v ) )
& ! [X1: a] :
( $true
= ( X0 @ X1 @ X1 ) ) )
& ! [X2: a > $o] :
( ( $true
= ( X2 @ v ) )
| ( ( X2 @ u )
!= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
( ? [X1: a > a > $o] :
( ( ( X1 @ u @ v )
!= $true )
& ! [X2: a] :
( ( X1 @ X2 @ X2 )
= $true ) )
& ! [X0: a > $o] :
( ( ( X0 @ v )
= $true )
| ( ( X0 @ u )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a > $o] :
( ( ( X0 @ u )
= $true )
=> ( ( X0 @ v )
= $true ) )
=> ! [X1: a > a > $o] :
( ! [X2: a] :
( ( X1 @ X2 @ X2 )
= $true )
=> ( ( X1 @ u @ v )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: a > a > $o] :
( ! [X2: a] : ( X1 @ X2 @ X2 )
=> ( X1 @ u @ v ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: a > a > $o] :
( ! [X2: a] : ( X1 @ X2 @ X2 )
=> ( X1 @ u @ v ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a > $o] :
( ( X0 @ u )
=> ( X0 @ v ) )
=> ! [X1: a > a > $o] :
( ! [X2: a] : ( X1 @ X2 @ X2 )
=> ( X1 @ u @ v ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE1LEIBEQ1_pme) ).
thf(f28,plain,
( ( sK0 @ v @ v )
!= $true ),
inference(backward_demodulation,[],[f12,f13]) ).
thf(f13,plain,
u = v,
inference(leibniz_equality_elimination,[],[f10]) ).
thf(f10,plain,
! [X2: a > $o] :
( ( ( X2 @ u )
!= $true )
| ( $true
= ( X2 @ v ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f12,plain,
( ( sK0 @ u @ v )
!= $true ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO353^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 09:18:22 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.37 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.15/0.38 % (4355)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.38 % (4356)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 % (4350)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.38 % (4349)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 % (4352)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (4354)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.39 % (4356)First to succeed.
% 0.15/0.39 % (4355)Also succeeded, but the first one will report.
% 0.15/0.39 % (4353)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.39 % (4349)Also succeeded, but the first one will report.
% 0.15/0.39 % (4356)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (4356)------------------------------
% 0.15/0.39 % (4356)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (4356)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (4356)Memory used [KB]: 5500
% 0.15/0.39 % (4356)Time elapsed: 0.003 s
% 0.15/0.39 % (4356)Instructions burned: 2 (million)
% 0.15/0.39 % (4356)------------------------------
% 0.15/0.39 % (4356)------------------------------
% 0.15/0.39 % (4348)Success in time 0.005 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------