TSTP Solution File: SET931+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n029.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 : Wed Aug 31 18:26:08 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 101 ( 20 unt; 0 def)
% Number of atoms : 325 ( 210 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 367 ( 143 ~; 157 |; 53 &)
% ( 12 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 78 ( 63 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f302,plain,
$false,
inference(avatar_sat_refutation,[],[f69,f74,f83,f84,f85,f225,f255,f285,f296,f301]) ).
fof(f301,plain,
( ~ spl9_1
| spl9_2 ),
inference(avatar_contradiction_clause,[],[f300]) ).
fof(f300,plain,
( $false
| ~ spl9_1
| spl9_2 ),
inference(subsumption_resolution,[],[f299,f68]) ).
fof(f68,plain,
( empty_set != sF7
| spl9_2 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f66,plain,
( spl9_2
<=> empty_set = sF7 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f299,plain,
( empty_set = sF7
| ~ spl9_1 ),
inference(forward_demodulation,[],[f298,f131]) ).
fof(f131,plain,
empty_set = set_difference(empty_set,sF6),
inference(resolution,[],[f41,f86]) ).
fof(f86,plain,
subset(empty_set,sF6),
inference(superposition,[],[f48,f53]) ).
fof(f53,plain,
sF6 = unordered_pair(sK3,sK1),
introduced(function_definition,[]) ).
fof(f48,plain,
! [X0,X1] : subset(empty_set,unordered_pair(X1,X0)),
inference(equality_resolution,[],[f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( subset(X2,unordered_pair(X1,X0))
| empty_set != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( empty_set = X2
| singleton(X0) = X2
| singleton(X1) = X2
| unordered_pair(X1,X0) = X2
| ~ subset(X2,unordered_pair(X1,X0)) )
& ( subset(X2,unordered_pair(X1,X0))
| ( empty_set != X2
& singleton(X0) != X2
& singleton(X1) != X2
& unordered_pair(X1,X0) != X2 ) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ( empty_set = X1
| singleton(X2) = X1
| singleton(X0) = X1
| unordered_pair(X0,X2) = X1
| ~ subset(X1,unordered_pair(X0,X2)) )
& ( subset(X1,unordered_pair(X0,X2))
| ( empty_set != X1
& singleton(X2) != X1
& singleton(X0) != X1
& unordered_pair(X0,X2) != X1 ) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ( empty_set = X1
| singleton(X2) = X1
| singleton(X0) = X1
| unordered_pair(X0,X2) = X1
| ~ subset(X1,unordered_pair(X0,X2)) )
& ( subset(X1,unordered_pair(X0,X2))
| ( empty_set != X1
& singleton(X2) != X1
& singleton(X0) != X1
& unordered_pair(X0,X2) != X1 ) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ( empty_set = X1
| singleton(X2) = X1
| singleton(X0) = X1
| unordered_pair(X0,X2) = X1 )
<=> subset(X1,unordered_pair(X0,X2)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X2,X1] :
( subset(X1,unordered_pair(X0,X2))
<=> ~ ( empty_set != X1
& unordered_pair(X0,X2) != X1
& singleton(X2) != X1
& singleton(X0) != X1 ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0,X2] :
( subset(X0,unordered_pair(X1,X2))
<=> ~ ( unordered_pair(X1,X2) != X0
& singleton(X2) != X0
& singleton(X1) != X0
& empty_set != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l46_zfmisc_1) ).
fof(f41,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| empty_set = set_difference(X1,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( empty_set = set_difference(X1,X0)
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| empty_set != set_difference(X1,X0) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1,X0] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f298,plain,
( sF7 = set_difference(empty_set,sF6)
| ~ spl9_1 ),
inference(superposition,[],[f54,f63]) ).
fof(f63,plain,
( empty_set = sK2
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f62,plain,
( spl9_1
<=> empty_set = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f54,plain,
sF7 = set_difference(sK2,sF6),
introduced(function_definition,[]) ).
fof(f296,plain,
( spl9_2
| ~ spl9_5 ),
inference(avatar_contradiction_clause,[],[f295]) ).
fof(f295,plain,
( $false
| spl9_2
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f294,f68]) ).
fof(f294,plain,
( empty_set = sF7
| ~ spl9_5 ),
inference(forward_demodulation,[],[f286,f128]) ).
fof(f128,plain,
! [X0] : empty_set = set_difference(X0,X0),
inference(resolution,[],[f41,f32]) ).
fof(f32,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f286,plain,
( sF7 = set_difference(sK2,sK2)
| ~ spl9_5 ),
inference(superposition,[],[f54,f82]) ).
fof(f82,plain,
( sK2 = sF6
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl9_5
<=> sK2 = sF6 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f285,plain,
( spl9_2
| ~ spl9_4 ),
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f284,plain,
( $false
| spl9_2
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f279,f68]) ).
fof(f279,plain,
( empty_set = sF7
| ~ spl9_4 ),
inference(superposition,[],[f54,f259]) ).
fof(f259,plain,
( empty_set = set_difference(sK2,sF6)
| ~ spl9_4 ),
inference(superposition,[],[f138,f78]) ).
fof(f78,plain,
( sK2 = sF8
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f76,plain,
( spl9_4
<=> sK2 = sF8 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f138,plain,
empty_set = set_difference(sF8,sF6),
inference(resolution,[],[f41,f90]) ).
fof(f90,plain,
subset(sF8,sF6),
inference(forward_demodulation,[],[f89,f57]) ).
fof(f57,plain,
singleton(sK1) = sF8,
introduced(function_definition,[]) ).
fof(f89,plain,
subset(singleton(sK1),sF6),
inference(superposition,[],[f49,f53]) ).
fof(f49,plain,
! [X0,X1] : subset(singleton(X0),unordered_pair(X1,X0)),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( subset(X2,unordered_pair(X1,X0))
| singleton(X0) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f255,plain,
( spl9_2
| ~ spl9_3 ),
inference(avatar_contradiction_clause,[],[f254]) ).
fof(f254,plain,
( $false
| spl9_2
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f249,f68]) ).
fof(f249,plain,
( empty_set = sF7
| ~ spl9_3 ),
inference(superposition,[],[f54,f231]) ).
fof(f231,plain,
( empty_set = set_difference(sK2,sF6)
| ~ spl9_3 ),
inference(superposition,[],[f137,f72]) ).
fof(f72,plain,
( sK2 = sF5
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f71,plain,
( spl9_3
<=> sK2 = sF5 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f137,plain,
empty_set = set_difference(sF5,sF6),
inference(resolution,[],[f41,f95]) ).
fof(f95,plain,
subset(sF5,sF6),
inference(forward_demodulation,[],[f94,f52]) ).
fof(f52,plain,
sF5 = singleton(sK3),
introduced(function_definition,[]) ).
fof(f94,plain,
subset(singleton(sK3),sF6),
inference(superposition,[],[f50,f53]) ).
fof(f50,plain,
! [X0,X1] : subset(singleton(X1),unordered_pair(X1,X0)),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( subset(X2,unordered_pair(X1,X0))
| singleton(X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f225,plain,
( spl9_1
| ~ spl9_2
| spl9_3
| spl9_4
| spl9_5 ),
inference(avatar_contradiction_clause,[],[f224]) ).
fof(f224,plain,
( $false
| spl9_1
| ~ spl9_2
| spl9_3
| spl9_4
| spl9_5 ),
inference(subsumption_resolution,[],[f223,f64]) ).
fof(f64,plain,
( empty_set != sK2
| spl9_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f223,plain,
( empty_set = sK2
| ~ spl9_2
| spl9_3
| spl9_4
| spl9_5 ),
inference(subsumption_resolution,[],[f222,f73]) ).
fof(f73,plain,
( sK2 != sF5
| spl9_3 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f222,plain,
( sK2 = sF5
| empty_set = sK2
| ~ spl9_2
| spl9_4
| spl9_5 ),
inference(subsumption_resolution,[],[f221,f81]) ).
fof(f81,plain,
( sK2 != sF6
| spl9_5 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f221,plain,
( sK2 = sF6
| empty_set = sK2
| sK2 = sF5
| ~ spl9_2
| spl9_4 ),
inference(subsumption_resolution,[],[f218,f77]) ).
fof(f77,plain,
( sK2 != sF8
| spl9_4 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f218,plain,
( sK2 = sF8
| sK2 = sF5
| sK2 = sF6
| empty_set = sK2
| ~ spl9_2 ),
inference(resolution,[],[f173,f127]) ).
fof(f127,plain,
( subset(sK2,sF6)
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f126,f67]) ).
fof(f67,plain,
( empty_set = sF7
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f126,plain,
( empty_set != sF7
| subset(sK2,sF6) ),
inference(superposition,[],[f40,f54]) ).
fof(f40,plain,
! [X0,X1] :
( empty_set != set_difference(X1,X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f173,plain,
! [X0] :
( ~ subset(X0,sF6)
| sF8 = X0
| empty_set = X0
| sF6 = X0
| sF5 = X0 ),
inference(forward_demodulation,[],[f172,f57]) ).
fof(f172,plain,
! [X0] :
( sF6 = X0
| ~ subset(X0,sF6)
| empty_set = X0
| sF5 = X0
| singleton(sK1) = X0 ),
inference(forward_demodulation,[],[f168,f52]) ).
fof(f168,plain,
! [X0] :
( sF6 = X0
| singleton(sK3) = X0
| empty_set = X0
| ~ subset(X0,sF6)
| singleton(sK1) = X0 ),
inference(superposition,[],[f37,f53]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ subset(X2,unordered_pair(X1,X0))
| singleton(X0) = X2
| empty_set = X2
| singleton(X1) = X2
| unordered_pair(X1,X0) = X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f85,plain,
( ~ spl9_2
| ~ spl9_5 ),
inference(avatar_split_clause,[],[f59,f80,f66]) ).
fof(f59,plain,
( sK2 != sF6
| empty_set != sF7 ),
inference(definition_folding,[],[f43,f54,f53,f53]) ).
fof(f43,plain,
( sK2 != unordered_pair(sK3,sK1)
| empty_set != set_difference(sK2,unordered_pair(sK3,sK1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ( ( sK2 != singleton(sK3)
& empty_set != sK2
& sK2 != singleton(sK1)
& sK2 != unordered_pair(sK3,sK1) )
| empty_set != set_difference(sK2,unordered_pair(sK3,sK1)) )
& ( sK2 = singleton(sK3)
| empty_set = sK2
| sK2 = singleton(sK1)
| sK2 = unordered_pair(sK3,sK1)
| empty_set = set_difference(sK2,unordered_pair(sK3,sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f26,f27]) ).
fof(f27,plain,
( ? [X0,X1,X2] :
( ( ( singleton(X2) != X1
& empty_set != X1
& singleton(X0) != X1
& unordered_pair(X2,X0) != X1 )
| empty_set != set_difference(X1,unordered_pair(X2,X0)) )
& ( singleton(X2) = X1
| empty_set = X1
| singleton(X0) = X1
| unordered_pair(X2,X0) = X1
| empty_set = set_difference(X1,unordered_pair(X2,X0)) ) )
=> ( ( ( sK2 != singleton(sK3)
& empty_set != sK2
& sK2 != singleton(sK1)
& sK2 != unordered_pair(sK3,sK1) )
| empty_set != set_difference(sK2,unordered_pair(sK3,sK1)) )
& ( sK2 = singleton(sK3)
| empty_set = sK2
| sK2 = singleton(sK1)
| sK2 = unordered_pair(sK3,sK1)
| empty_set = set_difference(sK2,unordered_pair(sK3,sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1,X2] :
( ( ( singleton(X2) != X1
& empty_set != X1
& singleton(X0) != X1
& unordered_pair(X2,X0) != X1 )
| empty_set != set_difference(X1,unordered_pair(X2,X0)) )
& ( singleton(X2) = X1
| empty_set = X1
| singleton(X0) = X1
| unordered_pair(X2,X0) = X1
| empty_set = set_difference(X1,unordered_pair(X2,X0)) ) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
? [X2,X1,X0] :
( ( ( singleton(X0) != X1
& empty_set != X1
& singleton(X2) != X1
& unordered_pair(X0,X2) != X1 )
| empty_set != set_difference(X1,unordered_pair(X0,X2)) )
& ( singleton(X0) = X1
| empty_set = X1
| singleton(X2) = X1
| unordered_pair(X0,X2) = X1
| empty_set = set_difference(X1,unordered_pair(X0,X2)) ) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
? [X2,X1,X0] :
( ( ( singleton(X0) != X1
& empty_set != X1
& singleton(X2) != X1
& unordered_pair(X0,X2) != X1 )
| empty_set != set_difference(X1,unordered_pair(X0,X2)) )
& ( singleton(X0) = X1
| empty_set = X1
| singleton(X2) = X1
| unordered_pair(X0,X2) = X1
| empty_set = set_difference(X1,unordered_pair(X0,X2)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
? [X2,X1,X0] :
( empty_set = set_difference(X1,unordered_pair(X0,X2))
<~> ( singleton(X0) = X1
| empty_set = X1
| singleton(X2) = X1
| unordered_pair(X0,X2) = X1 ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X0,X2,X1] :
( ~ ( unordered_pair(X0,X2) != X1
& singleton(X0) != X1
& singleton(X2) != X1
& empty_set != X1 )
<=> empty_set = set_difference(X1,unordered_pair(X0,X2)) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X1,X0,X2] :
( ~ ( singleton(X2) != X0
& empty_set != X0
& unordered_pair(X1,X2) != X0
& singleton(X1) != X0 )
<=> empty_set = set_difference(X0,unordered_pair(X1,X2)) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X1,X0,X2] :
( ~ ( singleton(X2) != X0
& empty_set != X0
& unordered_pair(X1,X2) != X0
& singleton(X1) != X0 )
<=> empty_set = set_difference(X0,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t75_zfmisc_1) ).
fof(f84,plain,
( ~ spl9_2
| ~ spl9_4 ),
inference(avatar_split_clause,[],[f58,f76,f66]) ).
fof(f58,plain,
( sK2 != sF8
| empty_set != sF7 ),
inference(definition_folding,[],[f44,f54,f53,f57]) ).
fof(f44,plain,
( sK2 != singleton(sK1)
| empty_set != set_difference(sK2,unordered_pair(sK3,sK1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f83,plain,
( spl9_3
| spl9_4
| spl9_5
| spl9_2
| spl9_1 ),
inference(avatar_split_clause,[],[f60,f62,f66,f80,f76,f71]) ).
fof(f60,plain,
( empty_set = sK2
| empty_set = sF7
| sK2 = sF6
| sK2 = sF8
| sK2 = sF5 ),
inference(definition_folding,[],[f42,f54,f53,f53,f57,f52]) ).
fof(f42,plain,
( sK2 = singleton(sK3)
| empty_set = sK2
| sK2 = singleton(sK1)
| sK2 = unordered_pair(sK3,sK1)
| empty_set = set_difference(sK2,unordered_pair(sK3,sK1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f74,plain,
( ~ spl9_3
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f55,f66,f71]) ).
fof(f55,plain,
( empty_set != sF7
| sK2 != sF5 ),
inference(definition_folding,[],[f46,f54,f53,f52]) ).
fof(f46,plain,
( sK2 != singleton(sK3)
| empty_set != set_difference(sK2,unordered_pair(sK3,sK1)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f69,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f56,f66,f62]) ).
fof(f56,plain,
( empty_set != sF7
| empty_set != sK2 ),
inference(definition_folding,[],[f45,f54,f53]) ).
fof(f45,plain,
( empty_set != sK2
| empty_set != set_difference(sK2,unordered_pair(sK3,sK1)) ),
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n029.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 : Tue Aug 30 14:40:57 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.50 % (3283)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.51 % (3274)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51 % (3265)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (3265)Instruction limit reached!
% 0.20/0.51 % (3265)------------------------------
% 0.20/0.51 % (3265)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 TRYING [1]
% 0.20/0.51 % (3265)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (3265)Termination reason: Unknown
% 0.20/0.51 % (3265)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (3265)Memory used [KB]: 5373
% 0.20/0.51 % (3265)Time elapsed: 0.115 s
% 0.20/0.51 % (3265)Instructions burned: 3 (million)
% 0.20/0.51 % (3265)------------------------------
% 0.20/0.51 % (3265)------------------------------
% 0.20/0.51 TRYING [2]
% 0.20/0.51 TRYING [3]
% 0.20/0.51 % (3273)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 TRYING [4]
% 0.20/0.52 % (3267)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (3283)First to succeed.
% 0.20/0.52 % (3282)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52 TRYING [5]
% 0.20/0.52 % (3282)Also succeeded, but the first one will report.
% 0.20/0.53 % (3283)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (3283)------------------------------
% 0.20/0.53 % (3283)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (3283)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (3283)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (3283)Memory used [KB]: 5500
% 0.20/0.53 % (3283)Time elapsed: 0.119 s
% 0.20/0.53 % (3283)Instructions burned: 9 (million)
% 0.20/0.53 % (3283)------------------------------
% 0.20/0.53 % (3283)------------------------------
% 0.20/0.53 % (3254)Success in time 0.17 s
%------------------------------------------------------------------------------