TSTP Solution File: COM003-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n021.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:35:07 EDT 2023
% Result : Unsatisfiable 0.49s 0.66s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 13:02:29 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.57 start to proof:theBenchmark
% 0.49/0.64 %-------------------------------------------
% 0.49/0.64 % File :CSE---1.6
% 0.49/0.64 % Problem :theBenchmark
% 0.49/0.64 % Transform :cnf
% 0.49/0.64 % Format :tptp:raw
% 0.49/0.64 % Command :java -jar mcs_scs.jar %d %s
% 0.49/0.64
% 0.49/0.64 % Result :Theorem 0.040000s
% 0.49/0.64 % Output :CNFRefutation 0.040000s
% 0.49/0.64 %-------------------------------------------
% 0.49/0.64 %--------------------------------------------------------------------------
% 0.49/0.64 % File : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% 0.49/0.64 % Domain : Computing Theory
% 0.49/0.65 % Problem : The halting problem is undecidable
% 0.49/0.65 % Version : [Bru91] axioms.
% 0.49/0.65 % English :
% 0.49/0.65
% 0.49/0.65 % Refs : [Bur87b] Burkholder (1987), A 76th Automated Theorem Proving Pr
% 0.49/0.65 % : [Bru91] Brushi (1991), The Halting Problem
% 0.49/0.65 % Source : [Bru91]
% 0.49/0.65 % Names : - [Bru91]
% 0.49/0.65
% 0.49/0.65 % Status : Unsatisfiable
% 0.49/0.65 % Rating : 0.14 v8.1.0, 0.00 v2.0.0
% 0.49/0.65 % Syntax : Number of clauses : 43 ( 1 unt; 2 nHn; 35 RR)
% 0.49/0.65 % Number of literals : 109 ( 0 equ; 65 neg)
% 0.49/0.65 % Maximal clause size : 5 ( 2 avg)
% 0.49/0.65 % Maximal term depth : 2 ( 1 avg)
% 0.49/0.65 % Number of predicates : 17 ( 17 usr; 0 prp; 1-4 aty)
% 0.49/0.65 % Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% 0.49/0.65 % Number of variables : 103 ( 24 sgn)
% 0.49/0.65 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.49/0.65
% 0.49/0.65 % Comments :
% 0.49/0.65 %--------------------------------------------------------------------------
% 0.49/0.65 %----Definitions of the new predicates.
% 0.49/0.65 % (all X (program_decides(X) <->
% 0.49/0.65 % (all Y (program(Y) -> (all Z decides(X,Y,Z)))))).
% 0.49/0.65 cnf(program_decides1,axiom,
% 0.49/0.65 ( ~ program_decides(X)
% 0.49/0.65 | ~ program(Y)
% 0.49/0.65 | decides(X,Y,Z) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_decides2,axiom,
% 0.49/0.65 ( program_decides(X)
% 0.49/0.65 | program(f2(X)) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_decides3,axiom,
% 0.49/0.65 ( program_decides(X)
% 0.49/0.65 | ~ decides(X,f2(X),f1(X)) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (program_program_decides(X) <->
% 0.49/0.65 % (program(X) & program_decides(X)))).
% 0.49/0.65 cnf(program_program_decides1,axiom,
% 0.49/0.65 ( ~ program_program_decides(X)
% 0.49/0.65 | program(X) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_program_decides2,axiom,
% 0.49/0.65 ( ~ program_program_decides(X)
% 0.49/0.65 | program_decides(X) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_program_decides3,axiom,
% 0.49/0.65 ( program_program_decides(X)
% 0.49/0.65 | ~ program(X)
% 0.49/0.65 | ~ program_decides(X) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (algorithm_program_decides(X) <->
% 0.49/0.65 % (algorithm(X) & program_decides(X)))).
% 0.49/0.65 cnf(algorithm_program_decides1,axiom,
% 0.49/0.65 ( ~ algorithm_program_decides(X)
% 0.49/0.65 | algorithm(X) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(algorithm_program_decides2,axiom,
% 0.49/0.65 ( ~ algorithm_program_decides(X)
% 0.49/0.65 | program_decides(X) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(algorithm_program_decides3,axiom,
% 0.49/0.65 ( algorithm_program_decides(X)
% 0.49/0.65 | ~ algorithm(X)
% 0.49/0.65 | ~ program_decides(X) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (program_halts2(X,Y) <->
% 0.49/0.65 % (program(X) & halts2(X,Y))))).
% 0.49/0.65 cnf(program_halts1,axiom,
% 0.49/0.65 ( ~ program_halts2(X,Y)
% 0.49/0.65 | program(X) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_halts3a,axiom,
% 0.49/0.65 ( ~ program_halts2(X,Y)
% 0.49/0.65 | halts2(X,Y) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_halts3b,axiom,
% 0.49/0.65 ( program_halts2(X,Y)
% 0.49/0.65 | ~ program(X)
% 0.49/0.65 | ~ halts2(X,Y) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (all Z (all W (halts3_outputs(X,Y,Z,W) <->
% 0.49/0.65 % (halts3(X,Y,Z) & outputs(X,W))))))).
% 0.49/0.65 cnf(halts3_outputs1,axiom,
% 0.49/0.65 ( ~ halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | halts3(X,Y,Z) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(halts3_outputs2,axiom,
% 0.49/0.65 ( ~ halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | outputs(X,W) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(halts3_outputs3,axiom,
% 0.49/0.65 ( halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | ~ halts3(X,Y,Z)
% 0.49/0.65 | ~ outputs(X,W) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (program_not_halts2(X,Y) <->
% 0.49/0.65 % (program(X) & -halts2(X,Y))))).
% 0.49/0.65 cnf(program_not_halts1,axiom,
% 0.49/0.65 ( ~ program_not_halts2(X,Y)
% 0.49/0.65 | program(X) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_not_halts3a,axiom,
% 0.49/0.65 ( ~ program_not_halts2(X,Y)
% 0.49/0.65 | ~ halts2(X,Y) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_not_halts3b,axiom,
% 0.49/0.65 ( program_not_halts2(X,Y)
% 0.49/0.65 | ~ program(X)
% 0.49/0.65 | halts2(X,Y) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (all W (halts2_outputs(X,Y,W) <->
% 0.49/0.65 % (halts2(X,Y) & outputs(X,W)))))).
% 0.49/0.65 cnf(halts2_outputs1,axiom,
% 0.49/0.65 ( ~ halts2_outputs(X,Y,W)
% 0.49/0.65 | halts2(X,Y) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(halts2_outputs2,axiom,
% 0.49/0.65 ( ~ halts2_outputs(X,Y,W)
% 0.49/0.65 | outputs(X,W) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(halts2_outputs3,axiom,
% 0.49/0.65 ( halts2_outputs(X,Y,W)
% 0.49/0.65 | ~ halts2(X,Y)
% 0.49/0.65 | ~ outputs(X,W) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (all Z (all W (program_halts2_halts3_outputs(X,Y,Z,W) <->
% 0.49/0.65 % (program_halts2(Y,Z) &
% 0.49/0.65 % halts3_outputs(X,Y,Z,W))))))).
% 0.49/0.65 cnf(program_halts2_halts3_outputs1,axiom,
% 0.49/0.65 ( ~ program_halts2_halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | program_halts2(Y,Z) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_halts2_halts3_outputs2,axiom,
% 0.49/0.65 ( ~ program_halts2_halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | halts3_outputs(X,Y,Z,W) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_halts2_halts3_outputs3,axiom,
% 0.49/0.65 ( program_halts2_halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | ~ program_halts2(Y,Z)
% 0.49/0.65 | ~ halts3_outputs(X,Y,Z,W) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (all Z (all W (program_not_halts2_halts3_outputs(X,Y,Z,W) <->
% 0.49/0.65 % (program_not_halts2(Y,Z) &
% 0.49/0.65 % halts3_outputs(X,Y,Z,W))))))).
% 0.49/0.65 cnf(program_not_halts2_halts3_outputs1,axiom,
% 0.49/0.65 ( ~ program_not_halts2_halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | program_not_halts2(Y,Z) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_not_halts2_halts3_outputs2,axiom,
% 0.49/0.65 ( ~ program_not_halts2_halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | halts3_outputs(X,Y,Z,W) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_not_halts2_halts3_outputs3,axiom,
% 0.49/0.65 ( program_not_halts2_halts3_outputs(X,Y,Z,W)
% 0.49/0.65 | ~ program_not_halts2(Y,Z)
% 0.49/0.65 | ~ halts3_outputs(X,Y,Z,W) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (all W (program_halts2_halts2_outputs(X,Y,W) <->
% 0.49/0.65 % (program_halts2(Y,Y) & halts2_outputs(X,Y,W)))))).
% 0.49/0.65 cnf(program_halts2_halts2_outputs1,axiom,
% 0.49/0.65 ( ~ program_halts2_halts2_outputs(X,Y,W)
% 0.49/0.65 | program_halts2(Y,Y) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_halts2_halts2_outputs2,axiom,
% 0.49/0.65 ( ~ program_halts2_halts2_outputs(X,Y,W)
% 0.49/0.65 | halts2_outputs(X,Y,W) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_halts2_halts2_outputs3,axiom,
% 0.49/0.65 ( program_halts2_halts2_outputs(X,Y,W)
% 0.49/0.65 | ~ program_halts2(Y,Y)
% 0.49/0.65 | ~ halts2_outputs(X,Y,W) ) ).
% 0.49/0.65
% 0.49/0.65 % (all X (all Y (all W (program_not_halts2_halts2_outputs(X,Y,W) <->
% 0.49/0.65 % (program_not_halts2(Y,Y) & halts2_outputs(X,Y,W)))))).
% 0.49/0.65 cnf(program_not_halts2_halts2_outputs1,axiom,
% 0.49/0.65 ( ~ program_not_halts2_halts2_outputs(X,Y,W)
% 0.49/0.65 | program_not_halts2(Y,Y) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_not_halts2_halts2_outputs2,axiom,
% 0.49/0.65 ( ~ program_not_halts2_halts2_outputs(X,Y,W)
% 0.49/0.65 | halts2_outputs(X,Y,W) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(program_not_halts2_halts2_outputs3,axiom,
% 0.49/0.65 ( program_not_halts2_halts2_outputs(X,Y,W)
% 0.49/0.65 | ~ program_not_halts2(Y,Y)
% 0.49/0.65 | ~ halts2_outputs(X,Y,W) ) ).
% 0.49/0.65
% 0.49/0.65 % New verions of the original axioms
% 0.49/0.65 % ((exists X algorithm_program_decides(X)) ->
% 0.49/0.65 % (exists W program_program_decides(W))).
% 0.49/0.65 cnf(axiom1_1,hypothesis,
% 0.49/0.65 ( ~ algorithm_program_decides(X)
% 0.49/0.65 | program_program_decides(c1) ) ).
% 0.49/0.65
% 0.49/0.65 % (all W (program_program_decides(W) ->
% 0.49/0.65 % (all Y (all Z (program_halts2_halts3_outputs(W,Y,Z,good) &
% 0.49/0.65 % program_not_halts2_halts3_outputs(W,Y,Z,bad)))))).
% 0.49/0.65 cnf(axiom2_1,hypothesis,
% 0.49/0.65 ( ~ program_program_decides(W)
% 0.49/0.65 | program_halts2_halts3_outputs(W,Y,Z,good) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(axiom2_2,hypothesis,
% 0.49/0.65 ( ~ program_program_decides(W)
% 0.49/0.65 | program_not_halts2_halts3_outputs(W,Y,Z,bad) ) ).
% 0.49/0.65
% 0.49/0.65 % ((exists W (program(W) &
% 0.49/0.65 % (all Y (program_halts2_halts3_outputs(W,Y,Y,good) &
% 0.49/0.65 % program_not_halts2_halts3_outputs(W,Y,Y,bad))))) ->
% 0.49/0.65 % (exists V (program(V) &
% 0.49/0.65 % (all Y (program_halts2_halts2_outputs(V,Y,good) &
% 0.49/0.65 % program_not_halts2_halts2_outputs(V,Y,bad)))))).
% 0.49/0.65 cnf(axiom3_1,hypothesis,
% 0.49/0.65 ( ~ program(W)
% 0.49/0.65 | ~ program_halts2_halts3_outputs(W,f3(W),f3(W),good)
% 0.49/0.65 | ~ program_not_halts2_halts3_outputs(W,f3(W),f3(W),bad)
% 0.49/0.65 | program(c2) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(axiom3_2,hypothesis,
% 0.49/0.65 ( ~ program(W)
% 0.49/0.65 | ~ program_halts2_halts3_outputs(W,f3(W),f3(W),good)
% 0.49/0.65 | ~ program_not_halts2_halts3_outputs(W,f3(W),f3(W),bad)
% 0.49/0.65 | program_halts2_halts2_outputs(c2,Y,good) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(axiom3_3,hypothesis,
% 0.49/0.65 ( ~ program(W)
% 0.49/0.65 | ~ program_halts2_halts3_outputs(W,f3(W),f3(W),good)
% 0.49/0.65 | ~ program_not_halts2_halts3_outputs(W,f3(W),f3(W),bad)
% 0.49/0.65 | program_not_halts2_halts2_outputs(c2,Y,bad) ) ).
% 0.49/0.65
% 0.49/0.65 % ((exists V (program(V) &
% 0.49/0.65 % (all Y (program_halts2_halts2_outputs(V,Y,good) &
% 0.49/0.65 % program_not_halts2_halts2_outputs(V,Y,bad))))) ->
% 0.49/0.65 % (exists U (program(U) &
% 0.49/0.65 % (all Y ((program_halts2(Y,Y) -> halts2(U,Y)) &
% 0.49/0.65 % program_not_halts2_halts2_outputs(U,Y,bad)))))).
% 0.49/0.65 cnf(axiom4_1,hypothesis,
% 0.49/0.65 ( ~ program(V)
% 0.49/0.65 | ~ program_halts2_halts2_outputs(V,f4(V),good)
% 0.49/0.65 | ~ program_not_halts2_halts2_outputs(V,f4(V),bad)
% 0.49/0.65 | program(c3) ) ).
% 0.49/0.65
% 0.49/0.65 cnf(axiom4_2,hypothesis,
% 0.49/0.65 ( ~ program(V)
% 0.49/0.65 | ~ program_halts2_halts2_outputs(V,f4(V),good)
% 0.49/0.65 | ~ program_not_halts2_halts2_outputs(V,f4(V),bad)
% 0.49/0.65 | ~ program_halts2(Y,Y)
% 0.49/0.65 | halts2(c3,Y) ) ).
% 0.49/0.66
% 0.49/0.66 cnf(axiom4_3,hypothesis,
% 0.49/0.66 ( ~ program(V)
% 0.49/0.66 | ~ program_halts2_halts2_outputs(V,f4(V),good)
% 0.49/0.66 | ~ program_not_halts2_halts2_outputs(V,f4(V),bad)
% 0.49/0.66 | program_not_halts2_halts2_outputs(c3,Y,bad) ) ).
% 0.49/0.66
% 0.49/0.66 %--- Prove -(exists X algorithm_program_decides(X)).
% 0.49/0.66 cnf(prove_algorithm_does_not_exist,negated_conjecture,
% 0.49/0.66 algorithm_program_decides(c4) ).
% 0.49/0.66
% 0.49/0.66 %--------------------------------------------------------------------------
% 0.49/0.66 %-------------------------------------------
% 0.49/0.66 % Proof found
% 0.49/0.66 % SZS status Theorem for theBenchmark
% 0.49/0.66 % SZS output start Proof
% 0.49/0.66 %ClaNum:43(EqnAxiom:0)
% 0.49/0.66 %VarNum:225(SingletonVarNum:103)
% 0.49/0.66 %MaxLitNum:5
% 0.49/0.66 %MaxfuncDepth:1
% 0.49/0.66 %SharedTerms:10
% 0.49/0.66 %goalClause: 1
% 0.49/0.66 %singleGoalClaCount:1
% 0.49/0.66 [1]P1(a1)
% 0.49/0.66 [2]~P1(x21)+P3(a2)
% 0.49/0.66 [3]~P3(x31)+P4(x31)
% 0.49/0.66 [4]~P1(x41)+P4(x41)
% 0.49/0.66 [5]~P3(x51)+P5(x51)
% 0.49/0.66 [6]~P1(x61)+P2(x61)
% 0.49/0.66 [7]P4(x71)+P5(f6(x71))
% 0.49/0.66 [22]P4(x221)+~P7(x221,f6(x221),f7(x221))
% 0.49/0.66 [10]P5(x101)+~P12(x101,x102)
% 0.49/0.66 [11]P5(x111)+~P13(x111,x112)
% 0.49/0.66 [13]~P12(x131,x132)+P6(x131,x132)
% 0.49/0.66 [15]~P13(x151,x152)+~P6(x151,x152)
% 0.49/0.66 [18]P12(x181,x181)+~P14(x182,x181,x183)
% 0.49/0.66 [19]P6(x191,x192)+~P8(x191,x192,x193)
% 0.49/0.66 [20]P9(x201,x202)+~P8(x201,x203,x202)
% 0.49/0.66 [21]P13(x211,x211)+~P16(x212,x211,x213)
% 0.49/0.66 [23]~P14(x231,x232,x233)+P8(x231,x232,x233)
% 0.49/0.66 [24]~P16(x241,x242,x243)+P8(x241,x242,x243)
% 0.49/0.66 [30]~P3(x301)+P15(x301,x302,x303,a10)
% 0.49/0.66 [31]~P3(x311)+P17(x311,x312,x313,a3)
% 0.49/0.66 [33]P12(x331,x332)+~P15(x333,x331,x332,x334)
% 0.49/0.66 [34]P9(x341,x342)+~P10(x341,x343,x344,x342)
% 0.49/0.66 [35]P13(x351,x352)+~P17(x353,x351,x352,x354)
% 0.49/0.66 [36]P11(x361,x362,x363)+~P10(x361,x362,x363,x364)
% 0.49/0.66 [37]~P15(x371,x372,x373,x374)+P10(x371,x372,x373,x374)
% 0.49/0.66 [38]~P17(x381,x382,x383,x384)+P10(x381,x382,x383,x384)
% 0.49/0.66 [8]~P4(x81)+~P5(x81)+P3(x81)
% 0.49/0.66 [9]~P4(x91)+~P2(x91)+P1(x91)
% 0.49/0.66 [12]P13(x121,x122)+~P5(x121)+P6(x121,x122)
% 0.49/0.66 [14]~P5(x141)+~P6(x141,x142)+P12(x141,x142)
% 0.49/0.66 [16]~P4(x161)+~P5(x162)+P7(x161,x162,x163)
% 0.49/0.66 [17]~P6(x171,x172)+~P9(x171,x173)+P8(x171,x172,x173)
% 0.49/0.66 [25]~P12(x252,x252)+~P8(x251,x252,x253)+P14(x251,x252,x253)
% 0.49/0.66 [26]~P13(x262,x262)+~P8(x261,x262,x263)+P16(x261,x262,x263)
% 0.49/0.66 [32]~P9(x321,x324)+~P11(x321,x322,x323)+P10(x321,x322,x323,x324)
% 0.49/0.66 [39]~P12(x392,x393)+~P10(x391,x392,x393,x394)+P15(x391,x392,x393,x394)
% 0.49/0.66 [40]~P13(x402,x403)+~P10(x401,x402,x403,x404)+P17(x401,x402,x403,x404)
% 0.49/0.66 [27]~P5(x271)+~P14(x271,f8(x271),a10)+~P16(x271,f8(x271),a3)+P5(a4)
% 0.49/0.66 [41]~P5(x411)+~P15(x411,f9(x411),f9(x411),a10)+~P17(x411,f9(x411),f9(x411),a3)+P5(a5)
% 0.49/0.66 [29]~P5(x292)+~P14(x292,f8(x292),a10)+~P16(x292,f8(x292),a3)+P16(a4,x291,a3)
% 0.49/0.66 [42]~P5(x422)+~P15(x422,f9(x422),f9(x422),a10)+~P17(x422,f9(x422),f9(x422),a3)+P14(a5,x421,a10)
% 0.49/0.66 [43]~P5(x432)+~P15(x432,f9(x432),f9(x432),a10)+~P17(x432,f9(x432),f9(x432),a3)+P16(a5,x431,a3)
% 0.49/0.66 [28]~P12(x281,x281)+~P5(x282)+P6(a4,x281)+~P14(x282,f8(x282),a10)+~P16(x282,f8(x282),a3)
% 0.49/0.66 %EqnAxiom
% 0.49/0.66
% 0.49/0.66 %-------------------------------------------
% 0.49/0.66 cnf(45,plain,
% 0.49/0.66 (P4(a1)),
% 0.49/0.66 inference(scs_inference,[],[1,6,4])).
% 0.49/0.66 cnf(46,plain,
% 0.49/0.66 (P3(a2)),
% 0.49/0.66 inference(scs_inference,[],[1,6,4,2])).
% 0.49/0.66 cnf(51,plain,
% 0.49/0.66 (P17(a2,x511,x512,a3)),
% 0.49/0.66 inference(scs_inference,[],[46,31])).
% 0.49/0.66 cnf(53,plain,
% 0.49/0.66 (P15(a2,x531,x532,a10)),
% 0.49/0.66 inference(scs_inference,[],[46,31,30])).
% 0.49/0.66 cnf(59,plain,
% 0.49/0.66 (P16(a5,x591,a3)),
% 0.49/0.66 inference(scs_inference,[],[46,31,30,5,3,43])).
% 0.49/0.66 cnf(61,plain,
% 0.49/0.66 (P14(a5,x611,a10)),
% 0.49/0.66 inference(scs_inference,[],[46,31,30,5,3,43,42])).
% 0.49/0.66 cnf(63,plain,
% 0.49/0.66 (P5(a5)),
% 0.49/0.66 inference(scs_inference,[],[46,31,30,5,3,43,42,41])).
% 0.49/0.66 cnf(81,plain,
% 0.49/0.66 (P12(f9(a2),f9(a2))),
% 0.49/0.66 inference(scs_inference,[],[45,46,31,30,5,3,43,42,41,16,12,29,38,37,36,35,34,33])).
% 0.49/0.66 cnf(85,plain,
% 0.49/0.66 (P8(a5,f8(a5),a10)),
% 0.49/0.66 inference(scs_inference,[],[45,46,31,30,5,3,43,42,41,16,12,29,38,37,36,35,34,33,24,23])).
% 0.49/0.66 cnf(87,plain,
% 0.49/0.66 (P13(f8(a5),f8(a5))),
% 0.49/0.66 inference(scs_inference,[],[45,46,31,30,5,3,43,42,41,16,12,29,38,37,36,35,34,33,24,23,21])).
% 0.49/0.66 cnf(91,plain,
% 0.49/0.66 (P6(a5,f8(a5))),
% 0.49/0.66 inference(scs_inference,[],[45,46,31,30,5,3,43,42,41,16,12,29,38,37,36,35,34,33,24,23,21,20,19])).
% 0.49/0.66 cnf(127,plain,
% 0.49/0.66 (P14(a5,x1271,a10)),
% 0.49/0.66 inference(rename_variables,[],[61])).
% 0.49/0.66 cnf(128,plain,
% 0.49/0.66 (P16(a5,x1281,a3)),
% 0.49/0.66 inference(rename_variables,[],[59])).
% 0.49/0.66 cnf(134,plain,
% 0.49/0.66 (~P13(a5,f8(a5))),
% 0.49/0.66 inference(scs_inference,[],[81,59,128,61,127,91,63,27,28,15])).
% 0.49/0.66 cnf(164,plain,
% 0.49/0.66 ($false),
% 0.49/0.66 inference(scs_inference,[],[53,134,85,87,51,37,26,38,35]),
% 0.49/0.66 ['proof']).
% 0.49/0.66 % SZS output end Proof
% 0.49/0.66 % Total time :0.040000s
%------------------------------------------------------------------------------