TSTP Solution File: COM003_1 by SPASS+T---2.2.22

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : COM003_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% Computer : n022.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:45:01 EDT 2022

% Result   : Theorem 0.51s 1.15s
% Output   : Refutation 0.51s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : COM003_1 : TPTP v8.1.0. Released v5.0.0.
% 0.08/0.14  % Command  : spasst-tptp-script %s %d
% 0.15/0.36  % Computer : n022.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Thu Jun 16 20:06:32 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.51  % Using EUF theory
% 0.51/1.15  
% 0.51/1.15  
% 0.51/1.15  % SZS status Theorem for /tmp/SPASST_10937_n022.cluster.edu
% 0.51/1.15  
% 0.51/1.15  SPASS V 2.2.22  in combination with yices.
% 0.51/1.15  SPASS beiseite: Proof found by SPASS.
% 0.51/1.15  Problem: /tmp/SPASST_10937_n022.cluster.edu 
% 0.51/1.15  SPASS derived 173 clauses, backtracked 61 clauses and kept 187 clauses.
% 0.51/1.15  SPASS backtracked 7 times (0 times due to theory inconsistency).
% 0.51/1.15  SPASS allocated 6474 KBytes.
% 0.51/1.15  SPASS spent	0:00:00.03 on the problem.
% 0.51/1.15  		0:00:00.00 for the input.
% 0.51/1.15  		0:00:00.01 for the FLOTTER CNF translation.
% 0.51/1.15  		0:00:00.00 for inferences.
% 0.51/1.15  		0:00:00.00 for the backtracking.
% 0.51/1.15  		0:00:00.01 for the reduction.
% 0.51/1.15  		0:00:00.00 for interacting with the SMT procedure.
% 0.51/1.15  		
% 0.51/1.15  
% 0.51/1.15  % SZS output start CNFRefutation for /tmp/SPASST_10937_n022.cluster.edu
% 0.51/1.15  
% 0.51/1.15  % Here is a proof with depth 5, length 162 :
% 0.51/1.15  1[0:Inp] ||  -> program(skc16)*.
% 0.51/1.15  2[0:Inp] ||  -> program(skc15)*.
% 0.51/1.15  3[0:Inp] ||  -> program(skc13)*.
% 0.51/1.15  7[0:Inp] ||  -> input(skc11)*.
% 0.51/1.15  9[0:Inp] ||  -> program(skc9)*.
% 0.51/1.15  10[0:Inp] ||  -> algorithm(skc8)*.
% 0.51/1.15  11[0:Inp] ||  -> program(skf7(U))*.
% 0.51/1.15  12[0:Inp] ||  -> program(skf6(U))*.
% 0.51/1.15  13[0:Inp] ||  -> program(skf5(U))*.
% 0.51/1.15  14[0:Inp] ||  -> input(skf4(U))*.
% 0.51/1.15  15[0:Inp] || program(U) -> input(as_input(U))*.
% 0.51/1.15  17[0:Inp] ||  -> SkP1(U,V)* halts2(V,as_input(V))*.
% 0.51/1.15  18[0:Inp] ||  -> SkP0(U,V)* halts2(V,as_input(V))*.
% 0.51/1.15  19[0:Inp] || program(U) input(V) -> decides(skc8,U,V)*.
% 0.51/1.15  20(e)[0:Inp] || algorithm(U) decides(U,skf5(U),skf4(U))* -> SkC0.
% 0.51/1.15  22[0:Inp] || outputs(U,good) halts2(U,as_input(V))* -> SkP1(U,V).
% 0.51/1.15  23(e)[0:Inp] || SkC1 program(U) -> halts2(U,as_input(U))* outputs(skc15,bad).
% 0.51/1.15  24[0:Inp] || SkC2 program(U)+ -> halts2(U,as_input(U))* halts2(skc16,as_input(U))*.
% 0.51/1.15  25[0:Inp] || SkC1 program(U) halts2(U,as_input(U))* -> outputs(skc15,good).
% 0.51/1.15  26(e)[0:Inp] || program(U) SkC1 -> halts2(skc15,as_input(U))* halts2(U,as_input(U))*.
% 0.51/1.15  27[0:Inp] || outputs(U,good) halts3(U,V,as_input(V))* -> SkP0(U,V).
% 0.51/1.15  28[0:Inp] || SkC0 program(U) input(V) -> decides(algorithm_of(skc13),U,V)*.
% 0.51/1.15  29[0:Inp] || halts2(U,as_input(U))* program(U) SkC1 -> halts2(skc15,as_input(U))*.
% 0.51/1.15  30[0:Inp] || SkC2 program(U) halts2(U,as_input(U))*+ halts2(skc16,as_input(U))* -> .
% 0.51/1.15  31[0:Inp] || program(U) SkP1(U,skf7(U)) halts2(skf7(U),as_input(skf7(U)))* -> SkC2.
% 0.51/1.15  32[0:Inp] || program(U) SkP0(U,skf6(U)) halts2(skf6(U),as_input(skf6(U)))* -> SkC1.
% 0.51/1.15  33[0:Inp] || program(U) outputs(U,bad) SkP1(U,skf7(U)) halts2(U,as_input(skf7(U)))* -> SkC2.
% 0.51/1.15  34[0:Inp] || program(U) outputs(U,bad) SkP0(U,skf6(U)) halts3(U,skf6(U),as_input(skf6(U)))* -> SkC1.
% 0.51/1.15  35[0:Inp] || program(U) program(V) input(W) program(X) input(Y) decides(algorithm_of(U),X,Y)* -> halts2(V,W)* outputs(U,bad).
% 0.51/1.15  36(e)[0:Inp] || program(U) program(V) input(W) program(X) input(Y) halts2(V,W)* decides(algorithm_of(U),X,Y)*+ -> outputs(U,good).
% 0.51/1.15  37(e)[0:Inp] || input(U) program(V) input(W) program(X) decides(algorithm_of(Y),V,U)* program(Y) -> halts3(Y,X,W)* halts2(X,W).
% 0.51/1.15  38[0:Inp] || input(U) program(V) input(W) halts2(X,W) program(X) decides(algorithm_of(Y),V,U)* program(Y) -> halts3(Y,X,W)*.
% 0.51/1.15  39(e)[0:MRR:29.0,26.3] || SkC1 program(U) -> halts2(skc15,as_input(U))*.
% 0.51/1.15  40[0:MRR:38.3,37.7] || program(U) program(V) input(W) program(X) input(Y) decides(algorithm_of(U),X,Y)*+ -> halts3(U,V,W)*.
% 0.51/1.15  41[0:Res:10.0,20.1] || decides(skc8,skf5(skc8),skf4(skc8))* -> SkC0.
% 0.51/1.15  48[0:Res:13.0,19.1] || input(U) -> decides(skc8,skf5(V),U)*.
% 0.51/1.15  67[1:Spt:23.3] ||  -> outputs(skc15,bad)*.
% 0.51/1.15  69[0:Res:48.1,41.0] || input(skf4(skc8))* -> SkC0.
% 0.51/1.15  70[0:MRR:69.0,14.0] ||  -> SkC0*.
% 0.51/1.15  71[0:MRR:28.0,70.0] || program(U) input(V) -> decides(algorithm_of(skc13),U,V)*.
% 0.51/1.15  74[0:Res:39.2,22.1] || SkC1 program(U) outputs(skc15,good) -> SkP1(skc15,U)*.
% 0.51/1.15  76(e)[0:Res:17.1,25.2] || SkC1 program(U) -> SkP1(V,U)* outputs(skc15,good).
% 0.51/1.15  79(e)[0:MRR:74.2,76.3] || SkC1 program(U) -> SkP1(skc15,U)*.
% 0.51/1.15  85[0:Res:1.0,24.1] || SkC2 -> halts2(skc16,as_input(skc16))* halts2(skc16,as_input(skc16))*.
% 0.51/1.15  89[0:Obv:85.1] || SkC2 -> halts2(skc16,as_input(skc16))*.
% 0.51/1.15  101[0:Res:89.1,30.2] || SkC2 SkC2 program(skc16) halts2(skc16,as_input(skc16))* -> .
% 0.51/1.15  106[0:Obv:101.0] || SkC2 program(skc16) halts2(skc16,as_input(skc16))* -> .
% 0.51/1.15  107[0:MRR:106.1,106.2,1.0,89.1] || SkC2* -> .
% 0.51/1.15  108[0:MRR:31.3,107.0] || program(U) SkP1(U,skf7(U)) halts2(skf7(U),as_input(skf7(U)))* -> .
% 0.51/1.15  109[0:MRR:33.4,107.0] || program(U) outputs(U,bad) SkP1(U,skf7(U)) halts2(U,as_input(skf7(U)))* -> .
% 0.51/1.15  114[0:Res:17.1,108.2] || program(U) SkP1(U,skf7(U))*+ -> SkP1(V,skf7(U))*.
% 0.51/1.15  116[0:Res:79.2,114.1] || SkC1 program(skf7(skc15)) program(skc15) -> SkP1(U,skf7(skc15))*.
% 0.51/1.15  117(e)[0:MRR:116.1,116.2,11.0,2.0] || SkC1 -> SkP1(U,skf7(skc15))*.
% 0.51/1.15  119(e)[0:Res:17.1,32.2] || program(U) SkP0(U,skf6(U))* -> SkP1(V,skf6(U))* SkC1.
% 0.51/1.15  120[0:Res:18.1,32.2] || program(U) SkP0(U,skf6(U))* -> SkP0(V,skf6(U))* SkC1.
% 0.51/1.15  121[2:Spt:119.3] ||  -> SkC1*.
% 0.51/1.15  122[2:MRR:39.0,121.0] || program(U) -> halts2(skc15,as_input(U))*.
% 0.51/1.15  125[2:MRR:117.0,121.0] ||  -> SkP1(U,skf7(skc15))*.
% 0.51/1.15  129[2:Res:122.1,109.3] || program(skf7(skc15)) program(skc15) outputs(skc15,bad) SkP1(skc15,skf7(skc15))* -> .
% 0.51/1.15  130(e)[2:MRR:129.0,129.1,129.2,129.3,11.0,2.0,67.0,125.0] ||  -> .
% 0.51/1.15  131[2:Spt:130.0,119.3,121.0] || SkC1* -> .
% 0.51/1.15  132[2:Spt:130.0,119.0,119.1,119.2] || program(U) SkP0(U,skf6(U))*+ -> SkP1(V,skf6(U))*.
% 0.51/1.15  133[2:MRR:120.3,131.0] || program(U) SkP0(U,skf6(U))*+ -> SkP0(V,skf6(U))*.
% 0.51/1.15  134[2:MRR:32.3,131.0] || program(U) SkP0(U,skf6(U)) halts2(skf6(U),as_input(skf6(U)))* -> .
% 0.51/1.15  135[2:MRR:34.4,131.0] || program(U) outputs(U,bad) SkP0(U,skf6(U)) halts3(U,skf6(U),as_input(skf6(U)))* -> .
% 0.51/1.15  138[0:Res:71.2,40.5] || program(U)* input(V)* program(skc13) program(W) input(X) program(U)* input(V)* -> halts3(skc13,W,X)*.
% 0.51/1.15  139[0:Obv:138.1] || program(skc13) program(U) input(V) program(W)* input(X)* -> halts3(skc13,U,V)*.
% 0.51/1.15  140[0:Con:139.3] || program(skc13) program(U) input(V) -> halts3(skc13,U,V)*.
% 0.51/1.15  141[0:MRR:140.0,3.0] || program(U) input(V) -> halts3(skc13,U,V)*.
% 0.51/1.15  142[0:Res:141.2,27.1] || program(U) input(as_input(U)) outputs(skc13,good) -> SkP0(skc13,U)*.
% 0.51/1.15  143[2:Res:141.2,135.3] || program(skf6(skc13)) input(as_input(skf6(skc13))) program(skc13) outputs(skc13,bad) SkP0(skc13,skf6(skc13))* -> .
% 0.51/1.15  144[0:MRR:142.1,15.1] || program(U) outputs(skc13,good) -> SkP0(skc13,U)*.
% 0.51/1.15  145[2:MRR:143.0,143.2,12.0,3.0] || input(as_input(skf6(skc13))) outputs(skc13,bad) SkP0(skc13,skf6(skc13))* -> .
% 0.51/1.15  146[2:Res:144.2,133.1] || program(skf6(skc13)) outputs(skc13,good) program(skc13) -> SkP0(U,skf6(skc13))*.
% 0.51/1.15  148[2:MRR:146.0,146.2,12.0,3.0] || outputs(skc13,good) -> SkP0(U,skf6(skc13))*.
% 0.51/1.15  152[3:Spt:35.0,35.3,35.4,35.5,35.7] || program(U) program(V) input(W) decides(algorithm_of(U),V,W)* -> outputs(U,bad).
% 0.51/1.15  153[3:Res:71.2,152.3] || program(U)* input(V)* program(skc13) program(U)* input(V)* -> outputs(skc13,bad)*.
% 0.51/1.15  154[3:Obv:153.1] || program(skc13) program(U)* input(V)* -> outputs(skc13,bad)*.
% 0.51/1.15  155[3:Con:154.1] || program(skc13) input(U)* -> outputs(skc13,bad)*.
% 0.51/1.15  156[3:MRR:155.0,3.0] || input(U)*+ -> outputs(skc13,bad)*.
% 0.51/1.15  157[3:MRR:145.1,156.1] || input(as_input(skf6(skc13))) SkP0(skc13,skf6(skc13))* -> .
% 0.51/1.15  161[3:Res:148.1,157.1] || outputs(skc13,good) input(as_input(skf6(skc13)))* -> .
% 0.51/1.15  163[0:Res:71.2,36.6] || program(U)* input(V)* program(skc13) program(W) input(X) program(U)* input(V)* halts2(W,X)* -> outputs(skc13,good)*.
% 0.51/1.15  164[0:Obv:163.1] || program(skc13) program(U) input(V) program(W)* input(X)* halts2(U,V)* -> outputs(skc13,good)*.
% 0.51/1.15  165[0:Con:164.3] || program(skc13) program(U) input(V) halts2(U,V)* -> outputs(skc13,good)*.
% 0.51/1.15  166[0:MRR:165.0,3.0] || program(U) input(V) halts2(U,V)*+ -> outputs(skc13,good)*.
% 0.51/1.15  167[3:Res:15.1,161.1] || program(skf6(skc13)) outputs(skc13,good)* -> .
% 0.51/1.15  168[3:MRR:167.0,12.0] || outputs(skc13,good)* -> .
% 0.51/1.15  169[3:MRR:166.3,168.0] || program(U) input(V) halts2(U,V)* -> .
% 0.51/1.15  171[3:Res:18.1,169.2] || program(U) input(as_input(U)) -> SkP0(V,U)*.
% 0.51/1.15  173[3:MRR:171.1,15.1] || program(U) -> SkP0(V,U)*.
% 0.51/1.15  178[3:Res:173.1,157.1] || program(skf6(skc13)) input(as_input(skf6(skc13)))* -> .
% 0.51/1.15  179[3:MRR:178.0,12.0] || input(as_input(skf6(skc13)))* -> .
% 0.51/1.15  180[3:Res:15.1,179.0] || program(skf6(skc13))* -> .
% 0.51/1.15  181(e)[3:MRR:180.0,12.0] ||  -> .
% 0.51/1.15  182[3:Spt:181.0,35.1,35.2,35.6] || program(U) input(V) -> halts2(U,V)*.
% 0.51/1.15  183[3:MRR:166.2,182.2] || program(U)*+ input(V)* -> outputs(skc13,good)*.
% 0.51/1.15  188[3:Res:182.2,134.2] || program(skf6(U)) input(as_input(skf6(U))) program(U) SkP0(U,skf6(U))* -> .
% 0.51/1.15  190[3:MRR:188.0,12.0] || input(as_input(skf6(U))) program(U) SkP0(U,skf6(U))* -> .
% 0.51/1.15  194[3:Res:9.0,183.0] || input(U)*+ -> outputs(skc13,good)*.
% 0.51/1.15  204[3:Res:7.0,194.0] ||  -> outputs(skc13,good)*.
% 0.51/1.15  207[3:MRR:148.0,204.0] ||  -> SkP0(U,skf6(skc13))*.
% 0.51/1.15  217[3:Res:207.0,190.2] || input(as_input(skf6(skc13)))* program(skc13) -> .
% 0.51/1.15  219[3:MRR:217.1,3.0] || input(as_input(skf6(skc13)))* -> .
% 0.51/1.15  226[3:Res:15.1,219.0] || program(skf6(skc13))* -> .
% 0.51/1.15  227(e)[3:MRR:226.0,12.0] ||  -> .
% 0.51/1.15  228[1:Spt:227.0,23.3,67.0] || outputs(skc15,bad)* -> .
% 0.51/1.15  229(e)[1:Spt:227.0,23.0,23.1,23.2] || SkC1 program(U) -> halts2(U,as_input(U))*.
% 0.51/1.15  231[1:Res:229.2,108.2] || SkC1 program(skf7(U)) program(U) SkP1(U,skf7(U))* -> .
% 0.51/1.15  232(e)[1:MRR:231.1,11.0] || SkC1 program(U) SkP1(U,skf7(U))* -> .
% 0.51/1.15  233[2:Spt:119.3] ||  -> SkC1*.
% 0.51/1.15  237[2:MRR:79.0,233.0] || program(U) -> SkP1(skc15,U)*.
% 0.51/1.15  239[2:MRR:232.0,233.0] || program(U) SkP1(U,skf7(U))* -> .
% 0.51/1.15  243[2:Res:237.1,239.1] || program(skf7(skc15))* program(skc15) -> .
% 0.51/1.15  245(e)[2:MRR:243.0,243.1,11.0,2.0] ||  -> .
% 0.51/1.15  246[2:Spt:245.0,119.3,233.0] || SkC1* -> .
% 0.51/1.15  247[2:Spt:245.0,119.0,119.1,119.2] || program(U) SkP0(U,skf6(U))*+ -> SkP1(V,skf6(U))*.
% 0.51/1.15  248[2:MRR:120.3,246.0] || program(U) SkP0(U,skf6(U))*+ -> SkP0(V,skf6(U))*.
% 0.51/1.15  249[2:MRR:32.3,246.0] || program(U) SkP0(U,skf6(U)) halts2(skf6(U),as_input(skf6(U)))* -> .
% 0.51/1.15  250[2:MRR:34.4,246.0] || program(U) outputs(U,bad) SkP0(U,skf6(U)) halts3(U,skf6(U),as_input(skf6(U)))* -> .
% 0.51/1.15  257[2:Res:144.2,248.1] || program(skf6(skc13)) outputs(skc13,good) program(skc13) -> SkP0(U,skf6(skc13))*.
% 0.51/1.15  258(e)[2:MRR:257.0,257.2,12.0,3.0] || outputs(skc13,good) -> SkP0(U,skf6(skc13))*.
% 0.51/1.15  261[0:Res:17.1,166.2] || program(U) input(as_input(U)) -> SkP1(V,U)* outputs(skc13,good).
% 0.51/1.15  262[0:Res:18.1,166.2] || program(U) input(as_input(U)) -> SkP0(V,U)* outputs(skc13,good).
% 0.51/1.15  263(e)[0:MRR:261.1,15.1] || program(U) -> SkP1(V,U)* outputs(skc13,good).
% 0.51/1.15  264[0:MRR:262.1,15.1] || program(U) -> SkP0(V,U)* outputs(skc13,good).
% 0.51/1.15  266[3:Spt:263.2] ||  -> outputs(skc13,good)*.
% 0.51/1.15  268[3:MRR:258.0,266.0] ||  -> SkP0(U,skf6(skc13))*.
% 0.51/1.15  273[2:Res:141.2,250.3] || program(skf6(skc13)) input(as_input(skf6(skc13))) program(skc13) outputs(skc13,bad) SkP0(skc13,skf6(skc13))* -> .
% 0.51/1.15  274[3:MRR:273.0,273.2,273.4,12.0,3.0,268.0] || input(as_input(skf6(skc13)))* outputs(skc13,bad) -> .
% 0.51/1.15  275[3:Res:15.1,274.0] || program(skf6(skc13)) outputs(skc13,bad)* -> .
% 0.51/1.15  276[3:MRR:275.0,12.0] || outputs(skc13,bad)* -> .
% 0.51/1.15  277[4:Spt:35.0,35.3,35.4,35.5,35.7] || program(U) program(V) input(W) decides(algorithm_of(U),V,W)* -> outputs(U,bad).
% 0.51/1.15  278[4:Res:71.2,277.3] || program(U)* input(V)* program(skc13) program(U)* input(V)* -> outputs(skc13,bad)*.
% 0.51/1.15  279[4:Obv:278.1] || program(skc13) program(U)* input(V)* -> outputs(skc13,bad)*.
% 0.51/1.15  280[4:Con:279.1] || program(skc13) input(U)* -> outputs(skc13,bad)*.
% 0.51/1.15  281[4:MRR:280.0,3.0] || input(U)* -> outputs(skc13,bad)*.
% 0.51/1.15  282[4:MRR:281.1,276.0] || input(U)* -> .
% 0.51/1.15  283(e)[4:UnC:282.0,14.0] ||  -> .
% 0.51/1.15  284[4:Spt:283.0,35.1,35.2,35.6] || program(U) input(V) -> halts2(U,V)*.
% 0.51/1.15  290[4:Res:284.2,249.2] || program(skf6(U)) input(as_input(skf6(U))) program(U) SkP0(U,skf6(U))* -> .
% 0.51/1.15  292[4:MRR:290.0,12.0] || input(as_input(skf6(U))) program(U) SkP0(U,skf6(U))* -> .
% 0.51/1.15  294[4:Res:268.0,292.2] || input(as_input(skf6(skc13)))* program(skc13) -> .
% 0.51/1.15  296[4:MRR:294.1,3.0] || input(as_input(skf6(skc13)))* -> .
% 0.51/1.15  297[4:Res:15.1,296.0] || program(skf6(skc13))* -> .
% 0.51/1.15  298(e)[4:MRR:297.0,12.0] ||  -> .
% 0.51/1.15  299[3:Spt:298.0,263.2,266.0] || outputs(skc13,good)* -> .
% 0.51/1.15  300[3:Spt:298.0,263.0,263.1] || program(U) -> SkP1(V,U)*.
% 0.51/1.15  301[3:MRR:264.2,299.0] || program(U) -> SkP0(V,U)*.
% 0.51/1.15  302[3:MRR:166.3,299.0] || program(U) input(V) halts2(U,V)* -> .
% 0.51/1.15  303[2:MRR:273.0,273.2,12.0,3.0] || input(as_input(skf6(skc13))) outputs(skc13,bad) SkP0(skc13,skf6(skc13))* -> .
% 0.51/1.15  304[3:MRR:35.6,302.2] || program(U) program(V)* input(W)* program(X) input(Y) decides(algorithm_of(U),X,Y)*+ -> outputs(U,bad).
% 0.51/1.15  311[3:Res:301.1,303.2] || program(skf6(skc13)) input(as_input(skf6(skc13)))* outputs(skc13,bad) -> .
% 0.51/1.15  312[3:MRR:311.0,12.0] || input(as_input(skf6(skc13)))* outputs(skc13,bad) -> .
% 0.51/1.15  313[3:Res:15.1,312.0] || program(skf6(skc13)) outputs(skc13,bad)* -> .
% 0.51/1.15  314(e)[3:MRR:313.0,12.0] || outputs(skc13,bad)* -> .
% 0.51/1.15  315[3:Res:71.2,304.5] || program(U)* input(V)* program(skc13) program(W)* input(X)* program(U)* input(V)* -> outputs(skc13,bad)*.
% 0.51/1.15  316[3:Obv:315.1] || program(skc13) program(U)* input(V)* program(W)* input(X)* -> outputs(skc13,bad)*.
% 0.51/1.15  317[3:Con:316.1] || program(skc13) input(U)* -> outputs(skc13,bad)*.
% 0.51/1.15  318[3:MRR:317.0,3.0] || input(U)* -> outputs(skc13,bad)*.
% 0.51/1.15  319[3:MRR:318.1,314.0] || input(U)* -> .
% 0.51/1.15  320(e)[3:UnC:319.0,14.0] ||  -> .
% 0.51/1.15  
% 0.51/1.15  % SZS output end CNFRefutation for /tmp/SPASST_10937_n022.cluster.edu
% 0.51/1.15  
% 0.51/1.15  Formulae used in the proof : fof_p4 fof_program_type fof_p3 fof_p1 fof_input_type fof_prove_this fof_as_input_type fof_p2
% 0.51/1.17  
% 0.51/1.17  SPASS+T ended
%------------------------------------------------------------------------------