%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 : Unsatisfiable 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 9 unt; 4 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 68 ( 33 ~; 31 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 5 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 50 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1] :
( halts2(X0,X1)
| ~ program_halts2(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts3a) ).
fof(f17,axiom,
! [X0,X1] :
( ~ program_not_halts2(X0,X1)
| ~ halts2(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts3a) ).
fof(f22,axiom,
! [X2,X3,X0,X1] :
( ~ program_halts2_halts3_outputs(X0,X1,X2,X3)
| program_halts2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
fof(f25,axiom,
! [X2,X3,X0,X1] :
( ~ program_not_halts2_halts3_outputs(X0,X1,X2,X3)
| program_not_halts2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
fof(f34,axiom,
! [X0] :
( ~ algorithm_program_decides(X0)
| program_program_decides(c1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1_1) ).
fof(f35,axiom,
! [X2,X0,X1] :
( ~ program_program_decides(X0)
| program_halts2_halts3_outputs(X0,X1,X2,good) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_1) ).
fof(f36,axiom,
! [X2,X0,X1] :
( ~ program_program_decides(X0)
| program_not_halts2_halts3_outputs(X0,X1,X2,bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_2) ).
fof(f43,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( program_not_halts2_halts3_outputs(X0,X1,X2,X3)
| program_not_halts2(X1,X2) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f72,plain,
! [X0] :
( algorithm_program_decides(X0)
| ~ program_program_decides(c1) ),
inference(consistent_polarity_flipping,[],[f34]) ).
fof(f73,plain,
! [X2,X0,X1] :
( program_halts2_halts3_outputs(X0,X1,X2,good)
| program_program_decides(X0) ),
inference(consistent_polarity_flipping,[],[f35]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ program_not_halts2_halts3_outputs(X0,X1,X2,bad)
| program_program_decides(X0) ),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f81,plain,
~ algorithm_program_decides(c4),
inference(consistent_polarity_flipping,[],[f43]) ).
fof(f115,definition,
( spl0_9
<=> program_program_decides(c1) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f117,plain,
( ~ program_program_decides(c1)
| spl0_9 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f119,definition,
( spl0_10
<=> ! [X0] : algorithm_program_decides(X0) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f120,plain,
( ! [X0] : algorithm_program_decides(X0)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f121,plain,
( ~ spl0_9
| spl0_10 ),
inference(avatar_split_clause,[],[f72,f119,f115]) ).
fof(f122,plain,
! [X2,X0,X1] :
( program_halts2(X0,X1)
| program_program_decides(X2) ),
inference(resolution,[],[f22,f73]) ).
fof(f124,definition,
( spl0_11
<=> ! [X2] : program_program_decides(X2) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f125,plain,
( ! [X2] : program_program_decides(X2)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f127,definition,
( spl0_12
<=> ! [X0,X1] : program_halts2(X0,X1) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f128,plain,
( ! [X0,X1] : program_halts2(X0,X1)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f129,plain,
( spl0_11
| spl0_12 ),
inference(avatar_split_clause,[],[f122,f127,f124]) ).
fof(f131,plain,
( $false
| spl0_9
| ~ spl0_11 ),
inference(backward_subsumption_resolution,[],[f117,f125]) ).
fof(f133,plain,
( spl0_9
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f131]) ).
fof(f134,plain,
( $false
| ~ spl0_10 ),
inference(backward_subsumption_resolution,[],[f81,f120]) ).
fof(f136,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f134]) ).
fof(f137,plain,
( ! [X0,X1] : halts2(X0,X1)
| ~ spl0_12 ),
inference(backward_subsumption_resolution,[],[f11,f128]) ).
fof(f142,plain,
( ! [X0,X1] : ~ program_not_halts2(X0,X1)
| ~ spl0_12 ),
inference(backward_subsumption_resolution,[],[f17,f137]) ).
fof(f144,plain,
( ! [X2,X3,X0,X1] : program_not_halts2_halts3_outputs(X0,X1,X2,X3)
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f65,f142]) ).
fof(f145,plain,
( ! [X0] : program_program_decides(X0)
| ~ spl0_12 ),
inference(backward_subsumption_resolution,[],[f74,f144]) ).
fof(f146,plain,
( spl0_11
| ~ spl0_12 ),
inference(avatar_split_clause,[],[f145,f127,f124]) ).
cnf(s7,plain,
( ~ spl0_9
| spl0_10 ),
inference(sat_conversion,[],[f121]) ).
cnf(s8,plain,
( spl0_11
| spl0_12 ),
inference(sat_conversion,[],[f129]) ).
cnf(s9,plain,
( spl0_9
| ~ spl0_11 ),
inference(sat_conversion,[],[f133]) ).
cnf(s10,plain,
~ spl0_10,
inference(sat_conversion,[],[f136]) ).
cnf(s11,plain,
( spl0_11
| ~ spl0_12 ),
inference(sat_conversion,[],[f146]) ).
cnf(s12,plain,
~ spl0_9,
inference(rat,[],[s7,s10]) ).
cnf(s13,plain,
~ spl0_11,
inference(rat,[],[s9,s12]) ).
cnf(s14,plain,
~ spl0_12,
inference(rat,[],[s11,s13]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s8,s14,s13]) ).
fof(f147,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n008.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Mon Sep 28 21:44:30 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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 % (2683914)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (2683920)% WARNING: option uhcvi not known.
% 0.20/0.28 % (2683920)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2669765998:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (2683920) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2683914-2683920"...
% 0.20/0.28 % (2683920)...printing done.
% 0.20/0.28 % (2683920)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (2683920)------------------------------
% 0.20/0.28 % (2683920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2683920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2683920)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2683920)Termination reason: Refutation
% 0.20/0.28 % (2683920)Time elapsed: 0.001 s
% 0.20/0.28 % (2683920)Peak memory usage: 12 MB
% 0.20/0.28 % (2683920)Instructions burned: 2 (million)
% 0.20/0.28 % (2683914)Success in time 0.033 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------