TSTP Solution File: COM003_1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : COM003_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n026.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 : Mon Jun 24 04:57:49 EDT 2024
% Result : Theorem 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 61
% Syntax : Number of formulae : 183 ( 8 unt; 20 typ; 0 def)
% Number of atoms : 593 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 740 ( 310 ~; 283 |; 85 &)
% ( 27 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 16 ( 10 >; 6 *; 0 +; 0 <<)
% Number of predicates : 34 ( 33 usr; 30 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-1 aty)
% Number of variables : 214 ( 172 !; 42 ?; 214 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
program: $tType ).
tff(type_def_6,type,
algorithm: $tType ).
tff(type_def_7,type,
input: $tType ).
tff(type_def_8,type,
output: $tType ).
tff(func_def_0,type,
bad: output ).
tff(func_def_1,type,
good: output ).
tff(func_def_2,type,
algorithm_of: program > algorithm ).
tff(func_def_3,type,
as_input: program > input ).
tff(func_def_4,type,
sK2: algorithm ).
tff(func_def_5,type,
sK3: program > program ).
tff(func_def_6,type,
sK4: program ).
tff(func_def_7,type,
sK5: program > program ).
tff(func_def_8,type,
sK6: program ).
tff(func_def_9,type,
sK7: program ).
tff(func_def_10,type,
sK8: algorithm > program ).
tff(func_def_11,type,
sK9: algorithm > input ).
tff(pred_def_1,type,
decides: ( algorithm * program * input ) > $o ).
tff(pred_def_2,type,
halts2: ( program * input ) > $o ).
tff(pred_def_3,type,
halts3: ( program * program * input ) > $o ).
tff(pred_def_4,type,
outputs: ( program * output ) > $o ).
tff(f377,plain,
$false,
inference(avatar_sat_refutation,[],[f73,f77,f89,f93,f101,f105,f109,f114,f118,f126,f130,f137,f144,f151,f153,f157,f181,f226,f257,f297,f306,f318,f322,f326,f331,f342,f353,f356,f360,f376]) ).
tff(f376,plain,
( ~ spl10_5
| spl10_36 ),
inference(avatar_contradiction_clause,[],[f375]) ).
tff(f375,plain,
( $false
| ~ spl10_5
| spl10_36 ),
inference(resolution,[],[f295,f80]) ).
tff(f80,plain,
( ! [X1: program] : halts2(X1,as_input(X1))
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f79]) ).
tff(f79,plain,
( spl10_5
<=> ! [X1: program] : halts2(X1,as_input(X1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
tff(f295,plain,
( ~ halts2(sK3(sK6),as_input(sK3(sK6)))
| spl10_36 ),
inference(avatar_component_clause,[],[f294]) ).
tff(f294,plain,
( spl10_36
<=> halts2(sK3(sK6),as_input(sK3(sK6))) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_36])]) ).
tff(f360,plain,
( ~ spl10_36
| ~ spl10_32
| ~ spl10_4
| ~ spl10_16 ),
inference(avatar_split_clause,[],[f358,f123,f75,f270,f294]) ).
tff(f270,plain,
( spl10_32
<=> halts2(sK6,as_input(sK3(sK6))) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_32])]) ).
tff(f75,plain,
( spl10_4
<=> ! [X0: program] :
( ~ halts2(sK3(X0),as_input(sK3(X0)))
| ~ halts2(X0,as_input(sK3(X0)))
| ~ outputs(X0,good) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
tff(f123,plain,
( spl10_16
<=> outputs(sK6,good) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_16])]) ).
tff(f358,plain,
( ~ halts2(sK6,as_input(sK3(sK6)))
| ~ halts2(sK3(sK6),as_input(sK3(sK6)))
| ~ spl10_4
| ~ spl10_16 ),
inference(resolution,[],[f125,f76]) ).
tff(f76,plain,
( ! [X0: program] :
( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK3(X0)))
| ~ halts2(sK3(X0),as_input(sK3(X0))) )
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f75]) ).
tff(f125,plain,
( outputs(sK6,good)
| ~ spl10_16 ),
inference(avatar_component_clause,[],[f123]) ).
tff(f356,plain,
( ~ spl10_15
| ~ spl10_28 ),
inference(avatar_contradiction_clause,[],[f355]) ).
tff(f355,plain,
( $false
| ~ spl10_15
| ~ spl10_28 ),
inference(resolution,[],[f121,f207]) ).
tff(f207,plain,
( halts2(sK6,as_input(sK6))
| ~ spl10_28 ),
inference(avatar_component_clause,[],[f205]) ).
tff(f205,plain,
( spl10_28
<=> halts2(sK6,as_input(sK6)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_28])]) ).
tff(f121,plain,
( ! [X1: program] : ~ halts2(X1,as_input(X1))
| ~ spl10_15 ),
inference(avatar_component_clause,[],[f120]) ).
tff(f120,plain,
( spl10_15
<=> ! [X1: program] : ~ halts2(X1,as_input(X1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_15])]) ).
tff(f353,plain,
( ~ spl10_20
| spl10_25 ),
inference(avatar_contradiction_clause,[],[f352]) ).
tff(f352,plain,
( $false
| ~ spl10_20
| spl10_25 ),
inference(resolution,[],[f180,f140]) ).
tff(f140,plain,
( ! [X3: program,X4: input] : halts2(X3,X4)
| ~ spl10_20 ),
inference(avatar_component_clause,[],[f139]) ).
tff(f139,plain,
( spl10_20
<=> ! [X4: input,X3: program] : halts2(X3,X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_20])]) ).
tff(f180,plain,
( ~ halts2(sK5(sK7),as_input(sK5(sK7)))
| spl10_25 ),
inference(avatar_component_clause,[],[f178]) ).
tff(f178,plain,
( spl10_25
<=> halts2(sK5(sK7),as_input(sK5(sK7))) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_25])]) ).
tff(f342,plain,
( spl10_24
| ~ spl10_19
| ~ spl10_23 ),
inference(avatar_split_clause,[],[f341,f149,f135,f174]) ).
tff(f174,plain,
( spl10_24
<=> outputs(sK7,good) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_24])]) ).
tff(f135,plain,
( spl10_19
<=> ! [X2: input,X1: program] : decides(algorithm_of(sK7),X1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_19])]) ).
tff(f149,plain,
( spl10_23
<=> ! [X2: input,X0: program,X1: program] :
( outputs(X0,good)
| ~ decides(algorithm_of(X0),X1,X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_23])]) ).
tff(f341,plain,
( outputs(sK7,good)
| ~ spl10_19
| ~ spl10_23 ),
inference(resolution,[],[f150,f136]) ).
tff(f136,plain,
( ! [X2: input,X1: program] : decides(algorithm_of(sK7),X1,X2)
| ~ spl10_19 ),
inference(avatar_component_clause,[],[f135]) ).
tff(f150,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ decides(algorithm_of(X0),X1,X2)
| outputs(X0,good) )
| ~ spl10_23 ),
inference(avatar_component_clause,[],[f149]) ).
tff(f331,plain,
( ~ spl10_22
| ~ spl10_25 ),
inference(avatar_contradiction_clause,[],[f330]) ).
tff(f330,plain,
( $false
| ~ spl10_22
| ~ spl10_25 ),
inference(resolution,[],[f179,f147]) ).
tff(f147,plain,
( ! [X3: program,X4: input] : ~ halts2(X3,X4)
| ~ spl10_22 ),
inference(avatar_component_clause,[],[f146]) ).
tff(f146,plain,
( spl10_22
<=> ! [X4: input,X3: program] : ~ halts2(X3,X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_22])]) ).
tff(f179,plain,
( halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ spl10_25 ),
inference(avatar_component_clause,[],[f178]) ).
tff(f326,plain,
( ~ spl10_26
| spl10_25
| ~ spl10_11
| ~ spl10_19 ),
inference(avatar_split_clause,[],[f325,f135,f103,f178,f183]) ).
tff(f183,plain,
( spl10_26
<=> outputs(sK7,bad) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_26])]) ).
tff(f103,plain,
( spl10_11
<=> ! [X0: program] :
( ~ outputs(X0,bad)
| halts2(sK5(X0),as_input(sK5(X0)))
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
tff(f325,plain,
( halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ outputs(sK7,bad)
| ~ spl10_11
| ~ spl10_19 ),
inference(duplicate_literal_removal,[],[f323]) ).
tff(f323,plain,
( halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ outputs(sK7,bad)
| halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ spl10_11
| ~ spl10_19 ),
inference(resolution,[],[f104,f168]) ).
tff(f168,plain,
( ! [X0: program,X1: input] :
( halts3(sK7,X0,X1)
| halts2(X0,X1) )
| ~ spl10_19 ),
inference(resolution,[],[f58,f136]) ).
tff(f58,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( ~ decides(algorithm_of(X0),X1,X2)
| halts2(X3,X4)
| halts3(X0,X3,X4) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0: program,X1: program,X2: input] :
( ! [X3: program,X4: input] :
( ( ( outputs(X0,bad)
& halts3(X0,X3,X4) )
| halts2(X3,X4) )
& ( ( outputs(X0,good)
& halts3(X0,X3,X4) )
| ~ halts2(X3,X4) ) )
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: program,X1: program,X2: input] :
( decides(algorithm_of(X0),X1,X2)
=> ! [X3: program,X4: input] :
( ( ~ halts2(X3,X4)
=> ( outputs(X0,bad)
& halts3(X0,X3,X4) ) )
& ( halts2(X3,X4)
=> ( outputs(X0,good)
& halts3(X0,X3,X4) ) ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X3: program,X1: program,X2: input] :
( decides(algorithm_of(X3),X1,X2)
=> ! [X1: program,X2: input] :
( ( ~ halts2(X1,X2)
=> ( outputs(X3,bad)
& halts3(X3,X1,X2) ) )
& ( halts2(X1,X2)
=> ( outputs(X3,good)
& halts3(X3,X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f104,plain,
( ! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| halts2(sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad) )
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f103]) ).
tff(f322,plain,
( ~ spl10_25
| ~ spl10_26
| ~ spl10_24
| ~ spl10_10
| ~ spl10_19 ),
inference(avatar_split_clause,[],[f320,f135,f99,f174,f183,f178]) ).
tff(f99,plain,
( spl10_10
<=> ! [X0: program] :
( ~ outputs(X0,bad)
| ~ outputs(X0,good)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
tff(f320,plain,
( ~ outputs(sK7,good)
| ~ outputs(sK7,bad)
| ~ halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ spl10_10
| ~ spl10_19 ),
inference(resolution,[],[f100,f167]) ).
tff(f167,plain,
( ! [X0: program,X1: input] :
( halts3(sK7,X0,X1)
| ~ halts2(X0,X1) )
| ~ spl10_19 ),
inference(resolution,[],[f56,f136]) ).
tff(f56,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( ~ decides(algorithm_of(X0),X1,X2)
| ~ halts2(X3,X4)
| halts3(X0,X3,X4) ),
inference(cnf_transformation,[],[f16]) ).
tff(f100,plain,
( ! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good)
| ~ outputs(X0,bad) )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f99]) ).
tff(f318,plain,
( spl10_26
| ~ spl10_19
| ~ spl10_21 ),
inference(avatar_split_clause,[],[f317,f142,f135,f183]) ).
tff(f142,plain,
( spl10_21
<=> ! [X2: input,X0: program,X1: program] :
( outputs(X0,bad)
| ~ decides(algorithm_of(X0),X1,X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_21])]) ).
tff(f317,plain,
( outputs(sK7,bad)
| ~ spl10_19
| ~ spl10_21 ),
inference(resolution,[],[f143,f136]) ).
tff(f143,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ decides(algorithm_of(X0),X1,X2)
| outputs(X0,bad) )
| ~ spl10_21 ),
inference(avatar_component_clause,[],[f142]) ).
tff(f306,plain,
( ~ spl10_14
| ~ spl10_17
| spl10_32 ),
inference(avatar_contradiction_clause,[],[f304]) ).
tff(f304,plain,
( $false
| ~ spl10_14
| ~ spl10_17
| spl10_32 ),
inference(resolution,[],[f272,f216]) ).
tff(f216,plain,
( ! [X0: program] : halts2(sK6,as_input(X0))
| ~ spl10_14
| ~ spl10_17 ),
inference(duplicate_literal_removal,[],[f211]) ).
tff(f211,plain,
( ! [X0: program] :
( halts2(sK6,as_input(X0))
| halts2(sK6,as_input(X0)) )
| ~ spl10_14
| ~ spl10_17 ),
inference(resolution,[],[f129,f117]) ).
tff(f117,plain,
( ! [X1: program] :
( halts2(sK6,as_input(X1))
| halts2(X1,as_input(X1)) )
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f116]) ).
tff(f116,plain,
( spl10_14
<=> ! [X1: program] :
( halts2(sK6,as_input(X1))
| halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_14])]) ).
tff(f129,plain,
( ! [X1: program] :
( ~ halts2(X1,as_input(X1))
| halts2(sK6,as_input(X1)) )
| ~ spl10_17 ),
inference(avatar_component_clause,[],[f128]) ).
tff(f128,plain,
( spl10_17
<=> ! [X1: program] :
( halts2(sK6,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_17])]) ).
tff(f272,plain,
( ~ halts2(sK6,as_input(sK3(sK6)))
| spl10_32 ),
inference(avatar_component_clause,[],[f270]) ).
tff(f297,plain,
( ~ spl10_32
| spl10_36
| ~ spl10_3
| ~ spl10_13 ),
inference(avatar_split_clause,[],[f277,f111,f71,f294,f270]) ).
tff(f71,plain,
( spl10_3
<=> ! [X0: program] :
( ~ outputs(X0,bad)
| halts2(sK3(X0),as_input(sK3(X0)))
| ~ halts2(X0,as_input(sK3(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
tff(f111,plain,
( spl10_13
<=> outputs(sK6,bad) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).
tff(f277,plain,
( halts2(sK3(sK6),as_input(sK3(sK6)))
| ~ halts2(sK6,as_input(sK3(sK6)))
| ~ spl10_3
| ~ spl10_13 ),
inference(resolution,[],[f72,f113]) ).
tff(f113,plain,
( outputs(sK6,bad)
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f111]) ).
tff(f72,plain,
( ! [X0: program] :
( ~ outputs(X0,bad)
| halts2(sK3(X0),as_input(sK3(X0)))
| ~ halts2(X0,as_input(sK3(X0))) )
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f71]) ).
tff(f257,plain,
( ~ spl10_7
| ~ spl10_8 ),
inference(avatar_contradiction_clause,[],[f252]) ).
tff(f252,plain,
( $false
| ~ spl10_7
| ~ spl10_8 ),
inference(resolution,[],[f164,f160]) ).
tff(f160,plain,
( halts2(sK4,as_input(sK4))
| ~ spl10_7 ),
inference(factoring,[],[f88]) ).
tff(f88,plain,
( ! [X1: program] :
( halts2(sK4,as_input(X1))
| halts2(X1,as_input(X1)) )
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f87]) ).
tff(f87,plain,
( spl10_7
<=> ! [X1: program] :
( halts2(sK4,as_input(X1))
| halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
tff(f164,plain,
( ~ halts2(sK4,as_input(sK4))
| ~ spl10_7
| ~ spl10_8 ),
inference(resolution,[],[f92,f160]) ).
tff(f92,plain,
( ! [X1: program] :
( ~ halts2(X1,as_input(X1))
| ~ halts2(sK4,as_input(X1)) )
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f91]) ).
tff(f91,plain,
( spl10_8
<=> ! [X1: program] :
( ~ halts2(sK4,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
tff(f226,plain,
( spl10_28
| ~ spl10_14
| ~ spl10_17 ),
inference(avatar_split_clause,[],[f215,f128,f116,f205]) ).
tff(f215,plain,
( halts2(sK6,as_input(sK6))
| ~ spl10_14
| ~ spl10_17 ),
inference(duplicate_literal_removal,[],[f213]) ).
tff(f213,plain,
( halts2(sK6,as_input(sK6))
| halts2(sK6,as_input(sK6))
| ~ spl10_14
| ~ spl10_17 ),
inference(resolution,[],[f129,f117]) ).
tff(f181,plain,
( ~ spl10_24
| ~ spl10_25
| ~ spl10_12
| ~ spl10_19 ),
inference(avatar_split_clause,[],[f172,f135,f107,f178,f174]) ).
tff(f107,plain,
( spl10_12
<=> ! [X0: program] :
( ~ halts2(sK5(X0),as_input(sK5(X0)))
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_12])]) ).
tff(f172,plain,
( ~ halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ outputs(sK7,good)
| ~ spl10_12
| ~ spl10_19 ),
inference(duplicate_literal_removal,[],[f169]) ).
tff(f169,plain,
( ~ halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ halts2(sK5(sK7),as_input(sK5(sK7)))
| ~ outputs(sK7,good)
| ~ spl10_12
| ~ spl10_19 ),
inference(resolution,[],[f167,f108]) ).
tff(f108,plain,
( ! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ halts2(sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good) )
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f107]) ).
tff(f157,plain,
~ spl10_18,
inference(avatar_contradiction_clause,[],[f156]) ).
tff(f156,plain,
( $false
| ~ spl10_18 ),
inference(resolution,[],[f133,f39]) ).
tff(f39,plain,
! [X2: input,X1: program] : decides(sK2,X1,X2),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X1: program,X2: input] : decides(sK2,X1,X2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f8,f21]) ).
tff(f21,plain,
( ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2)
=> ! [X2: input,X1: program] : decides(sK2,X1,X2) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2),
inference(flattening,[],[f7]) ).
tff(f7,plain,
~ ~ ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2),
inference(rectify,[],[f6]) ).
tff(f6,negated_conjecture,
~ ~ ? [X6: algorithm] :
! [X7: program,X8: input] : decides(X6,X7,X8),
inference(negated_conjecture,[],[f5]) ).
tff(f5,conjecture,
~ ? [X6: algorithm] :
! [X7: program,X8: input] : decides(X6,X7,X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f133,plain,
( ! [X3: algorithm] : ~ decides(X3,sK8(X3),sK9(X3))
| ~ spl10_18 ),
inference(avatar_component_clause,[],[f132]) ).
tff(f132,plain,
( spl10_18
<=> ! [X3: algorithm] : ~ decides(X3,sK8(X3),sK9(X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_18])]) ).
tff(f153,plain,
( ~ spl10_20
| ~ spl10_22 ),
inference(avatar_contradiction_clause,[],[f152]) ).
tff(f152,plain,
( $false
| ~ spl10_20
| ~ spl10_22 ),
inference(resolution,[],[f147,f140]) ).
tff(f151,plain,
( spl10_22
| spl10_23 ),
inference(avatar_split_clause,[],[f57,f149,f146]) ).
tff(f57,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( outputs(X0,good)
| ~ halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f16]) ).
tff(f144,plain,
( spl10_20
| spl10_21 ),
inference(avatar_split_clause,[],[f59,f142,f139]) ).
tff(f59,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( outputs(X0,bad)
| halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f16]) ).
tff(f137,plain,
( spl10_18
| spl10_19 ),
inference(avatar_split_clause,[],[f55,f135,f132]) ).
tff(f55,plain,
! [X2: input,X3: algorithm,X1: program] :
( decides(algorithm_of(sK7),X1,X2)
| ~ decides(X3,sK8(X3),sK9(X3)) ),
inference(cnf_transformation,[],[f38]) ).
tff(f38,plain,
( ! [X1: program,X2: input] : decides(algorithm_of(sK7),X1,X2)
| ! [X3: algorithm] : ~ decides(X3,sK8(X3),sK9(X3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f35,f37,f36]) ).
tff(f36,plain,
( ? [X0: program] :
! [X1: program,X2: input] : decides(algorithm_of(X0),X1,X2)
=> ! [X2: input,X1: program] : decides(algorithm_of(sK7),X1,X2) ),
introduced(choice_axiom,[]) ).
tff(f37,plain,
! [X3: algorithm] :
( ? [X4: program,X5: input] : ~ decides(X3,X4,X5)
=> ~ decides(X3,sK8(X3),sK9(X3)) ),
introduced(choice_axiom,[]) ).
tff(f35,plain,
( ? [X0: program] :
! [X1: program,X2: input] : decides(algorithm_of(X0),X1,X2)
| ! [X3: algorithm] :
? [X4: program,X5: input] : ~ decides(X3,X4,X5) ),
inference(rectify,[],[f15]) ).
tff(f15,plain,
( ? [X3: program] :
! [X4: program,X5: input] : decides(algorithm_of(X3),X4,X5)
| ! [X0: algorithm] :
? [X1: program,X2: input] : ~ decides(X0,X1,X2) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
( ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2)
=> ? [X3: program] :
! [X4: program,X5: input] : decides(algorithm_of(X3),X4,X5) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
( ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2)
=> ? [X3: program] :
! [X1: program,X2: input] : decides(algorithm_of(X3),X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f130,plain,
( spl10_9
| spl10_17 ),
inference(avatar_split_clause,[],[f51,f128,f95]) ).
tff(f95,plain,
( spl10_9
<=> sP1 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
tff(f51,plain,
! [X1: program] :
( halts2(sK6,as_input(X1))
| ~ halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
( ! [X1: program] :
( ( ( outputs(sK6,bad)
& halts2(sK6,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ( outputs(sK6,good)
& halts2(sK6,as_input(X1)) )
| ~ halts2(X1,as_input(X1)) ) )
| sP1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f32,f33]) ).
tff(f33,plain,
( ? [X0: program] :
! [X1: program] :
( ( ( outputs(X0,bad)
& halts2(X0,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ( outputs(X0,good)
& halts2(X0,as_input(X1)) )
| ~ halts2(X1,as_input(X1)) ) )
=> ! [X1: program] :
( ( ( outputs(sK6,bad)
& halts2(sK6,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ( outputs(sK6,good)
& halts2(sK6,as_input(X1)) )
| ~ halts2(X1,as_input(X1)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f32,plain,
( ? [X0: program] :
! [X1: program] :
( ( ( outputs(X0,bad)
& halts2(X0,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ( outputs(X0,good)
& halts2(X0,as_input(X1)) )
| ~ halts2(X1,as_input(X1)) ) )
| sP1 ),
inference(rectify,[],[f20]) ).
tff(f20,plain,
( ? [X2: program] :
! [X3: program] :
( ( ( outputs(X2,bad)
& halts2(X2,as_input(X3)) )
| halts2(X3,as_input(X3)) )
& ( ( outputs(X2,good)
& halts2(X2,as_input(X3)) )
| ~ halts2(X3,as_input(X3)) ) )
| sP1 ),
inference(definition_folding,[],[f14,f19]) ).
tff(f19,plain,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,X1,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,X1,as_input(X1)) )
& halts2(X1,as_input(X1)) ) )
| ~ sP1 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
tff(f14,plain,
( ? [X2: program] :
! [X3: program] :
( ( ( outputs(X2,bad)
& halts2(X2,as_input(X3)) )
| halts2(X3,as_input(X3)) )
& ( ( outputs(X2,good)
& halts2(X2,as_input(X3)) )
| ~ halts2(X3,as_input(X3)) ) )
| ! [X0: program] :
? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,X1,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,X1,as_input(X1)) )
& halts2(X1,as_input(X1)) ) ) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,plain,
( ? [X0: program] :
! [X1: program] :
( ( ~ halts2(X1,as_input(X1))
=> ( outputs(X0,bad)
& halts3(X0,X1,as_input(X1)) ) )
& ( halts2(X1,as_input(X1))
=> ( outputs(X0,good)
& halts3(X0,X1,as_input(X1)) ) ) )
=> ? [X2: program] :
! [X3: program] :
( ( ~ halts2(X3,as_input(X3))
=> ( outputs(X2,bad)
& halts2(X2,as_input(X3)) ) )
& ( halts2(X3,as_input(X3))
=> ( outputs(X2,good)
& halts2(X2,as_input(X3)) ) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
( ? [X3: program] :
! [X1: program] :
( ( ~ halts2(X1,as_input(X1))
=> ( outputs(X3,bad)
& halts3(X3,X1,as_input(X1)) ) )
& ( halts2(X1,as_input(X1))
=> ( outputs(X3,good)
& halts3(X3,X1,as_input(X1)) ) ) )
=> ? [X4: program] :
! [X1: program] :
( ( ~ halts2(X1,as_input(X1))
=> ( outputs(X4,bad)
& halts2(X4,as_input(X1)) ) )
& ( halts2(X1,as_input(X1))
=> ( outputs(X4,good)
& halts2(X4,as_input(X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f126,plain,
( spl10_9
| spl10_15
| spl10_16 ),
inference(avatar_split_clause,[],[f52,f123,f120,f95]) ).
tff(f52,plain,
! [X1: program] :
( outputs(sK6,good)
| ~ halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f34]) ).
tff(f118,plain,
( spl10_9
| spl10_14 ),
inference(avatar_split_clause,[],[f53,f116,f95]) ).
tff(f53,plain,
! [X1: program] :
( halts2(sK6,as_input(X1))
| halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f34]) ).
tff(f114,plain,
( spl10_9
| spl10_5
| spl10_13 ),
inference(avatar_split_clause,[],[f54,f111,f79,f95]) ).
tff(f54,plain,
! [X1: program] :
( outputs(sK6,bad)
| halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f34]) ).
tff(f109,plain,
( ~ spl10_9
| spl10_12 ),
inference(avatar_split_clause,[],[f48,f107,f95]) ).
tff(f48,plain,
! [X0: program] :
( ~ halts2(sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ sP1 ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
( ! [X0: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) )
& ~ halts2(sK5(X0),as_input(sK5(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) )
& halts2(sK5(X0),as_input(sK5(X0))) ) )
| ~ sP1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f29,f30]) ).
tff(f30,plain,
! [X0: program] :
( ? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,X1,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,X1,as_input(X1)) )
& halts2(X1,as_input(X1)) ) )
=> ( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) )
& ~ halts2(sK5(X0),as_input(sK5(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) )
& halts2(sK5(X0),as_input(sK5(X0))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,X1,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,X1,as_input(X1)) )
& halts2(X1,as_input(X1)) ) )
| ~ sP1 ),
inference(nnf_transformation,[],[f19]) ).
tff(f105,plain,
( ~ spl10_9
| spl10_11 ),
inference(avatar_split_clause,[],[f49,f103,f95]) ).
tff(f49,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| halts2(sK5(X0),as_input(sK5(X0)))
| ~ sP1 ),
inference(cnf_transformation,[],[f31]) ).
tff(f101,plain,
( ~ spl10_9
| spl10_10 ),
inference(avatar_split_clause,[],[f60,f99,f95]) ).
tff(f60,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good)
| ~ sP1 ),
inference(duplicate_literal_removal,[],[f50]) ).
tff(f50,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ sP1 ),
inference(cnf_transformation,[],[f31]) ).
tff(f93,plain,
( spl10_1
| spl10_8 ),
inference(avatar_split_clause,[],[f44,f91,f63]) ).
tff(f63,plain,
( spl10_1
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
tff(f44,plain,
! [X1: program] :
( ~ halts2(sK4,as_input(X1))
| ~ halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
( ! [X1: program] :
( ( ( outputs(sK4,bad)
& halts2(sK4,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ~ halts2(sK4,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) )
| sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f26,f27]) ).
tff(f27,plain,
( ? [X0: program] :
! [X1: program] :
( ( ( outputs(X0,bad)
& halts2(X0,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ~ halts2(X0,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) )
=> ! [X1: program] :
( ( ( outputs(sK4,bad)
& halts2(sK4,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ~ halts2(sK4,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
( ? [X0: program] :
! [X1: program] :
( ( ( outputs(X0,bad)
& halts2(X0,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ~ halts2(X0,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) )
| sP0 ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
( ? [X2: program] :
! [X3: program] :
( ( ( outputs(X2,bad)
& halts2(X2,as_input(X3)) )
| halts2(X3,as_input(X3)) )
& ( ~ halts2(X2,as_input(X3))
| ~ halts2(X3,as_input(X3)) ) )
| sP0 ),
inference(definition_folding,[],[f13,f17]) ).
tff(f17,plain,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(X1)) )
& halts2(X1,as_input(X1)) ) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f13,plain,
( ? [X2: program] :
! [X3: program] :
( ( ( outputs(X2,bad)
& halts2(X2,as_input(X3)) )
| halts2(X3,as_input(X3)) )
& ( ~ halts2(X2,as_input(X3))
| ~ halts2(X3,as_input(X3)) ) )
| ! [X0: program] :
? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(X1)) )
& halts2(X1,as_input(X1)) ) ) ),
inference(ennf_transformation,[],[f9]) ).
tff(f9,plain,
( ? [X0: program] :
! [X1: program] :
( ( ~ halts2(X1,as_input(X1))
=> ( outputs(X0,bad)
& halts2(X0,as_input(X1)) ) )
& ( halts2(X1,as_input(X1))
=> ( outputs(X0,good)
& halts2(X0,as_input(X1)) ) ) )
=> ? [X2: program] :
! [X3: program] :
( ( ~ halts2(X3,as_input(X3))
=> ( outputs(X2,bad)
& halts2(X2,as_input(X3)) ) )
& ( halts2(X3,as_input(X3))
=> ~ halts2(X2,as_input(X3)) ) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
( ? [X4: program] :
! [X1: program] :
( ( ~ halts2(X1,as_input(X1))
=> ( outputs(X4,bad)
& halts2(X4,as_input(X1)) ) )
& ( halts2(X1,as_input(X1))
=> ( outputs(X4,good)
& halts2(X4,as_input(X1)) ) ) )
=> ? [X5: program] :
! [X1: program] :
( ( ~ halts2(X1,as_input(X1))
=> ( outputs(X5,bad)
& halts2(X5,as_input(X1)) ) )
& ( halts2(X1,as_input(X1))
=> ~ halts2(X5,as_input(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f89,plain,
( spl10_1
| spl10_7 ),
inference(avatar_split_clause,[],[f45,f87,f63]) ).
tff(f45,plain,
! [X1: program] :
( halts2(sK4,as_input(X1))
| halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f28]) ).
tff(f77,plain,
( ~ spl10_1
| spl10_4 ),
inference(avatar_split_clause,[],[f41,f75,f63]) ).
tff(f41,plain,
! [X0: program] :
( ~ halts2(sK3(X0),as_input(sK3(X0)))
| ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK3(X0)))
| ~ sP0 ),
inference(cnf_transformation,[],[f25]) ).
tff(f25,plain,
( ! [X0: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(sK3(X0))) )
& ~ halts2(sK3(X0),as_input(sK3(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK3(X0))) )
& halts2(sK3(X0),as_input(sK3(X0))) ) )
| ~ sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f23,f24]) ).
tff(f24,plain,
! [X0: program] :
( ? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(X1)) )
& halts2(X1,as_input(X1)) ) )
=> ( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(sK3(X0))) )
& ~ halts2(sK3(X0),as_input(sK3(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK3(X0))) )
& halts2(sK3(X0),as_input(sK3(X0))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f23,plain,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(X1)) )
& ~ halts2(X1,as_input(X1)) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(X1)) )
& halts2(X1,as_input(X1)) ) )
| ~ sP0 ),
inference(nnf_transformation,[],[f17]) ).
tff(f73,plain,
( ~ spl10_1
| spl10_3 ),
inference(avatar_split_clause,[],[f42,f71,f63]) ).
tff(f42,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(sK3(X0)))
| halts2(sK3(X0),as_input(sK3(X0)))
| ~ sP0 ),
inference(cnf_transformation,[],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM003_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 00:14:54 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.35 This is a TF0_THM_NEQ_NAR problem
% 0.21/0.35 Running first-order theorem proving
% 0.21/0.35 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.39 % (29719)dis+1002_1:1_tgt=full:sos=on:rp=on:sac=on:i=258102:ss=axioms:sd=3:cond=fast:add=off:abs=on:fde=none:sil=256000_0 on theBenchmark for (2999ds/258102Mi)
% 0.21/0.39 % (29719)Refutation not found, incomplete strategy% (29719)------------------------------
% 0.21/0.39 % (29719)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.39 % (29719)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.39 % (29719)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.39
% 0.21/0.39 % (29719)Memory used [KB]: 1042
% 0.21/0.39 % (29719)Time elapsed: 0.002 s
% 0.21/0.39 % (29719)Instructions burned: 1 (million)
% 0.21/0.39 % (29719)------------------------------
% 0.21/0.39 % (29719)------------------------------
% 0.21/0.42 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (29720)lrs+21_8:1_to=lpo:sil=2000:sp=frequency:spb=units:s2a=on:s2pl=no:i=103:sd=2:ss=included:fsr=off:fs=off_0 on theBenchmark for (2999ds/103Mi)
% 0.21/0.42 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (29717)lrs+21_1:32_anc=all:to=lpo:sil=256000:plsq=on:plsqr=32,1:sp=occurrence:sos=on:plsql=on:sac=on:newcnf=on:i=222662:add=off:fsr=off:rawr=on_0 on theBenchmark for (2999ds/222662Mi)
% 0.21/0.42 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (29722)lrs+10_8:1_to=lpo:drc=encompass:sil=4000:sos=on:urr=on:newcnf=on:i=116:sd=2:nm=2:ss=axioms:sgt=32:sup=off:bd=off_0 on theBenchmark for (2999ds/116Mi)
% 0.21/0.42 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (29721)lrs+1011_4:1_to=lpo:drc=off:sil=8000:sp=frequency:abs=on:urr=on:lsd=10:nwc=5.0:s2agt=4:newcnf=on:st=5.0:s2a=on:i=107:ss=axioms:aac=none:br=off:bd=preordered_0 on theBenchmark for (2999ds/107Mi)
% 0.21/0.42 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (29718)lrs+1011_4:1_sil=256000:rp=on:newcnf=on:i=257909:aac=none:gsp=on_0 on theBenchmark for (2999ds/257909Mi)
% 0.21/0.42 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (29723)lrs+1011_1:13_sil=2000:tgt=full:sims=off:sp=occurrence:abs=on:newcnf=on:i=104:nm=4:ss=axioms:rawr=on:amm=off_0 on theBenchmark for (2999ds/104Mi)
% 0.21/0.42 % (29723)Refutation not found, incomplete strategy% (29723)------------------------------
% 0.21/0.42 % (29723)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (29723)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (29723)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (29723)Memory used [KB]: 1042
% 0.21/0.42 % (29723)Time elapsed: 0.002 s
% 0.21/0.42 % (29723)Instructions burned: 1 (million)
% 0.21/0.42 % (29717)Refutation not found, incomplete strategy% (29717)------------------------------
% 0.21/0.42 % (29717)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.42 % (29717)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.42 % (29717)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (29717)Memory used [KB]: 1059
% 0.21/0.42 % (29717)Time elapsed: 0.003 s
% 0.21/0.42 % (29717)Instructions burned: 2 (million)
% 0.21/0.42 % (29723)------------------------------
% 0.21/0.42 % (29723)------------------------------
% 0.21/0.42 % (29717)------------------------------
% 0.21/0.42 % (29717)------------------------------
% 0.21/0.42 % (29720)First to succeed.
% 0.21/0.42 % (29721)Also succeeded, but the first one will report.
% 0.21/0.42 % (29722)Also succeeded, but the first one will report.
% 0.21/0.42 % (29718)Also succeeded, but the first one will report.
% 0.21/0.42 % (29720)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29712"
% 0.21/0.43 % (29712)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (29720)Refutation found. Thanks to Tanya!
% 0.21/0.43 % SZS status Theorem for theBenchmark
% 0.21/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.43 % (29720)------------------------------
% 0.21/0.43 % (29720)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.43 % (29720)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.43 % (29720)Termination reason: Refutation
% 0.21/0.43
% 0.21/0.43 % (29720)Memory used [KB]: 1228
% 0.21/0.43 % (29720)Time elapsed: 0.009 s
% 0.21/0.43 % (29720)Instructions burned: 10 (million)
% 0.21/0.43 % (29720)------------------------------
% 0.21/0.43 % (29720)------------------------------
% 0.21/0.43 % (29712)Success in time 0.064 s
%------------------------------------------------------------------------------