TSTP Solution File: SYO023^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO023^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 : n010.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:02:16 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 17 unt; 1 typ; 0 def)
% Number of atoms : 69 ( 26 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 100 ( 63 ~; 21 |; 12 &; 4 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 42 ^ 0 !; 0 ?; 43 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_10,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f40,plain,
$false,
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( ^ [Y0: $o] : Y0 )
!= ( ^ [Y0: $o] : Y0 ) ),
inference(boolean_simplification,[],[f38]) ).
thf(f38,plain,
( ( ^ [Y0: $o] :
~ ~ Y0 )
!= ( ^ [Y0: $o] : Y0 ) ),
inference(boolean_simplification,[],[f37]) ).
thf(f37,plain,
( ( ^ [Y0: $o] :
~ ( ~ Y0
| $false ) )
!= ( ^ [Y0: $o] : Y0 ) ),
inference(boolean_simplification,[],[f36]) ).
thf(f36,plain,
( ( ^ [Y0: $o] :
~ ( ~ Y0
| ~ $true ) )
!= ( ^ [Y0: $o] : Y0 ) ),
inference(boolean_simplification,[],[f35]) ).
thf(f35,plain,
( ( ^ [Y0: $o] :
~ ( ~ Y0
| ~ $true ) )
!= ( ^ [Y0: $o] :
( Y0
& $true ) ) ),
inference(backward_demodulation,[],[f9,f34]) ).
thf(f34,plain,
$true = sK2,
inference(duplicate_literal_removal,[],[f33]) ).
thf(f33,plain,
( ( $true = sK2 )
| ( $true = sK2 ) ),
inference(not_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( $true = sK2 )
| ( ~ sK2 = $false ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( $true = sK2 )
| ( ( ~ sK3
| ~ sK2 )
= $false ) ),
inference(not_proxy_clausification,[],[f21]) ).
thf(f21,plain,
( ( $true = sK2 )
| ( $true
= ( ~ ( ~ sK3
| ~ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( sK3
& sK2 )
= $true )
| ( $true
= ( ~ ( ~ sK3
| ~ sK2 ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( sK3
& sK2 )
!= ( ~ ( ~ sK3
| ~ sK2 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: $o] :
( Y0
& sK2 )
@ sK3 )
!= ( ^ [Y0: $o] :
~ ( ~ Y0
| ~ sK2 )
@ sK3 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: $o] :
( Y0
& sK2 ) )
!= ( ^ [Y0: $o] :
~ ( ~ Y0
| ~ sK2 ) ) ),
inference(beta_eta_normalization,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y1
| ~ Y0 )
@ sK2 )
!= ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 )
@ sK2 ) ),
inference(negative_extensionality,[],[f7]) ).
thf(f7,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y1
| ~ Y0 ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y1
| ~ Y0 ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y1
| ~ Y0 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
( ( ^ [X0: $o,X1: $o] :
~ ( ~ X0
| ~ X1 ) )
!= ( ^ [X2: $o,X3: $o] :
( X2
& X3 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
( ( ^ [X2: $o,X3: $o] :
~ ( ~ X2
| ~ X3 ) )
!= ( ^ [X0: $o,X1: $o] :
( X0
& X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ^ [X2: $o,X3: $o] :
~ ( ~ X2
| ~ X3 ) )
= ( ^ [X0: $o,X1: $o] :
( X0
& X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO023^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 08:44:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/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.13/0.37 % (19602)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.37 % (19604)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 (3000ds/27Mi)
% 0.13/0.37 % (19603)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.37 % (19605)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (19606)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.37 % (19607)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.37 % (19608)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37 % (19605)First to succeed.
% 0.13/0.37 % (19606)Refutation not found, incomplete strategy
% 0.13/0.37 % (19606)------------------------------
% 0.13/0.37 % (19606)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (19606)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (19606)Memory used [KB]: 5500
% 0.13/0.37 % (19606)Time elapsed: 0.004 s
% 0.13/0.37 % (19606)Instructions burned: 1 (million)
% 0.13/0.37 % (19606)------------------------------
% 0.13/0.37 % (19606)------------------------------
% 0.13/0.37 % (19602)Also succeeded, but the first one will report.
% 0.13/0.37 % (19605)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 % (19605)------------------------------
% 0.13/0.37 % (19605)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (19605)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (19605)Memory used [KB]: 5500
% 0.13/0.37 % (19605)Time elapsed: 0.004 s
% 0.13/0.37 % (19605)Instructions burned: 1 (million)
% 0.13/0.37 % (19605)------------------------------
% 0.13/0.37 % (19605)------------------------------
% 0.13/0.37 % (19601)Success in time 0.005 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------