TSTP Solution File: SYO357^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO357^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 : n011.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.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 181 ( 61 equ; 0 cnn)
% Maximal formula atoms : 8 ( 7 avg)
% Number of connectives : 173 ( 45 ~; 33 |; 24 &; 53 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 25 ( 4 ^ 17 !; 3 ?; 25 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
atype: $tType ).
thf(func_def_0,type,
atype: $tType ).
thf(func_def_2,type,
v: atype ).
thf(func_def_3,type,
u: atype ).
thf(func_def_8,type,
sK0: atype > $o ).
thf(func_def_11,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f41,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f25,f40]) ).
thf(f40,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f39]) ).
thf(f39,plain,
( $false
| ~ spl1_1 ),
inference(subsumption_resolution,[],[f37,f12]) ).
thf(f12,plain,
( ( sK0 @ u )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ! [X0: atype > $o] :
( ( ( ( b = $true )
| ( b != $true ) )
& ( ( X0 @ v )
= $true ) )
| ( ( X0 @ u )
!= $true )
| ( ( a = $true )
& ( a != $true ) ) )
& ( ( sK0 @ u )
= $true )
& ( ( sK0 @ v )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X1: atype > $o] :
( ( ( X1 @ u )
= $true )
& ( ( X1 @ v )
!= $true ) )
=> ( ( ( sK0 @ u )
= $true )
& ( ( sK0 @ v )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: atype > $o] :
( ( ( ( b = $true )
| ( b != $true ) )
& ( ( X0 @ v )
= $true ) )
| ( ( X0 @ u )
!= $true )
| ( ( a = $true )
& ( a != $true ) ) )
& ? [X1: atype > $o] :
( ( ( X1 @ u )
= $true )
& ( ( X1 @ v )
!= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X1: atype > $o] :
( ( ( X1 @ u )
= $true )
& ( ( X1 @ v )
!= $true ) )
& ! [X0: atype > $o] :
( ( ( ( b = $true )
| ( b != $true ) )
& ( ( X0 @ v )
= $true ) )
| ( ( X0 @ u )
!= $true )
| ( ( a = $true )
& ( a != $true ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ! [X0: atype > $o] :
( ( ( ( X0 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
=> ( ( ( b = $true )
| ( b != $true ) )
& ( ( X0 @ v )
= $true ) ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
= $true )
=> ( ( X1 @ v )
= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: atype > $o] :
( ( ( ( X0 @ u )
= $true )
& ( ( a != $true )
| ( a = $true ) ) )
=> ( ( ( b = $true )
| ( b != $true ) )
& ( ( X0 @ v )
= $true ) ) )
=> ! [X1: atype > $o] :
( ( ( X1 @ u )
= $true )
=> ( ( X1 @ v )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: atype > $o] :
( ( ( X0 @ u )
& ( ~ a
| a ) )
=> ( ( b
| ~ b )
& ( X0 @ v ) ) )
=> ! [X1: atype > $o] :
( ( X1 @ u )
=> ( X1 @ v ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: atype > $o] :
( ( ( X0 @ u )
& ( ~ a
| a ) )
=> ( ( b
| ~ b )
& ( X0 @ v ) ) )
=> ! [X1: atype > $o] :
( ( X1 @ u )
=> ( X1 @ v ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: atype > $o] :
( ( ( X0 @ u )
& ( ~ a
| a ) )
=> ( ( b
| ~ b )
& ( X0 @ v ) ) )
=> ! [X1: atype > $o] :
( ( X1 @ u )
=> ( X1 @ v ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE2LEIBEQ2_pme) ).
thf(f37,plain,
( ( ( sK0 @ u )
!= $true )
| ~ spl1_1 ),
inference(beta_eta_normalization,[],[f36]) ).
thf(f36,plain,
( ( $true
!= ( ^ [Y0: atype] :
( sK0
@ ( ^ [Y1: atype] : Y1
@ Y0 ) )
@ u ) )
| ~ spl1_1 ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f31,plain,
( ( $true
!= ( ^ [Y0: atype] :
( sK0
@ ( ^ [Y1: atype] : Y1
@ Y0 ) )
@ u ) )
| ( $true != $true )
| ~ spl1_1 ),
inference(superposition,[],[f11,f19]) ).
thf(f19,plain,
( ! [X0: atype > $o] :
( ( ( X0 @ v )
= $true )
| ( ( X0 @ u )
!= $true ) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f18,plain,
( spl1_1
<=> ! [X0: atype > $o] :
( ( ( X0 @ u )
!= $true )
| ( ( X0 @ v )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
thf(f11,plain,
( ( sK0 @ v )
!= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f25,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f14,f21,f18]) ).
thf(f21,plain,
( spl1_2
<=> ( a = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f14,plain,
! [X0: atype > $o] :
( ( a = $true )
| ( ( X0 @ v )
= $true )
| ( ( X0 @ u )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f24,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f13,f21,f18]) ).
thf(f13,plain,
! [X0: atype > $o] :
( ( a != $true )
| ( ( X0 @ u )
!= $true )
| ( ( X0 @ v )
= $true ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO357^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 08:31:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34 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.13/0.36 % (13656)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.13/0.36 % (13657)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.13/0.36 % (13660)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.13/0.36 % (13661)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.13/0.36 % (13660)Instruction limit reached!
% 0.13/0.36 % (13660)------------------------------
% 0.13/0.36 % (13660)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (13660)Termination reason: Unknown
% 0.13/0.36 % (13660)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (13660)Memory used [KB]: 5373
% 0.13/0.36 % (13660)Time elapsed: 0.003 s
% 0.13/0.36 % (13660)Instructions burned: 2 (million)
% 0.13/0.36 % (13660)------------------------------
% 0.13/0.36 % (13660)------------------------------
% 0.13/0.37 % (13656)First to succeed.
% 0.13/0.37 % (13661)Also succeeded, but the first one will report.
% 0.13/0.37 % (13657)Also succeeded, but the first one will report.
% 0.13/0.37 % (13656)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (13656)------------------------------
% 0.13/0.37 % (13656)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (13656)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (13656)Memory used [KB]: 5500
% 0.13/0.37 % (13656)Time elapsed: 0.005 s
% 0.13/0.37 % (13656)Instructions burned: 2 (million)
% 0.13/0.37 % (13656)------------------------------
% 0.13/0.37 % (13656)------------------------------
% 0.13/0.37 % (13655)Success in time 0.006 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------