TSTP Solution File: COM003-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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 : Wed Aug 30 18:36:03 EDT 2023
% Result : Unsatisfiable 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 35
% Syntax : Number of formulae : 50 ( 7 unt; 27 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 37 ( 21 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 44 ( 21 >; 23 *; 0 +; 0 <<)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 48 ( 26 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
program_decides: $i > $o ).
tff(decl_23,type,
program: $i > $o ).
tff(decl_24,type,
decides: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
f2: $i > $i ).
tff(decl_26,type,
f1: $i > $i ).
tff(decl_27,type,
program_program_decides: $i > $o ).
tff(decl_28,type,
algorithm_program_decides: $i > $o ).
tff(decl_29,type,
algorithm: $i > $o ).
tff(decl_30,type,
program_halts2: ( $i * $i ) > $o ).
tff(decl_31,type,
halts2: ( $i * $i ) > $o ).
tff(decl_32,type,
halts3_outputs: ( $i * $i * $i * $i ) > $o ).
tff(decl_33,type,
halts3: ( $i * $i * $i ) > $o ).
tff(decl_34,type,
outputs: ( $i * $i ) > $o ).
tff(decl_35,type,
program_not_halts2: ( $i * $i ) > $o ).
tff(decl_36,type,
halts2_outputs: ( $i * $i * $i ) > $o ).
tff(decl_37,type,
program_halts2_halts3_outputs: ( $i * $i * $i * $i ) > $o ).
tff(decl_38,type,
program_not_halts2_halts3_outputs: ( $i * $i * $i * $i ) > $o ).
tff(decl_39,type,
program_halts2_halts2_outputs: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
program_not_halts2_halts2_outputs: ( $i * $i * $i ) > $o ).
tff(decl_41,type,
c1: $i ).
tff(decl_42,type,
good: $i ).
tff(decl_43,type,
bad: $i ).
tff(decl_44,type,
f3: $i > $i ).
tff(decl_45,type,
c2: $i ).
tff(decl_46,type,
f4: $i > $i ).
tff(decl_47,type,
c3: $i ).
tff(decl_48,type,
c4: $i ).
cnf(program_halts2_halts3_outputs1,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
cnf(axiom2_1,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_1) ).
cnf(axiom1_1,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1_1) ).
cnf(prove_algorithm_does_not_exist,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
cnf(program_not_halts3a,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts3a) ).
cnf(program_halts3a,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts3a) ).
cnf(program_not_halts2_halts3_outputs1,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
cnf(axiom2_2,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_2) ).
cnf(c_0_8,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
program_halts2_halts3_outputs1 ).
cnf(c_0_9,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
axiom2_1 ).
cnf(c_0_10,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
axiom1_1 ).
cnf(c_0_11,negated_conjecture,
algorithm_program_decides(c4),
prove_algorithm_does_not_exist ).
cnf(c_0_12,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
program_not_halts3a ).
cnf(c_0_13,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
program_halts3a ).
cnf(c_0_14,hypothesis,
( program_halts2(X1,X2)
| ~ program_program_decides(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
program_program_decides(c1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ program_not_halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
program_halts2(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
program_not_halts2_halts3_outputs1 ).
cnf(c_0_19,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
axiom2_2 ).
cnf(c_0_20,plain,
~ program_not_halts2(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,hypothesis,
~ program_program_decides(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 12:57:00 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.59 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.007000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.009000 s
%------------------------------------------------------------------------------