TSTP Solution File: SWC198-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC198-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n012.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 : Tue Jul 19 22:02:25 EDT 2022

% Result   : Unsatisfiable 3.21s 3.40s
% Output   : Refutation 3.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC198-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 12 19:59:56 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 3.21/3.40  
% 3.21/3.40  SPASS V 3.9 
% 3.21/3.40  SPASS beiseite: Proof found.
% 3.21/3.40  % SZS status Theorem
% 3.21/3.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 3.21/3.40  SPASS derived 7968 clauses, backtracked 3097 clauses, performed 69 splits and kept 6735 clauses.
% 3.21/3.40  SPASS allocated 83556 KBytes.
% 3.21/3.40  SPASS spent	0:00:02.82 on the problem.
% 3.21/3.40  		0:00:00.04 for the input.
% 3.21/3.40  		0:00:00.00 for the FLOTTER CNF translation.
% 3.21/3.40  		0:00:00.06 for inferences.
% 3.21/3.40  		0:00:00.05 for the backtracking.
% 3.21/3.40  		0:00:02.47 for the reduction.
% 3.21/3.40  
% 3.21/3.40  
% 3.21/3.40  Here is a proof with depth 2, length 94 :
% 3.21/3.40  % SZS output start Refutation
% 3.21/3.40  1[0:Inp] ||  -> ssList(sk1)*.
% 3.21/3.40  2[0:Inp] ||  -> ssList(sk2)*.
% 3.21/3.40  6[0:Inp] ||  -> equal(sk3,sk1)**.
% 3.21/3.40  7[0:Inp] ssItem(u) ||  -> ssItem(sk5(u))*.
% 3.21/3.40  8[0:Inp] ssItem(u) ||  -> memberP(sk1,sk5(u))*.
% 3.21/3.40  9[0:Inp] ssItem(u) || equal(sk5(u),u)** -> .
% 3.21/3.40  11[0:Inp] ||  -> ssItem(sk6)* equal(nil,sk3).
% 3.21/3.40  15[0:Inp] ||  -> equal(cons(sk6,nil),sk3)** equal(nil,sk3).
% 3.21/3.40  18[0:Inp] ||  -> equalelemsP(nil)*.
% 3.21/3.40  19[0:Inp] ||  -> duplicatefreeP(nil)*.
% 3.21/3.40  20[0:Inp] ||  -> strictorderedP(nil)*.
% 3.21/3.40  21[0:Inp] ||  -> totalorderedP(nil)*.
% 3.21/3.40  22[0:Inp] ||  -> strictorderP(nil)*.
% 3.21/3.40  23[0:Inp] ||  -> totalorderP(nil)*.
% 3.21/3.40  24[0:Inp] ||  -> cyclefreeP(nil)*.
% 3.21/3.40  25[0:Inp] ||  -> ssList(nil)*.
% 3.21/3.40  29[0:Inp] ||  -> ssItem(skaf83(u))*.
% 3.21/3.40  88[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 3.21/3.40  89[0:Inp] ssList(u) ||  -> ssItem(v)* duplicatefreeP(u)*.
% 3.21/3.40  178[0:Inp] ssItem(u) ssItem(v) ssList(w) || memberP(cons(v,w),u)* -> equal(u,v) memberP(w,u).
% 3.21/3.40  194[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u).
% 3.21/3.40  205[0:Rew:6.0,11.1] ||  -> ssItem(sk6)* equal(nil,sk1).
% 3.21/3.40  209[0:Rew:6.0,15.1,6.0,15.0] ||  -> equal(nil,sk1) equal(cons(sk6,nil),sk1)**.
% 3.21/3.40  298[0:Res:2.0,89.0] ||  -> ssItem(u)* duplicatefreeP(sk2)*.
% 3.21/3.40  469[0:Res:1.0,89.0] ||  -> ssItem(u)* duplicatefreeP(sk1)*.
% 3.21/3.40  484[0:Res:1.0,194.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 3.21/3.40  563[1:Spt:89.1] ||  -> ssItem(u)*.
% 3.21/3.40  568[1:MRR:88.0,563.0] || memberP(nil,u)* -> .
% 3.21/3.40  577[1:MRR:8.0,563.0] ||  -> memberP(sk1,sk5(u))*.
% 3.21/3.40  578[1:MRR:9.0,563.0] || equal(sk5(u),u)** -> .
% 3.21/3.40  669[1:MRR:178.1,178.0,563.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w).
% 3.21/3.40  771[2:Spt:484.5] ||  -> equal(nil,sk1)**.
% 3.21/3.40  856[2:Rew:771.0,568.0] || memberP(sk1,u)* -> .
% 3.21/3.40  882[2:UnC:856.0,577.0] ||  -> .
% 3.21/3.40  1188[2:Spt:882.0,484.5,771.0] || equal(nil,sk1)** -> .
% 3.21/3.40  1189[2:Spt:882.0,484.0,484.1,484.2,484.3,484.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 3.21/3.40  1195[2:MRR:209.0,1188.0] ||  -> equal(cons(sk6,nil),sk1)**.
% 3.21/3.40  2286[2:SpL:1195.0,669.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  2298[2:SSi:2286.0,25.0,24.0,23.0,22.0,21.0,20.0,19.0,18.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  2299[2:MRR:2298.2,568.0] || memberP(sk1,u)* -> equal(u,sk6).
% 3.21/3.40  2308[2:Res:577.0,2299.0] ||  -> equal(sk5(u),sk6)**.
% 3.21/3.40  2310[2:UnC:2308.0,578.0] ||  -> .
% 3.21/3.40  2311[1:Spt:2310.0,89.0,89.2] ssList(u) ||  -> duplicatefreeP(u)*.
% 3.21/3.40  2356[2:Spt:469.0] ||  -> ssItem(u)*.
% 3.21/3.40  2359[2:MRR:8.0,2356.0] ||  -> memberP(sk1,sk5(u))*.
% 3.21/3.40  2368[2:MRR:88.0,2356.0] || memberP(nil,u)* -> .
% 3.21/3.40  2371[2:MRR:9.0,2356.0] || equal(sk5(u),u)** -> .
% 3.21/3.40  2462[2:MRR:178.1,178.0,2356.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w).
% 3.21/3.40  2558[3:Spt:484.5] ||  -> equal(nil,sk1)**.
% 3.21/3.40  2659[3:Rew:2558.0,2368.0] || memberP(sk1,u)* -> .
% 3.21/3.40  2673[3:UnC:2659.0,2359.0] ||  -> .
% 3.21/3.40  2994[3:Spt:2673.0,484.5,2558.0] || equal(nil,sk1)** -> .
% 3.21/3.40  2995[3:Spt:2673.0,484.0,484.1,484.2,484.3,484.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 3.21/3.40  3001[3:MRR:209.0,2994.0] ||  -> equal(cons(sk6,nil),sk1)**.
% 3.21/3.40  4161[3:SpL:3001.0,2462.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  4173[3:SSi:4161.0,25.0,24.0,23.0,22.0,21.0,20.0,19.0,18.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  4174[3:MRR:4173.2,2368.0] || memberP(sk1,u)* -> equal(u,sk6).
% 3.21/3.40  4183[3:Res:2359.0,4174.0] ||  -> equal(sk5(u),sk6)**.
% 3.21/3.40  4185[3:UnC:4183.0,2371.0] ||  -> .
% 3.21/3.40  4186[2:Spt:4185.0,469.1] ||  -> duplicatefreeP(sk1)*.
% 3.21/3.40  4189[3:Spt:298.0] ||  -> ssItem(u)*.
% 3.21/3.40  4194[3:MRR:88.0,4189.0] || memberP(nil,u)* -> .
% 3.21/3.40  4203[3:MRR:8.0,4189.0] ||  -> memberP(sk1,sk5(u))*.
% 3.21/3.40  4204[3:MRR:9.0,4189.0] || equal(sk5(u),u)** -> .
% 3.21/3.40  4295[3:MRR:178.1,178.0,4189.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w).
% 3.21/3.40  4389[4:Spt:484.5] ||  -> equal(nil,sk1)**.
% 3.21/3.40  4479[4:Rew:4389.0,4194.0] || memberP(sk1,u)* -> .
% 3.21/3.40  4504[4:UnC:4479.0,4203.0] ||  -> .
% 3.21/3.40  4825[4:Spt:4504.0,484.5,4389.0] || equal(nil,sk1)** -> .
% 3.21/3.40  4826[4:Spt:4504.0,484.0,484.1,484.2,484.3,484.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 3.21/3.40  4832[4:MRR:209.0,4825.0] ||  -> equal(cons(sk6,nil),sk1)**.
% 3.21/3.40  6006[4:SpL:4832.0,4295.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  6018[4:SSi:6006.0,25.0,24.0,23.0,22.0,21.0,20.0,19.0,18.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  6019[4:MRR:6018.2,4194.0] || memberP(sk1,u)* -> equal(u,sk6).
% 3.21/3.40  6028[4:Res:4203.0,6019.0] ||  -> equal(sk5(u),sk6)**.
% 3.21/3.40  6030[4:UnC:6028.0,4204.0] ||  -> .
% 3.21/3.40  6031[3:Spt:6030.0,298.1] ||  -> duplicatefreeP(sk2)*.
% 3.21/3.40  6032[4:Spt:484.5] ||  -> equal(nil,sk1)**.
% 3.21/3.40  6126[4:Rew:6032.0,88.1] ssItem(u) || memberP(sk1,u)* -> .
% 3.21/3.40  6497[4:Res:8.1,6126.1] ssItem(u) ssItem(sk5(u)) ||  -> .
% 3.21/3.40  6498[4:SSi:6497.1,7.1] ssItem(u) ||  -> .
% 3.21/3.40  6499[4:UnC:6498.0,29.0] ||  -> .
% 3.21/3.40  6500[4:Spt:6499.0,484.5,6032.0] || equal(nil,sk1)** -> .
% 3.21/3.40  6501[4:Spt:6499.0,484.0,484.1,484.2,484.3,484.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 3.21/3.40  6502[4:MRR:205.1,6500.0] ||  -> ssItem(sk6)*.
% 3.21/3.40  6509[4:MRR:209.0,6500.0] ||  -> equal(cons(sk6,nil),sk1)**.
% 3.21/3.40  10833[4:SpL:6509.0,178.3] ssItem(u) ssItem(sk6) ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  10840[4:SSi:10833.2,10833.1,25.0,24.0,23.0,22.0,21.0,20.0,19.0,18.0,6502.0] ssItem(u) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 3.21/3.40  10841[4:MRR:10840.3,88.1] ssItem(u) || memberP(sk1,u)* -> equal(u,sk6).
% 3.21/3.40  10955[4:Res:8.1,10841.1] ssItem(u) ssItem(sk5(u)) ||  -> equal(sk5(u),sk6)**.
% 3.21/3.40  10957[4:SSi:10955.1,7.1] ssItem(u) ||  -> equal(sk5(u),sk6)**.
% 3.21/3.40  10960[4:Rew:10957.1,9.1] ssItem(u) || equal(sk6,u)* -> .
% 3.21/3.40  10981[4:EmS:10960.0,6502.0] || equal(sk6,sk6)* -> .
% 3.21/3.40  10999[4:Obv:10981.0] ||  -> .
% 3.21/3.40  % SZS output end Refutation
% 3.21/3.40  Formulae used in the proof : co1_1 co1_2 co1_6 co1_7 co1_8 co1_9 co1_11 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause12 clause71 clause72 clause161 clause177
% 3.21/3.40  
%------------------------------------------------------------------------------