%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM003+2 : TPTP v9.3.1. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:40:05 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of formulae : 124 ( 18 unt; 11 def)
% Number of atoms : 348 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 405 ( 181 ~; 172 |; 26 &)
% ( 17 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 12 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 152 ( 0 sgn 134 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( program_program_decides(X0)
<=> ( program(X0)
& program_decides(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_program_decides_def) ).
fof(f4,axiom,
! [X0,X1] :
( program_halts2(X0,X1)
<=> ( program(X0)
& halts2(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts2_def) ).
fof(f6,axiom,
! [X0,X1] :
( program_not_halts2(X0,X1)
<=> ( program(X0)
& ~ halts2(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts2_def) ).
fof(f7,axiom,
! [X0,X1,X2] :
( halts2_outputs(X0,X1,X2)
<=> ( halts2(X0,X1)
& outputs(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',halts2_outputs_def) ).
fof(f11,axiom,
! [X0,X1,X2] :
( program_not_halts2_halts2_outputs(X0,X1,X2)
<=> ( program_not_halts2(X1,X1)
=> halts2_outputs(X0,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts2_halts2_outputs_def) ).
fof(f12,axiom,
( ? [X0] : algorithm_program_decides(X0)
=> ? [X1] : program_program_decides(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
fof(f13,axiom,
! [X0] :
( program_program_decides(X0)
=> ! [X1,X2] :
( program_halts2_halts3_outputs(X0,X1,X2,good)
& program_not_halts2_halts3_outputs(X0,X1,X2,bad) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).
fof(f14,axiom,
( ? [X0] :
( program(X0)
& ! [X1] :
( program_halts2_halts3_outputs(X0,X1,X1,good)
& program_not_halts2_halts3_outputs(X0,X1,X1,bad) ) )
=> ? [X2] :
( program(X2)
& ! [X1] :
( program_halts2_halts2_outputs(X2,X1,good)
& program_not_halts2_halts2_outputs(X2,X1,bad) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3) ).
fof(f15,axiom,
( ? [X0] :
( program(X0)
& ! [X1] :
( program_halts2_halts2_outputs(X0,X1,good)
& program_not_halts2_halts2_outputs(X0,X1,bad) ) )
=> ? [X2] :
( program(X2)
& ! [X1] :
( ( program_halts2(X1,X1)
=> ~ halts2(X2,X1) )
& program_not_halts2_halts2_outputs(X2,X1,good) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4) ).
fof(f16,conjecture,
~ ? [X0] : algorithm_program_decides(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,negated_conjecture,
~ ~ ? [X0] : algorithm_program_decides(X0),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f18,plain,
( ? [X0] :
( program(X0)
& ! [X1] :
( program_halts2_halts3_outputs(X0,X1,X1,good)
& program_not_halts2_halts3_outputs(X0,X1,X1,bad) ) )
=> ? [X2] :
( program(X2)
& ! [X3] :
( program_halts2_halts2_outputs(X2,X3,good)
& program_not_halts2_halts2_outputs(X2,X3,bad) ) ) ),
inference(rectify,[],[f14]) ).
fof(f19,plain,
( ? [X0] :
( program(X0)
& ! [X1] :
( program_halts2_halts2_outputs(X0,X1,good)
& program_not_halts2_halts2_outputs(X0,X1,bad) ) )
=> ? [X2] :
( program(X2)
& ! [X3] :
( ( program_halts2(X3,X3)
=> ~ halts2(X2,X3) )
& program_not_halts2_halts2_outputs(X2,X3,good) ) ) ),
inference(rectify,[],[f15]) ).
fof(f20,plain,
? [X0] : algorithm_program_decides(X0),
inference(flattening,[],[f17]) ).
fof(f25,plain,
! [X0,X1,X2] :
( program_not_halts2_halts2_outputs(X0,X1,X2)
<=> ( halts2_outputs(X0,X1,X2)
| ~ program_not_halts2(X1,X1) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f26,plain,
( ? [X1] : program_program_decides(X1)
| ! [X0] : ~ algorithm_program_decides(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f27,plain,
! [X0] :
( ! [X1,X2] :
( program_halts2_halts3_outputs(X0,X1,X2,good)
& program_not_halts2_halts3_outputs(X0,X1,X2,bad) )
| ~ program_program_decides(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f28,plain,
( ? [X2] :
( program(X2)
& ! [X3] :
( program_halts2_halts2_outputs(X2,X3,good)
& program_not_halts2_halts2_outputs(X2,X3,bad) ) )
| ! [X0] :
( ~ program(X0)
| ? [X1] :
( ~ program_halts2_halts3_outputs(X0,X1,X1,good)
| ~ program_not_halts2_halts3_outputs(X0,X1,X1,bad) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f29,plain,
( ? [X2] :
( program(X2)
& ! [X3] :
( ( ~ halts2(X2,X3)
| ~ program_halts2(X3,X3) )
& program_not_halts2_halts2_outputs(X2,X3,good) ) )
| ! [X0] :
( ~ program(X0)
| ? [X1] :
( ~ program_halts2_halts2_outputs(X0,X1,good)
| ~ program_not_halts2_halts2_outputs(X0,X1,bad) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f34,plain,
! [X0] :
( ~ program_program_decides(X0)
| program(X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f39,plain,
! [X0,X1] :
( halts2(X0,X1)
| ~ program_halts2(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f41,plain,
! [X0,X1] :
( ~ halts2(X0,X1)
| ~ program(X0)
| program_halts2(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f45,plain,
! [X0,X1] :
( ~ program_not_halts2(X0,X1)
| ~ halts2(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0,X1] :
( program_not_halts2(X0,X1)
| ~ program(X0)
| halts2(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ halts2_outputs(X0,X1,X2)
| halts2(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f60,plain,
! [X2,X0,X1] :
( halts2_outputs(X0,X1,X2)
| ~ program_not_halts2(X1,X1)
| ~ program_not_halts2_halts2_outputs(X0,X1,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f61,plain,
! [X2,X0,X1] :
( program_not_halts2(X1,X1)
| program_not_halts2_halts2_outputs(X0,X1,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f63,plain,
! [X0] :
( ~ algorithm_program_decides(X0)
| program_program_decides(sK2) ),
inference(cnf_transformation,[],[f26]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ program_program_decides(X0)
| program_not_halts2_halts3_outputs(X0,X1,X2,bad) ),
inference(cnf_transformation,[],[f27]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ program_program_decides(X0)
| program_halts2_halts3_outputs(X0,X1,X2,good) ),
inference(cnf_transformation,[],[f27]) ).
fof(f66,plain,
! [X3,X0] :
( ~ program_not_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),bad)
| ~ program_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),good)
| ~ program(X0)
| program_not_halts2_halts2_outputs(sK3,X3,bad) ),
inference(cnf_transformation,[],[f28]) ).
fof(f67,plain,
! [X3,X0] :
( ~ program_not_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),bad)
| ~ program_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),good)
| ~ program(X0)
| program_halts2_halts2_outputs(sK3,X3,good) ),
inference(cnf_transformation,[],[f28]) ).
fof(f68,plain,
! [X0] :
( ~ program_not_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),bad)
| ~ program_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),good)
| ~ program(X0)
| program(sK3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f69,plain,
! [X3,X0] :
( ~ program_not_halts2_halts2_outputs(X0,sK6(X0),bad)
| ~ program_halts2_halts2_outputs(X0,sK6(X0),good)
| ~ program(X0)
| ~ program_halts2(X3,X3)
| ~ halts2(sK5,X3) ),
inference(cnf_transformation,[],[f29]) ).
fof(f70,plain,
! [X3,X0] :
( ~ program_not_halts2_halts2_outputs(X0,sK6(X0),bad)
| ~ program_halts2_halts2_outputs(X0,sK6(X0),good)
| ~ program(X0)
| program_not_halts2_halts2_outputs(sK5,X3,good) ),
inference(cnf_transformation,[],[f29]) ).
fof(f71,plain,
! [X0] :
( ~ program_not_halts2_halts2_outputs(X0,sK6(X0),bad)
| ~ program_halts2_halts2_outputs(X0,sK6(X0),good)
| ~ program(X0)
| program(sK5) ),
inference(cnf_transformation,[],[f29]) ).
fof(f72,plain,
algorithm_program_decides(sK7),
inference(cnf_transformation,[],[f20]) ).
fof(f74,definition,
( spl8_1
<=> ! [X3] :
( ~ program_halts2(X3,X3)
| ~ halts2(sK5,X3) ) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f75,plain,
( ! [X3] :
( ~ halts2(sK5,X3)
| ~ program_halts2(X3,X3) )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f77,definition,
( spl8_2
<=> ! [X0] :
( ~ program_not_halts2_halts2_outputs(X0,sK6(X0),bad)
| ~ program(X0)
| ~ program_halts2_halts2_outputs(X0,sK6(X0),good) ) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f78,plain,
( ! [X0] :
( ~ program_halts2_halts2_outputs(X0,sK6(X0),good)
| ~ program(X0)
| ~ program_not_halts2_halts2_outputs(X0,sK6(X0),bad) )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f79,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f69,f77,f74]) ).
fof(f81,definition,
( spl8_3
<=> ! [X3] : program_not_halts2_halts2_outputs(sK5,X3,good) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
fof(f82,plain,
( ! [X3] : program_not_halts2_halts2_outputs(sK5,X3,good)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f83,plain,
( spl8_3
| spl8_2 ),
inference(avatar_split_clause,[],[f70,f77,f81]) ).
fof(f85,definition,
( spl8_4
<=> program(sK5) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
fof(f87,plain,
( program(sK5)
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f88,plain,
( spl8_4
| spl8_2 ),
inference(avatar_split_clause,[],[f71,f77,f85]) ).
fof(f90,definition,
( spl8_5
<=> ! [X3] : program_not_halts2_halts2_outputs(sK3,X3,bad) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
fof(f91,plain,
( ! [X3] : program_not_halts2_halts2_outputs(sK3,X3,bad)
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f93,definition,
( spl8_6
<=> ! [X0] :
( ~ program_not_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),bad)
| ~ program(X0)
| ~ program_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),good) ) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
fof(f94,plain,
( ! [X0] :
( ~ program_not_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),bad)
| ~ program(X0)
| ~ program_halts2_halts3_outputs(X0,sK4(X0),sK4(X0),good) )
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f95,plain,
( spl8_5
| spl8_6 ),
inference(avatar_split_clause,[],[f66,f93,f90]) ).
fof(f97,definition,
( spl8_7
<=> ! [X3] : program_halts2_halts2_outputs(sK3,X3,good) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
fof(f98,plain,
( ! [X3] : program_halts2_halts2_outputs(sK3,X3,good)
| ~ spl8_7 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f99,plain,
( spl8_7
| spl8_6 ),
inference(avatar_split_clause,[],[f67,f93,f97]) ).
fof(f101,definition,
( spl8_8
<=> program(sK3) ),
introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).
fof(f103,plain,
( program(sK3)
| ~ spl8_8 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f104,plain,
( spl8_8
| spl8_6 ),
inference(avatar_split_clause,[],[f68,f93,f101]) ).
fof(f106,definition,
( spl8_9
<=> program_program_decides(sK2) ),
introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).
fof(f108,plain,
( program_program_decides(sK2)
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f110,definition,
( spl8_10
<=> ! [X0] : ~ algorithm_program_decides(X0) ),
introduced(definition,[new_symbols(definition,[spl8_10])],[avatar_definition]) ).
fof(f111,plain,
( ! [X0] : ~ algorithm_program_decides(X0)
| ~ spl8_10 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f112,plain,
( spl8_9
| spl8_10 ),
inference(avatar_split_clause,[],[f63,f110,f106]) ).
fof(f113,plain,
( program(sK2)
| ~ spl8_9 ),
inference(resolution,[],[f34,f108]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ halts2(X1,X1)
| program_not_halts2_halts2_outputs(X0,X1,X2) ),
inference(resolution,[],[f61,f45]) ).
fof(f128,plain,
( ! [X0,X1] : program_not_halts2_halts3_outputs(sK2,X0,X1,bad)
| ~ spl8_9 ),
inference(resolution,[],[f64,f108]) ).
fof(f129,plain,
( ! [X0,X1] : program_halts2_halts3_outputs(sK2,X0,X1,good)
| ~ spl8_9 ),
inference(resolution,[],[f65,f108]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ program_not_halts2(X0,X0)
| ~ program_not_halts2_halts2_outputs(X1,X0,X2)
| halts2(X1,X0) ),
inference(resolution,[],[f60,f49]) ).
fof(f143,plain,
! [X2,X3,X0,X1,X4] :
( halts2(X0,X1)
| ~ program_not_halts2_halts2_outputs(X0,X1,X2)
| program_not_halts2_halts2_outputs(X3,X1,X4) ),
inference(resolution,[],[f142,f61]) ).
fof(f144,plain,
! [X2,X0,X1] :
( halts2(X0,X1)
| halts2(X1,X1)
| ~ program(X1)
| ~ program_not_halts2_halts2_outputs(X0,X1,X2) ),
inference(resolution,[],[f142,f47]) ).
fof(f154,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ program_not_halts2_halts2_outputs(X0,X0,X1)
| program_not_halts2_halts2_outputs(X2,X0,X3)
| program_not_halts2_halts2_outputs(X4,X0,X5) ),
inference(resolution,[],[f143,f126]) ).
fof(f165,plain,
( ~ program(sK2)
| ~ program_halts2_halts3_outputs(sK2,sK4(sK2),sK4(sK2),good)
| ~ spl8_6
| ~ spl8_9 ),
inference(resolution,[],[f94,f128]) ).
fof(f171,plain,
( ~ program_halts2_halts3_outputs(sK2,sK4(sK2),sK4(sK2),good)
| ~ spl8_6
| ~ spl8_9 ),
inference(forward_subsumption_resolution,[],[f165,f113]) ).
fof(f172,plain,
( $false
| ~ spl8_6
| ~ spl8_9 ),
inference(forward_subsumption_resolution,[],[f171,f129]) ).
fof(f173,plain,
( ~ spl8_6
| ~ spl8_9 ),
inference(avatar_contradiction_clause,[],[f172]) ).
fof(f175,plain,
( ~ program(sK3)
| ~ program_not_halts2_halts2_outputs(sK3,sK6(sK3),bad)
| ~ spl8_2
| ~ spl8_7 ),
inference(resolution,[],[f98,f78]) ).
fof(f176,plain,
( ~ program_not_halts2_halts2_outputs(sK3,sK6(sK3),bad)
| ~ spl8_2
| ~ spl8_7
| ~ spl8_8 ),
inference(forward_subsumption_resolution,[],[f175,f103]) ).
fof(f177,plain,
( $false
| ~ spl8_2
| ~ spl8_5
| ~ spl8_7
| ~ spl8_8 ),
inference(forward_subsumption_resolution,[],[f176,f91]) ).
fof(f178,plain,
( ~ spl8_2
| ~ spl8_5
| ~ spl8_7
| ~ spl8_8 ),
inference(avatar_contradiction_clause,[],[f177]) ).
fof(f181,plain,
( $false
| ~ spl8_10 ),
inference(resolution,[],[f111,f72]) ).
fof(f182,plain,
~ spl8_10,
inference(avatar_contradiction_clause,[],[f181]) ).
fof(f188,plain,
( ! [X0] :
( ~ program_halts2(X0,X0)
| ~ program_halts2(sK5,X0) )
| ~ spl8_1 ),
inference(resolution,[],[f75,f39]) ).
fof(f222,plain,
! [X2,X0,X1] :
( halts2(X1,X1)
| ~ program(X1)
| ~ program_not_halts2_halts2_outputs(X0,X1,X2)
| ~ program(X0)
| program_halts2(X0,X1) ),
inference(resolution,[],[f144,f41]) ).
fof(f225,plain,
! [X2,X0,X1] :
( halts2(X1,X0)
| ~ program(X0)
| ~ program_not_halts2_halts2_outputs(X1,X0,X2)
| ~ program(X0)
| program_halts2(X0,X0) ),
inference(resolution,[],[f144,f41]) ).
fof(f230,plain,
! [X2,X0,X1] :
( halts2(X1,X0)
| ~ program(X0)
| ~ program_not_halts2_halts2_outputs(X1,X0,X2)
| program_halts2(X0,X0) ),
inference(duplicate_literal_removal,[],[f225]) ).
fof(f383,plain,
( ! [X2,X3,X0,X1] :
( program_not_halts2_halts2_outputs(X0,sK5,X1)
| program_not_halts2_halts2_outputs(X2,sK5,X3) )
| ~ spl8_3 ),
inference(resolution,[],[f154,f82]) ).
fof(f388,definition,
( spl8_26
<=> ! [X2,X3] : program_not_halts2_halts2_outputs(X2,sK5,X3) ),
introduced(definition,[new_symbols(definition,[spl8_26])],[avatar_definition]) ).
fof(f389,plain,
( ! [X2,X3] : program_not_halts2_halts2_outputs(X2,sK5,X3)
| ~ spl8_26 ),
inference(avatar_component_clause,[],[f388]) ).
fof(f390,plain,
( spl8_26
| spl8_26
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f383,f81,f388,f388]) ).
fof(f396,plain,
! [X2,X0,X1] :
( ~ program(X0)
| ~ program_not_halts2_halts2_outputs(X1,X0,X2)
| program_halts2(X0,X0)
| ~ program(X1)
| program_halts2(X1,X0) ),
inference(resolution,[],[f230,f41]) ).
fof(f485,plain,
( ! [X0,X1] :
( ~ program(sK5)
| ~ program_not_halts2_halts2_outputs(X0,sK5,X1)
| ~ program(X0)
| program_halts2(X0,sK5)
| ~ program_halts2(sK5,sK5) )
| ~ spl8_1 ),
inference(resolution,[],[f222,f75]) ).
fof(f487,plain,
( ! [X0,X1] :
( ~ program(sK5)
| ~ program_not_halts2_halts2_outputs(X0,sK5,X1)
| ~ program(X0)
| program_halts2(X0,sK5) )
| ~ spl8_1 ),
inference(forward_subsumption_resolution,[],[f485,f396]) ).
fof(f488,plain,
( ! [X0,X1] :
( ~ program_not_halts2_halts2_outputs(X0,sK5,X1)
| ~ program(X0)
| program_halts2(X0,sK5) )
| ~ spl8_1
| ~ spl8_4 ),
inference(forward_subsumption_resolution,[],[f487,f87]) ).
fof(f504,plain,
( ! [X0] :
( program_halts2(X0,sK5)
| ~ program(X0) )
| ~ spl8_1
| ~ spl8_4
| ~ spl8_26 ),
inference(forward_subsumption_resolution,[],[f488,f389]) ).
fof(f509,plain,
( ~ program(sK5)
| ~ program_halts2(sK5,sK5)
| ~ spl8_1
| ~ spl8_4
| ~ spl8_26 ),
inference(resolution,[],[f504,f188]) ).
fof(f515,plain,
( ~ program(sK5)
| ~ spl8_1
| ~ spl8_4
| ~ spl8_26 ),
inference(forward_subsumption_resolution,[],[f509,f504]) ).
fof(f519,plain,
( $false
| ~ spl8_1
| ~ spl8_4
| ~ spl8_26 ),
inference(forward_subsumption_resolution,[],[f515,f87]) ).
fof(f520,plain,
( ~ spl8_1
| ~ spl8_4
| ~ spl8_26 ),
inference(avatar_contradiction_clause,[],[f519]) ).
cnf(s1,plain,
( spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f79]) ).
cnf(s2,plain,
( spl8_2
| spl8_3 ),
inference(sat_conversion,[],[f83]) ).
cnf(s3,plain,
( spl8_2
| spl8_4 ),
inference(sat_conversion,[],[f88]) ).
cnf(s4,plain,
( spl8_5
| spl8_6 ),
inference(sat_conversion,[],[f95]) ).
cnf(s5,plain,
( spl8_6
| spl8_7 ),
inference(sat_conversion,[],[f99]) ).
cnf(s6,plain,
( spl8_6
| spl8_8 ),
inference(sat_conversion,[],[f104]) ).
cnf(s7,plain,
( spl8_9
| spl8_10 ),
inference(sat_conversion,[],[f112]) ).
cnf(s9,plain,
( ~ spl8_6
| ~ spl8_9 ),
inference(sat_conversion,[],[f173]) ).
cnf(s10,plain,
( ~ spl8_2
| ~ spl8_5
| ~ spl8_7
| ~ spl8_8 ),
inference(sat_conversion,[],[f178]) ).
cnf(s11,plain,
~ spl8_10,
inference(sat_conversion,[],[f182]) ).
cnf(s28,plain,
( spl8_26
| ~ spl8_3
| spl8_26 ),
inference(sat_conversion,[],[f390]) ).
cnf(s29,plain,
( ~ spl8_3
| spl8_26 ),
inference(rat,[],[s28]) ).
cnf(s42,plain,
( ~ spl8_1
| ~ spl8_4
| ~ spl8_26 ),
inference(sat_conversion,[],[f520]) ).
cnf(s43,plain,
spl8_9,
inference(rat,[],[s7,s11]) ).
cnf(s44,plain,
~ spl8_6,
inference(rat,[],[s9,s43]) ).
cnf(s45,plain,
spl8_8,
inference(rat,[],[s6,s44]) ).
cnf(s46,plain,
spl8_7,
inference(rat,[],[s5,s44]) ).
cnf(s47,plain,
spl8_5,
inference(rat,[],[s4,s44]) ).
cnf(s50,plain,
~ spl8_2,
inference(rat,[],[s10,s45,s46,s47]) ).
cnf(s55,plain,
spl8_4,
inference(rat,[],[s3,s50]) ).
cnf(s56,plain,
spl8_3,
inference(rat,[],[s2,s50]) ).
cnf(s57,plain,
spl8_26,
inference(rat,[],[s29,s56]) ).
cnf(s58,plain,
~ spl8_1,
inference(rat,[],[s42,s55,s57]) ).
cnf(s59,plain,
$false,
inference(rat,[],[s1,s50,s58]) ).
fof(f521,plain,
$false,
inference(avatar_sat_refutation,[],[s59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM003+2 : TPTP v9.3.1. Bugfixed v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n016.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 21:48:40 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.28 % (4062323)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (4062332)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1566267438:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (4062329)% WARNING: option uhcvi not known.
% 0.20/0.28 % (4062332) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4062323-4062332"...
% 0.20/0.28 % (4062332)...printing done.
% 0.20/0.28 % (4062332)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (4062332)------------------------------
% 0.20/0.28 % (4062332)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (4062332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (4062332)CaDiCaL version: 2.1.3
% 0.20/0.28 % (4062332)Termination reason: Refutation
% 0.20/0.28 % (4062332)Time elapsed: 0.006 s
% 0.20/0.28 % (4062332)Peak memory usage: 12 MB
% 0.20/0.28 % (4062332)Instructions burned: 15 (million)
% 0.20/0.28 % (4062323)Success in time 0.033 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------