%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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 : Fri Sep 25 01:04:15 PM UTC 2026
% Result : Unsatisfiable 1.29s 1.49s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1] :
( halts2(X0,X1)
| ~ program_halts2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts3a) ).
fof(f17,axiom,
! [X0,X1] :
( ~ halts2(X0,X1)
| ~ program_not_halts2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts3a) ).
fof(f22,axiom,
! [X2,X3,X0,X1] :
( program_halts2(X1,X2)
| ~ program_halts2_halts3_outputs(X0,X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
fof(f25,axiom,
! [X2,X3,X0,X1] :
( program_not_halts2(X1,X2)
| ~ program_not_halts2_halts3_outputs(X0,X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
fof(f34,axiom,
! [X0] :
( program_program_decides(c1)
| ~ algorithm_program_decides(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1_1) ).
fof(f35,axiom,
! [X2,X0,X1] :
( program_halts2_halts3_outputs(X0,X1,X2,good)
| ~ program_program_decides(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_1) ).
fof(f36,axiom,
! [X2,X0,X1] :
( program_not_halts2_halts3_outputs(X0,X1,X2,bad)
| ~ program_program_decides(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_2) ).
fof(f43,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] :
( halts2(X0,X1)
| ~ program_halts2(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i] :
( ~ program_not_halts2(X0,X1)
| ~ halts2(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( program_halts2(X1,X2)
| ~ program_halts2_halts3_outputs(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( program_not_halts2(X1,X2)
| ~ program_not_halts2_halts3_outputs(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_125,plain,
! [X0: $i] :
( program_program_decides(c1)
| ~ algorithm_program_decides(X0) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i,X2: $i] :
( program_halts2_halts3_outputs(X0,X1,X2,good)
| ~ program_program_decides(X0) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i,X2: $i] :
( program_not_halts2_halts3_outputs(X0,X1,X2,bad)
| ~ program_program_decides(X0) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_134,negated_conjecture,
algorithm_program_decides(c4),
inference(cnf_transformation,[],[f43]) ).
tcf(c_397,plain,
program_program_decides(c1),
inference(resolution,[status(thm)],[c_125,c_134]) ).
tcf(c_813,plain,
! [X0: $i,X1: $i,X2: $i] :
( program_halts2(X1,X2)
| ~ program_program_decides(X0) ),
inference(resolution,[status(thm)],[c_113,c_126]) ).
tcf(c_1022,plain,
! [X0: $i,X1: $i] : program_halts2(X0,X1),
inference(resolution,[status(thm)],[c_813,c_397]) ).
tcf(c_1095,plain,
! [X0: $i,X1: $i,X2: $i] :
( program_not_halts2(X1,X2)
| ~ program_program_decides(X0) ),
inference(resolution,[status(thm)],[c_116,c_127]) ).
tcf(c_1122,plain,
! [X0: $i,X1: $i] : program_not_halts2(X0,X1),
inference(resolution,[status(thm)],[c_1095,c_397]) ).
tcf(c_1123,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1122,c_1022,c_108,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM003-2 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.58 % Computer : n007.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Fri Sep 25 07:41:54 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.63
% 0.14/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.63
% 0.14/0.63 % Detected problem language: tptp
% 0.14/0.64 % Proving...
% 1.29/1.49 % SZS status Started for theBenchmark.p
% 1.29/1.49 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.49
% 1.29/1.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.29/1.49
% 1.29/1.49 % ------ iProver source info
% 1.29/1.49
% 1.29/1.49 % git: date: 2026-07-19 20:42:38 +0200
% 1.29/1.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.29/1.49 % git: non_committed_changes: false
% 1.29/1.49
% 1.29/1.49 % ------ Parsing...% successful
% 1.29/1.49
% 1.29/1.49
% 1.29/1.49 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.29/1.49
% 1.29/1.49 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s%
% 1.29/1.49
% 1.29/1.49 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.49
% 1.29/1.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.29/1.49
% 1.29/1.49
%------------------------------------------------------------------------------