TSTP Solution File: COM003-2 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n003.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 : 600s
% DateTime : Fri Jul 15 01:32:26 EDT 2022
% Result : Unsatisfiable 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 42 ( 0 equ; 17 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 : 53 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(program_halts3a,axiom,
( ~ program_halts2(X,Y)
| halts2(X,Y) ) ).
cnf(program_not_halts3a,axiom,
( ~ program_not_halts2(X,Y)
| ~ halts2(X,Y) ) ).
cnf(program_halts2_halts3_outputs1,axiom,
( ~ program_halts2_halts3_outputs(X,Y,Z,W)
| program_halts2(Y,Z) ) ).
cnf(program_not_halts2_halts3_outputs1,axiom,
( ~ program_not_halts2_halts3_outputs(X,Y,Z,W)
| program_not_halts2(Y,Z) ) ).
cnf(axiom1_1,hypothesis,
( ~ algorithm_program_decides(X)
| program_program_decides(c1) ) ).
cnf(axiom2_1,hypothesis,
( ~ program_program_decides(W)
| program_halts2_halts3_outputs(W,Y,Z,good) ) ).
cnf(axiom2_2,hypothesis,
( ~ program_program_decides(W)
| program_not_halts2_halts3_outputs(W,Y,Z,bad) ) ).
cnf(prove_algorithm_does_not_exist,negated_conjecture,
algorithm_program_decides(c4) ).
cnf(refute_0_0,plain,
( ~ halts2(X_81,X_82)
| ~ program_not_halts2(X_81,X_82) ),
inference(subst,[],[program_not_halts3a:[bind(X,$fot(X_81)),bind(Y,$fot(X_82))]]) ).
cnf(refute_0_1,plain,
( ~ algorithm_program_decides(c4)
| program_program_decides(c1) ),
inference(subst,[],[axiom1_1:[bind(X,$fot(c4))]]) ).
cnf(refute_0_2,plain,
program_program_decides(c1),
inference(resolve,[$cnf( algorithm_program_decides(c4) )],[prove_algorithm_does_not_exist,refute_0_1]) ).
cnf(refute_0_3,plain,
( ~ program_program_decides(c1)
| program_not_halts2_halts3_outputs(c1,X_51,X_52,bad) ),
inference(subst,[],[axiom2_2:[bind(W,$fot(c1)),bind(Y,$fot(X_51)),bind(Z,$fot(X_52))]]) ).
cnf(refute_0_4,plain,
program_not_halts2_halts3_outputs(c1,X_51,X_52,bad),
inference(resolve,[$cnf( program_program_decides(c1) )],[refute_0_2,refute_0_3]) ).
cnf(refute_0_5,plain,
program_not_halts2_halts3_outputs(c1,X_79,X_80,bad),
inference(subst,[],[refute_0_4:[bind(X_51,$fot(X_79)),bind(X_52,$fot(X_80))]]) ).
cnf(refute_0_6,plain,
( ~ program_not_halts2_halts3_outputs(c1,X_79,X_80,bad)
| program_not_halts2(X_79,X_80) ),
inference(subst,[],[program_not_halts2_halts3_outputs1:[bind(W,$fot(bad)),bind(X,$fot(c1)),bind(Y,$fot(X_79)),bind(Z,$fot(X_80))]]) ).
cnf(refute_0_7,plain,
program_not_halts2(X_79,X_80),
inference(resolve,[$cnf( program_not_halts2_halts3_outputs(c1,X_79,X_80,bad) )],[refute_0_5,refute_0_6]) ).
cnf(refute_0_8,plain,
program_not_halts2(X_81,X_82),
inference(subst,[],[refute_0_7:[bind(X_79,$fot(X_81)),bind(X_80,$fot(X_82))]]) ).
cnf(refute_0_9,plain,
~ halts2(X_81,X_82),
inference(resolve,[$cnf( program_not_halts2(X_81,X_82) )],[refute_0_8,refute_0_0]) ).
cnf(refute_0_10,plain,
( ~ program_halts2(X_64,X_65)
| halts2(X_64,X_65) ),
inference(subst,[],[program_halts3a:[bind(X,$fot(X_64)),bind(Y,$fot(X_65))]]) ).
cnf(refute_0_11,plain,
( ~ program_program_decides(c1)
| program_halts2_halts3_outputs(c1,X_44,X_45,good) ),
inference(subst,[],[axiom2_1:[bind(W,$fot(c1)),bind(Y,$fot(X_44)),bind(Z,$fot(X_45))]]) ).
cnf(refute_0_12,plain,
program_halts2_halts3_outputs(c1,X_44,X_45,good),
inference(resolve,[$cnf( program_program_decides(c1) )],[refute_0_2,refute_0_11]) ).
cnf(refute_0_13,plain,
program_halts2_halts3_outputs(c1,X_62,X_63,good),
inference(subst,[],[refute_0_12:[bind(X_44,$fot(X_62)),bind(X_45,$fot(X_63))]]) ).
cnf(refute_0_14,plain,
( ~ program_halts2_halts3_outputs(c1,X_62,X_63,good)
| program_halts2(X_62,X_63) ),
inference(subst,[],[program_halts2_halts3_outputs1:[bind(W,$fot(good)),bind(X,$fot(c1)),bind(Y,$fot(X_62)),bind(Z,$fot(X_63))]]) ).
cnf(refute_0_15,plain,
program_halts2(X_62,X_63),
inference(resolve,[$cnf( program_halts2_halts3_outputs(c1,X_62,X_63,good) )],[refute_0_13,refute_0_14]) ).
cnf(refute_0_16,plain,
program_halts2(X_64,X_65),
inference(subst,[],[refute_0_15:[bind(X_62,$fot(X_64)),bind(X_63,$fot(X_65))]]) ).
cnf(refute_0_17,plain,
halts2(X_64,X_65),
inference(resolve,[$cnf( program_halts2(X_64,X_65) )],[refute_0_16,refute_0_10]) ).
cnf(refute_0_18,plain,
halts2(X_81,X_82),
inference(subst,[],[refute_0_17:[bind(X_64,$fot(X_81)),bind(X_65,$fot(X_82))]]) ).
cnf(refute_0_19,plain,
$false,
inference(resolve,[$cnf( halts2(X_81,X_82) )],[refute_0_18,refute_0_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 18:02:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.20/0.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.37
% 0.20/0.37 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.20/0.37
%------------------------------------------------------------------------------