TSTP Solution File: COM003_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM003_1 : TPTP v8.1.2. Released v5.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 : 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 : Sun May 5 04:46:06 EDT 2024
% Result : Theorem 0.65s 0.82s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 56
% Syntax : Number of formulae : 171 ( 8 unt; 20 typ; 0 def)
% Number of atoms : 584 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 759 ( 326 ~; 291 |; 85 &)
% ( 22 <=>; 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 : 29 ( 28 usr; 25 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-1 aty)
% Number of variables : 226 ( 184 !; 42 ?; 226 :)
% 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 ).
tff(func_def_6,type,
sK4: algorithm > program ).
tff(func_def_7,type,
sK5: algorithm > input ).
tff(func_def_8,type,
sK6: program > program ).
tff(func_def_9,type,
sK7: program ).
tff(func_def_10,type,
sK8: program > program ).
tff(func_def_11,type,
sK9: program ).
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(f254,plain,
$false,
inference(avatar_sat_refutation,[],[f68,f75,f83,f95,f99,f111,f115,f123,f127,f136,f140,f148,f152,f154,f159,f177,f185,f190,f192,f202,f210,f234,f237,f253]) ).
tff(f253,plain,
( ~ spl10_10
| ~ spl10_11
| ~ spl10_20
| ~ spl10_22
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f252]) ).
tff(f252,plain,
( $false
| ~ spl10_10
| ~ spl10_11
| ~ spl10_20
| ~ spl10_22
| ~ spl10_23 ),
inference(subsumption_resolution,[],[f251,f214]) ).
tff(f214,plain,
( ! [X1: program] : halts2(sK9,as_input(X1))
| ~ spl10_20
| ~ spl10_23 ),
inference(subsumption_resolution,[],[f139,f151]) ).
tff(f151,plain,
( ! [X1: program] :
( halts2(sK9,as_input(X1))
| ~ halts2(X1,as_input(X1)) )
| ~ spl10_23 ),
inference(avatar_component_clause,[],[f150]) ).
tff(f150,plain,
( spl10_23
<=> ! [X1: program] :
( halts2(sK9,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_23])]) ).
tff(f139,plain,
( ! [X1: program] :
( halts2(sK9,as_input(X1))
| halts2(X1,as_input(X1)) )
| ~ spl10_20 ),
inference(avatar_component_clause,[],[f138]) ).
tff(f138,plain,
( spl10_20
<=> ! [X1: program] :
( halts2(sK9,as_input(X1))
| halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_20])]) ).
tff(f251,plain,
( ~ halts2(sK9,as_input(sK6(sK9)))
| ~ spl10_10
| ~ spl10_11
| ~ spl10_22 ),
inference(resolution,[],[f239,f147]) ).
tff(f147,plain,
( outputs(sK9,good)
| ~ spl10_22 ),
inference(avatar_component_clause,[],[f145]) ).
tff(f145,plain,
( spl10_22
<=> outputs(sK9,good) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_22])]) ).
tff(f239,plain,
( ! [X0: program] :
( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK6(X0))) )
| ~ spl10_10
| ~ spl10_11 ),
inference(resolution,[],[f102,f98]) ).
tff(f98,plain,
( ! [X0: program] :
( ~ halts2(sK6(X0),as_input(sK6(X0)))
| ~ halts2(X0,as_input(sK6(X0)))
| ~ outputs(X0,good) )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f97]) ).
tff(f97,plain,
( spl10_10
<=> ! [X0: program] :
( ~ halts2(sK6(X0),as_input(sK6(X0)))
| ~ halts2(X0,as_input(sK6(X0)))
| ~ outputs(X0,good) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
tff(f102,plain,
( ! [X1: program] : halts2(X1,as_input(X1))
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f101]) ).
tff(f101,plain,
( spl10_11
<=> ! [X1: program] : halts2(X1,as_input(X1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
tff(f237,plain,
( ~ spl10_13
| ~ spl10_14 ),
inference(avatar_contradiction_clause,[],[f236]) ).
tff(f236,plain,
( $false
| ~ spl10_13
| ~ spl10_14 ),
inference(subsumption_resolution,[],[f235,f114]) ).
tff(f114,plain,
( ! [X1: program] :
( ~ halts2(sK7,as_input(X1))
| ~ halts2(X1,as_input(X1)) )
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f113]) ).
tff(f113,plain,
( spl10_14
<=> ! [X1: program] :
( ~ halts2(sK7,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_14])]) ).
tff(f235,plain,
( halts2(sK7,as_input(sK7))
| ~ spl10_13 ),
inference(factoring,[],[f110]) ).
tff(f110,plain,
( ! [X1: program] :
( halts2(sK7,as_input(X1))
| halts2(X1,as_input(X1)) )
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f109]) ).
tff(f109,plain,
( spl10_13
<=> ! [X1: program] :
( halts2(sK7,as_input(X1))
| halts2(X1,as_input(X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).
tff(f234,plain,
( ~ spl10_9
| ~ spl10_10
| ~ spl10_19
| ~ spl10_20
| ~ spl10_22
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f233]) ).
tff(f233,plain,
( $false
| ~ spl10_9
| ~ spl10_10
| ~ spl10_19
| ~ spl10_20
| ~ spl10_22
| ~ spl10_23 ),
inference(subsumption_resolution,[],[f232,f147]) ).
tff(f232,plain,
( ~ outputs(sK9,good)
| ~ spl10_9
| ~ spl10_10
| ~ spl10_19
| ~ spl10_20
| ~ spl10_23 ),
inference(subsumption_resolution,[],[f231,f214]) ).
tff(f231,plain,
( ~ halts2(sK9,as_input(sK6(sK9)))
| ~ outputs(sK9,good)
| ~ spl10_9
| ~ spl10_10
| ~ spl10_19
| ~ spl10_20
| ~ spl10_23 ),
inference(resolution,[],[f230,f98]) ).
tff(f230,plain,
( halts2(sK6(sK9),as_input(sK6(sK9)))
| ~ spl10_9
| ~ spl10_19
| ~ spl10_20
| ~ spl10_23 ),
inference(subsumption_resolution,[],[f229,f135]) ).
tff(f135,plain,
( outputs(sK9,bad)
| ~ spl10_19 ),
inference(avatar_component_clause,[],[f133]) ).
tff(f133,plain,
( spl10_19
<=> outputs(sK9,bad) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_19])]) ).
tff(f229,plain,
( halts2(sK6(sK9),as_input(sK6(sK9)))
| ~ outputs(sK9,bad)
| ~ spl10_9
| ~ spl10_20
| ~ spl10_23 ),
inference(resolution,[],[f214,f94]) ).
tff(f94,plain,
( ! [X0: program] :
( ~ halts2(X0,as_input(sK6(X0)))
| halts2(sK6(X0),as_input(sK6(X0)))
| ~ outputs(X0,bad) )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f93]) ).
tff(f93,plain,
( spl10_9
<=> ! [X0: program] :
( ~ outputs(X0,bad)
| halts2(sK6(X0),as_input(sK6(X0)))
| ~ halts2(X0,as_input(sK6(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
tff(f210,plain,
( ~ spl10_20
| ~ spl10_21 ),
inference(avatar_contradiction_clause,[],[f209]) ).
tff(f209,plain,
( $false
| ~ spl10_20
| ~ spl10_21 ),
inference(resolution,[],[f204,f143]) ).
tff(f143,plain,
( ! [X1: program] : ~ halts2(X1,as_input(X1))
| ~ spl10_21 ),
inference(avatar_component_clause,[],[f142]) ).
tff(f142,plain,
( spl10_21
<=> ! [X1: program] : ~ halts2(X1,as_input(X1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_21])]) ).
tff(f204,plain,
( ! [X1: program] : halts2(sK9,as_input(X1))
| ~ spl10_20
| ~ spl10_21 ),
inference(subsumption_resolution,[],[f139,f143]) ).
tff(f202,plain,
( ~ spl10_6
| spl10_25 ),
inference(avatar_contradiction_clause,[],[f201]) ).
tff(f201,plain,
( $false
| ~ spl10_6
| spl10_25 ),
inference(subsumption_resolution,[],[f198,f82]) ).
tff(f82,plain,
( ! [X2: input,X1: program] : decides(algorithm_of(sK3),X1,X2)
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f81]) ).
tff(f81,plain,
( spl10_6
<=> ! [X2: input,X1: program] : decides(algorithm_of(sK3),X1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
tff(f198,plain,
( ! [X0: program,X1: input] : ~ decides(algorithm_of(sK3),X0,X1)
| spl10_25 ),
inference(resolution,[],[f171,f76]) ).
tff(f76,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( halts3(X0,X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(subsumption_resolution,[],[f40,f42]) ).
tff(f42,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( halts3(X0,X3,X4)
| halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,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,[],[f9]) ).
tff(f9,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/sandbox/tmp/tmp.PD8sdIBYFx/Vampire---4.8_3980',p2) ).
tff(f40,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( halts3(X0,X3,X4)
| ~ halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f13]) ).
tff(f171,plain,
( ~ halts3(sK3,sK8(sK3),as_input(sK8(sK3)))
| spl10_25 ),
inference(avatar_component_clause,[],[f169]) ).
tff(f169,plain,
( spl10_25
<=> halts3(sK3,sK8(sK3),as_input(sK8(sK3))) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_25])]) ).
tff(f192,plain,
( ~ spl10_1
| ~ spl10_3 ),
inference(avatar_contradiction_clause,[],[f191]) ).
tff(f191,plain,
( $false
| ~ spl10_1
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f71,f64]) ).
tff(f64,plain,
( ! [X3: program,X4: input] : halts2(X3,X4)
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f63]) ).
tff(f63,plain,
( spl10_1
<=> ! [X4: input,X3: program] : halts2(X3,X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
tff(f71,plain,
( ! [X3: program,X4: input] : ~ halts2(X3,X4)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f70]) ).
tff(f70,plain,
( spl10_3
<=> ! [X4: input,X3: program] : ~ halts2(X3,X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
tff(f190,plain,
( ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_10 ),
inference(avatar_contradiction_clause,[],[f189]) ).
tff(f189,plain,
( $false
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_10 ),
inference(resolution,[],[f188,f160]) ).
tff(f160,plain,
( outputs(sK3,good)
| ~ spl10_4
| ~ spl10_6 ),
inference(resolution,[],[f74,f82]) ).
tff(f74,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ decides(algorithm_of(X0),X1,X2)
| outputs(X0,good) )
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f73]) ).
tff(f73,plain,
( spl10_4
<=> ! [X2: input,X0: program,X1: program] :
( outputs(X0,good)
| ~ decides(algorithm_of(X0),X1,X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
tff(f188,plain,
( ! [X0: program] : ~ outputs(X0,good)
| ~ spl10_1
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f187,f64]) ).
tff(f187,plain,
( ! [X0: program] :
( ~ halts2(X0,as_input(sK6(X0)))
| ~ outputs(X0,good) )
| ~ spl10_1
| ~ spl10_10 ),
inference(resolution,[],[f64,f98]) ).
tff(f185,plain,
( ~ spl10_2
| ~ spl10_6
| spl10_26 ),
inference(avatar_contradiction_clause,[],[f184]) ).
tff(f184,plain,
( $false
| ~ spl10_2
| ~ spl10_6
| spl10_26 ),
inference(subsumption_resolution,[],[f183,f82]) ).
tff(f183,plain,
( ! [X0: program,X1: input] : ~ decides(algorithm_of(sK3),X0,X1)
| ~ spl10_2
| spl10_26 ),
inference(resolution,[],[f176,f67]) ).
tff(f67,plain,
( ! [X2: input,X0: program,X1: program] :
( outputs(X0,bad)
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f66]) ).
tff(f66,plain,
( spl10_2
<=> ! [X2: input,X0: program,X1: program] :
( outputs(X0,bad)
| ~ decides(algorithm_of(X0),X1,X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
tff(f176,plain,
( ~ outputs(sK3,bad)
| spl10_26 ),
inference(avatar_component_clause,[],[f174]) ).
tff(f174,plain,
( spl10_26
<=> outputs(sK3,bad) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_26])]) ).
tff(f177,plain,
( ~ spl10_25
| ~ spl10_26
| ~ spl10_4
| ~ spl10_6
| ~ spl10_16 ),
inference(avatar_split_clause,[],[f162,f121,f81,f73,f174,f169]) ).
tff(f121,plain,
( spl10_16
<=> ! [X0: program] :
( ~ outputs(X0,bad)
| ~ outputs(X0,good)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_16])]) ).
tff(f162,plain,
( ~ outputs(sK3,bad)
| ~ halts3(sK3,sK8(sK3),as_input(sK8(sK3)))
| ~ spl10_4
| ~ spl10_6
| ~ spl10_16 ),
inference(resolution,[],[f160,f122]) ).
tff(f122,plain,
( ! [X0: program] :
( ~ outputs(X0,good)
| ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) )
| ~ spl10_16 ),
inference(avatar_component_clause,[],[f121]) ).
tff(f159,plain,
( ~ spl10_2
| ~ spl10_3
| ~ spl10_6
| ~ spl10_17 ),
inference(avatar_contradiction_clause,[],[f158]) ).
tff(f158,plain,
( $false
| ~ spl10_2
| ~ spl10_3
| ~ spl10_6
| ~ spl10_17 ),
inference(resolution,[],[f157,f82]) ).
tff(f157,plain,
( ! [X2: input,X0: program,X1: program] : ~ decides(algorithm_of(X0),X1,X2)
| ~ spl10_2
| ~ spl10_3
| ~ spl10_17 ),
inference(subsumption_resolution,[],[f156,f76]) ).
tff(f156,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ halts3(X0,sK8(X0),as_input(sK8(X0)))
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ spl10_2
| ~ spl10_3
| ~ spl10_17 ),
inference(resolution,[],[f155,f67]) ).
tff(f155,plain,
( ! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) )
| ~ spl10_3
| ~ spl10_17 ),
inference(resolution,[],[f126,f71]) ).
tff(f126,plain,
( ! [X0: program] :
( halts2(sK8(X0),as_input(sK8(X0)))
| ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) )
| ~ spl10_17 ),
inference(avatar_component_clause,[],[f125]) ).
tff(f125,plain,
( spl10_17
<=> ! [X0: program] :
( ~ outputs(X0,bad)
| halts2(sK8(X0),as_input(sK8(X0)))
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_17])]) ).
tff(f154,plain,
~ spl10_5,
inference(avatar_contradiction_clause,[],[f153]) ).
tff(f153,plain,
( $false
| ~ spl10_5 ),
inference(resolution,[],[f79,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/sandbox/tmp/tmp.PD8sdIBYFx/Vampire---4.8_3980',prove_this) ).
tff(f79,plain,
( ! [X3: algorithm] : ~ decides(X3,sK4(X3),sK5(X3))
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f78]) ).
tff(f78,plain,
( spl10_5
<=> ! [X3: algorithm] : ~ decides(X3,sK4(X3),sK5(X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
tff(f152,plain,
( spl10_15
| spl10_23 ),
inference(avatar_split_clause,[],[f56,f150,f117]) ).
tff(f117,plain,
( spl10_15
<=> sP1 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_15])]) ).
tff(f56,plain,
! [X1: program] :
( halts2(sK9,as_input(X1))
| ~ halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f38]) ).
tff(f38,plain,
( ! [X1: program] :
( ( ( outputs(sK9,bad)
& halts2(sK9,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ( outputs(sK9,good)
& halts2(sK9,as_input(X1)) )
| ~ halts2(X1,as_input(X1)) ) )
| sP1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f36,f37]) ).
tff(f37,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(sK9,bad)
& halts2(sK9,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ( outputs(sK9,good)
& halts2(sK9,as_input(X1)) )
| ~ halts2(X1,as_input(X1)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f36,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,[],[f16,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(f16,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,[],[f12]) ).
tff(f12,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/sandbox/tmp/tmp.PD8sdIBYFx/Vampire---4.8_3980',p3) ).
tff(f148,plain,
( spl10_15
| spl10_21
| spl10_22 ),
inference(avatar_split_clause,[],[f57,f145,f142,f117]) ).
tff(f57,plain,
! [X1: program] :
( outputs(sK9,good)
| ~ halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f38]) ).
tff(f140,plain,
( spl10_15
| spl10_20 ),
inference(avatar_split_clause,[],[f58,f138,f117]) ).
tff(f58,plain,
! [X1: program] :
( halts2(sK9,as_input(X1))
| halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f38]) ).
tff(f136,plain,
( spl10_15
| spl10_11
| spl10_19 ),
inference(avatar_split_clause,[],[f59,f133,f101,f117]) ).
tff(f59,plain,
! [X1: program] :
( outputs(sK9,bad)
| halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f38]) ).
tff(f127,plain,
( ~ spl10_15
| spl10_17 ),
inference(avatar_split_clause,[],[f54,f125,f117]) ).
tff(f54,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0)))
| halts2(sK8(X0),as_input(sK8(X0)))
| ~ sP1 ),
inference(cnf_transformation,[],[f35]) ).
tff(f35,plain,
( ! [X0: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) )
& ~ halts2(sK8(X0),as_input(sK8(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) )
& halts2(sK8(X0),as_input(sK8(X0))) ) )
| ~ sP1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f33,f34]) ).
tff(f34,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,sK8(X0),as_input(sK8(X0))) )
& ~ halts2(sK8(X0),as_input(sK8(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0))) )
& halts2(sK8(X0),as_input(sK8(X0))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f33,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(f123,plain,
( ~ spl10_15
| spl10_16 ),
inference(avatar_split_clause,[],[f60,f121,f117]) ).
tff(f60,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0)))
| ~ outputs(X0,good)
| ~ sP1 ),
inference(duplicate_literal_removal,[],[f55]) ).
tff(f55,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0)))
| ~ outputs(X0,good)
| ~ halts3(X0,sK8(X0),as_input(sK8(X0)))
| ~ sP1 ),
inference(cnf_transformation,[],[f35]) ).
tff(f115,plain,
( spl10_7
| spl10_14 ),
inference(avatar_split_clause,[],[f49,f113,f85]) ).
tff(f85,plain,
( spl10_7
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
tff(f49,plain,
! [X1: program] :
( ~ halts2(sK7,as_input(X1))
| ~ halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
( ! [X1: program] :
( ( ( outputs(sK7,bad)
& halts2(sK7,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ~ halts2(sK7,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) )
| sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f30,f31]) ).
tff(f31,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(sK7,bad)
& halts2(sK7,as_input(X1)) )
| halts2(X1,as_input(X1)) )
& ( ~ halts2(sK7,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f30,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,[],[f15,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(f15,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,[],[f11]) ).
tff(f11,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/sandbox/tmp/tmp.PD8sdIBYFx/Vampire---4.8_3980',p4) ).
tff(f111,plain,
( spl10_7
| spl10_13 ),
inference(avatar_split_clause,[],[f50,f109,f85]) ).
tff(f50,plain,
! [X1: program] :
( halts2(sK7,as_input(X1))
| halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f32]) ).
tff(f99,plain,
( ~ spl10_7
| spl10_10 ),
inference(avatar_split_clause,[],[f46,f97,f85]) ).
tff(f46,plain,
! [X0: program] :
( ~ halts2(sK6(X0),as_input(sK6(X0)))
| ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK6(X0)))
| ~ sP0 ),
inference(cnf_transformation,[],[f29]) ).
tff(f29,plain,
( ! [X0: program] :
( ( ( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(sK6(X0))) )
& ~ halts2(sK6(X0),as_input(sK6(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK6(X0))) )
& halts2(sK6(X0),as_input(sK6(X0))) ) )
| ~ sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f27,f28]) ).
tff(f28,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(sK6(X0))) )
& ~ halts2(sK6(X0),as_input(sK6(X0))) )
| ( ( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK6(X0))) )
& halts2(sK6(X0),as_input(sK6(X0))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f27,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(f95,plain,
( ~ spl10_7
| spl10_9 ),
inference(avatar_split_clause,[],[f47,f93,f85]) ).
tff(f47,plain,
! [X0: program] :
( ~ outputs(X0,bad)
| ~ halts2(X0,as_input(sK6(X0)))
| halts2(sK6(X0),as_input(sK6(X0)))
| ~ sP0 ),
inference(cnf_transformation,[],[f29]) ).
tff(f83,plain,
( spl10_5
| spl10_6 ),
inference(avatar_split_clause,[],[f44,f81,f78]) ).
tff(f44,plain,
! [X2: input,X3: algorithm,X1: program] :
( decides(algorithm_of(sK3),X1,X2)
| ~ decides(X3,sK4(X3),sK5(X3)) ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
( ! [X1: program,X2: input] : decides(algorithm_of(sK3),X1,X2)
| ! [X3: algorithm] : ~ decides(X3,sK4(X3),sK5(X3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f23,f25,f24]) ).
tff(f24,plain,
( ? [X0: program] :
! [X1: program,X2: input] : decides(algorithm_of(X0),X1,X2)
=> ! [X2: input,X1: program] : decides(algorithm_of(sK3),X1,X2) ),
introduced(choice_axiom,[]) ).
tff(f25,plain,
! [X3: algorithm] :
( ? [X4: program,X5: input] : ~ decides(X3,X4,X5)
=> ~ decides(X3,sK4(X3),sK5(X3)) ),
introduced(choice_axiom,[]) ).
tff(f23,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,[],[f14]) ).
tff(f14,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,[],[f10]) ).
tff(f10,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/sandbox/tmp/tmp.PD8sdIBYFx/Vampire---4.8_3980',p1) ).
tff(f75,plain,
( spl10_3
| spl10_4 ),
inference(avatar_split_clause,[],[f41,f73,f70]) ).
tff(f41,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,[],[f13]) ).
tff(f68,plain,
( spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f43,f66,f63]) ).
tff(f43,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,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : COM003_1 : TPTP v8.1.2. Released v5.0.0.
% 0.06/0.12 % 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.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 21:27:22 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a TF0_THM_NEQ_NAR problem
% 0.12/0.33 Running 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 300 /export/starexec/sandbox/tmp/tmp.PD8sdIBYFx/Vampire---4.8_3980
% 0.65/0.81 % (4097)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.65/0.81 % (4099)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.65/0.81 % (4094)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.65/0.81 % (4095)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.65/0.81 % (4096)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.65/0.81 % (4098)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.65/0.81 % (4100)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.65/0.81 % (4099)Refutation not found, incomplete strategy% (4099)------------------------------
% 0.65/0.81 % (4099)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4099)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4099)Memory used [KB]: 943
% 0.65/0.81 % (4099)Time elapsed: 0.002 s
% 0.65/0.81 % (4099)Instructions burned: 2 (million)
% 0.65/0.81 % (4101)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.65/0.81 % (4099)------------------------------
% 0.65/0.81 % (4099)------------------------------
% 0.65/0.81 % (4101)Refutation not found, incomplete strategy% (4101)------------------------------
% 0.65/0.81 % (4101)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4101)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4101)Memory used [KB]: 943
% 0.65/0.81 % (4101)Time elapsed: 0.002 s
% 0.65/0.81 % (4101)Instructions burned: 2 (million)
% 0.65/0.81 % (4094)Refutation not found, incomplete strategy% (4094)------------------------------
% 0.65/0.81 % (4094)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4094)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4094)Memory used [KB]: 950
% 0.65/0.81 % (4094)Time elapsed: 0.003 s
% 0.65/0.81 % (4094)Instructions burned: 2 (million)
% 0.65/0.81 % (4101)------------------------------
% 0.65/0.81 % (4101)------------------------------
% 0.65/0.81 % (4094)------------------------------
% 0.65/0.81 % (4094)------------------------------
% 0.65/0.81 % (4097)Refutation not found, incomplete strategy% (4097)------------------------------
% 0.65/0.81 % (4097)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4097)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4097)Memory used [KB]: 943
% 0.65/0.81 % (4097)Time elapsed: 0.003 s
% 0.65/0.81 % (4097)Instructions burned: 2 (million)
% 0.65/0.81 % (4097)------------------------------
% 0.65/0.81 % (4097)------------------------------
% 0.65/0.81 % (4098)Refutation not found, incomplete strategy% (4098)------------------------------
% 0.65/0.81 % (4098)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4098)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4098)Memory used [KB]: 1057
% 0.65/0.81 % (4098)Time elapsed: 0.004 s
% 0.65/0.81 % (4098)Instructions burned: 4 (million)
% 0.65/0.81 % (4098)------------------------------
% 0.65/0.81 % (4098)------------------------------
% 0.65/0.81 % (4100)Refutation not found, incomplete strategy% (4100)------------------------------
% 0.65/0.81 % (4100)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4100)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4100)Memory used [KB]: 1064
% 0.65/0.81 % (4100)Time elapsed: 0.004 s
% 0.65/0.81 % (4100)Instructions burned: 6 (million)
% 0.65/0.81 % (4096)First to succeed.
% 0.65/0.81 % (4100)------------------------------
% 0.65/0.81 % (4100)------------------------------
% 0.65/0.81 % (4095)Also succeeded, but the first one will report.
% 0.65/0.81 % (4102)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.65/0.81 % (4103)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.65/0.81 % (4104)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.65/0.81 % (4105)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2995ds/52Mi)
% 0.65/0.81 % (4104)Refutation not found, incomplete strategy% (4104)------------------------------
% 0.65/0.81 % (4104)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.81 % (4104)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.81
% 0.65/0.81 % (4104)Memory used [KB]: 950
% 0.65/0.81 % (4104)Time elapsed: 0.002 s
% 0.65/0.81 % (4104)Instructions burned: 2 (million)
% 0.65/0.81 % (4106)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2995ds/518Mi)
% 0.65/0.81 % (4104)------------------------------
% 0.65/0.81 % (4104)------------------------------
% 0.65/0.81 % (4096)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4089"
% 0.65/0.82 % (4096)Refutation found. Thanks to Tanya!
% 0.65/0.82 % SZS status Theorem for Vampire---4
% 0.65/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.82 % (4096)------------------------------
% 0.65/0.82 % (4096)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.82 % (4096)Termination reason: Refutation
% 0.65/0.82
% 0.65/0.82 % (4096)Memory used [KB]: 1113
% 0.65/0.82 % (4096)Time elapsed: 0.007 s
% 0.65/0.82 % (4096)Instructions burned: 10 (million)
% 0.65/0.82 % (4089)Success in time 0.482 s
% 0.65/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------