TSTP Solution File: SWC061+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n017.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:01:27 EDT 2022

% Result   : Theorem 37.67s 37.89s
% Output   : Refutation 37.67s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWC061+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 17:56:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 37.67/37.89  
% 37.67/37.89  SPASS V 3.9 
% 37.67/37.89  SPASS beiseite: Proof found.
% 37.67/37.89  % SZS status Theorem
% 37.67/37.89  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 37.67/37.89  SPASS derived 19459 clauses, backtracked 8879 clauses, performed 52 splits and kept 12509 clauses.
% 37.67/37.89  SPASS allocated 125468 KBytes.
% 37.67/37.89  SPASS spent	0:0:33.30 on the problem.
% 37.67/37.89  		0:00:00.04 for the input.
% 37.67/37.89  		0:00:00.07 for the FLOTTER CNF translation.
% 37.67/37.89  		0:00:00.35 for inferences.
% 37.67/37.89  		0:00:00.85 for the backtracking.
% 37.67/37.89  		0:0:31.60 for the reduction.
% 37.67/37.89  
% 37.67/37.89  
% 37.67/37.89  Here is a proof with depth 5, length 104 :
% 37.67/37.89  % SZS output start Refutation
% 37.67/37.89  1[0:Inp] ||  -> ssList(skc9)*.
% 37.67/37.89  2[0:Inp] ||  -> ssItem(skc8)*.
% 37.67/37.89  3[0:Inp] ||  -> ssList(skc7)*.
% 37.67/37.89  4[0:Inp] ||  -> ssList(skc6)*.
% 37.67/37.89  7[0:Inp] ||  -> ssList(nil)*.
% 37.67/37.89  8[0:Inp] ||  -> cyclefreeP(nil)*.
% 37.67/37.89  9[0:Inp] ||  -> totalorderP(nil)*.
% 37.67/37.89  10[0:Inp] ||  -> strictorderP(nil)*.
% 37.67/37.89  11[0:Inp] ||  -> totalorderedP(nil)*.
% 37.67/37.89  12[0:Inp] ||  -> strictorderedP(nil)*.
% 37.67/37.89  13[0:Inp] ||  -> duplicatefreeP(nil)*.
% 37.67/37.89  14[0:Inp] ||  -> equalelemsP(nil)*.
% 37.67/37.89  60[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 37.67/37.89  66[0:Inp] ssList(u) ||  -> segmentP(u,u)*.
% 37.67/37.89  67[0:Inp] ssList(u) ||  -> segmentP(u,nil)*.
% 37.67/37.89  69[0:Inp] || equal(skc7,nil)** -> equal(skc6,nil).
% 37.67/37.89  70[0:Inp] || SkP0(skc6,skc7) -> neq(skc7,nil)*.
% 37.67/37.89  71[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 37.67/37.89  73[0:Inp] ssItem(u) ||  -> cyclefreeP(cons(u,nil))*.
% 37.67/37.89  74[0:Inp] ssItem(u) ||  -> totalorderP(cons(u,nil))*.
% 37.67/37.89  75[0:Inp] ssItem(u) ||  -> strictorderP(cons(u,nil))*.
% 37.67/37.89  76[0:Inp] ssItem(u) ||  -> totalorderedP(cons(u,nil))*.
% 37.67/37.89  77[0:Inp] ssItem(u) ||  -> strictorderedP(cons(u,nil))*.
% 37.67/37.89  78[0:Inp] ssItem(u) ||  -> duplicatefreeP(cons(u,nil))*.
% 37.67/37.89  79[0:Inp] ssItem(u) ||  -> equalelemsP(cons(u,nil))*.
% 37.67/37.89  81[0:Inp] ssList(u) ||  -> equal(app(nil,u),u)**.
% 37.67/37.89  82[0:Inp] ssList(u) ||  -> equal(app(u,nil),u)**.
% 37.67/37.89  90[0:Inp] ssItem(u) ssList(v) ||  -> ssList(cons(u,v))*.
% 37.67/37.89  91[0:Inp] ssList(u) ssList(v) ||  -> ssList(app(v,u))*.
% 37.67/37.89  98[0:Inp] || neq(skc7,nil) -> equal(app(cons(skc8,nil),skc9),skc7)**.
% 37.67/37.89  99[0:Inp] || neq(skc7,nil) -> equal(app(skc9,cons(skc8,nil)),skc6)**.
% 37.67/37.89  109[0:Inp] ssList(u) ssList(v) ||  -> neq(v,u)* equal(v,u).
% 37.67/37.89  122[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 37.67/37.89  129[0:Inp] ssItem(u) ssList(v) ||  -> equal(app(cons(u,nil),v),cons(u,v))**.
% 37.67/37.89  156[0:Inp] ssList(u) || neq(u,nil) segmentP(skc6,u) segmentP(skc7,u)* SkP0(skc6,skc7) -> .
% 37.67/37.89  161[0:Inp] ssList(u) ssList(v) ssList(w) ||  -> equal(app(app(w,v),u),app(w,app(v,u)))**.
% 37.67/37.89  187[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(app(u,x),v),w)* -> segmentP(w,x)*.
% 37.67/37.89  189[0:Inp] ssList(u) ssList(v) || equal(tl(u),tl(v))* equal(hd(u),hd(v)) -> equal(u,v) equal(nil,v) equal(nil,u).
% 37.67/37.89  202[0:Rew:161.3,187.4] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(x,app(u,w)),v)*+ -> segmentP(v,u)*.
% 37.67/37.89  279[0:Res:4.0,81.0] ||  -> equal(app(nil,skc6),skc6)**.
% 37.67/37.89  285[0:Res:4.0,66.0] ||  -> segmentP(skc6,skc6)*.
% 37.67/37.89  327[0:Res:4.0,91.1] ssList(u) ||  -> ssList(app(u,skc6))*.
% 37.67/37.89  405[0:Res:3.0,156.0] || neq(skc7,nil) segmentP(skc7,skc7)* segmentP(skc6,skc7) SkP0(skc6,skc7) -> .
% 37.67/37.89  451[0:Res:3.0,81.0] ||  -> equal(app(nil,skc7),skc7)**.
% 37.67/37.89  452[0:Res:3.0,82.0] ||  -> equal(app(skc7,nil),skc7)**.
% 37.67/37.89  457[0:Res:3.0,66.0] ||  -> segmentP(skc7,skc7)*.
% 37.67/37.89  458[0:Res:3.0,67.0] ||  -> segmentP(skc7,nil)*.
% 37.67/37.89  459[0:Res:3.0,189.1] ssList(u) || equal(tl(skc7),tl(u))* equal(hd(skc7),hd(u)) -> equal(nil,u) equal(skc7,u) equal(skc7,nil).
% 37.67/37.89  548[0:MRR:405.0,405.1,70.1,457.0] || SkP0(skc6,skc7) segmentP(skc6,skc7)* -> .
% 37.67/37.89  557[1:Spt:459.5] ||  -> equal(skc7,nil)**.
% 37.67/37.89  562[1:Rew:557.0,548.0] || SkP0(skc6,nil) segmentP(skc6,skc7)* -> .
% 37.67/37.89  570[1:Rew:557.0,69.0] || equal(nil,nil) -> equal(skc6,nil)**.
% 37.67/37.89  668[1:Rew:557.0,458.0] ||  -> segmentP(nil,nil)*.
% 37.67/37.89  716[1:Obv:570.0] ||  -> equal(skc6,nil)**.
% 37.67/37.89  888[1:Rew:716.0,562.1,557.0,562.1,716.0,562.0] || SkP0(nil,nil) segmentP(nil,nil)* -> .
% 37.67/37.89  889[1:MRR:888.1,668.0] || SkP0(nil,nil)* -> .
% 37.67/37.89  1073[1:Res:71.1,889.0] || equal(nil,nil)* -> .
% 37.67/37.89  1074[1:Obv:1073.0] ||  -> .
% 37.67/37.89  1075[1:Spt:1074.0,459.5,557.0] || equal(skc7,nil)** -> .
% 37.67/37.89  1076[1:Spt:1074.0,459.0,459.1,459.2,459.3,459.4] ssList(u) || equal(tl(skc7),tl(u))* equal(hd(skc7),hd(u)) -> equal(nil,u) equal(skc7,u).
% 37.67/37.89  1878[2:Spt:156.0,156.1,156.2,156.3] ssList(u) || neq(u,nil) segmentP(skc6,u) segmentP(skc7,u)* -> .
% 37.67/37.89  1881[2:Res:457.0,1878.3] ssList(skc7) || neq(skc7,nil) segmentP(skc6,skc7)* -> .
% 37.67/37.89  1883[2:SSi:1881.0,3.0] || neq(skc7,nil) segmentP(skc6,skc7)* -> .
% 37.67/37.89  1887[3:Spt:70.1] ||  -> neq(skc7,nil)*.
% 37.67/37.89  1888[3:MRR:98.0,1887.0] ||  -> equal(app(cons(skc8,nil),skc9),skc7)**.
% 37.67/37.89  1889[3:MRR:99.0,1887.0] ||  -> equal(app(skc9,cons(skc8,nil)),skc6)**.
% 37.67/37.89  1890[3:MRR:1883.0,1887.0] || segmentP(skc6,skc7)* -> .
% 37.67/37.89  2528[0:EqR:122.2] ssList(cons(u,nil)) ssItem(u) ||  -> singletonP(cons(u,nil))*.
% 37.67/37.89  2531[0:SSi:2528.0,90.1,14.1,13.1,10.1,9.1,8.1,12.1,11.0,7.0,79.0,78.0,75.0,74.0,73.0,77.0,76.2] ssItem(u) ||  -> singletonP(cons(u,nil))*.
% 37.67/37.89  2878[3:SpR:129.2,1888.0] ssItem(skc8) ssList(skc9) ||  -> equal(cons(skc8,skc9),skc7)**.
% 37.67/37.89  2889[3:SSi:2878.1,2878.0,1.0,2.0] ||  -> equal(cons(skc8,skc9),skc7)**.
% 37.67/37.89  5482[3:SpR:1888.0,161.3] ssList(u) ssList(skc9) ssList(cons(skc8,nil)) ||  -> equal(app(cons(skc8,nil),app(skc9,u)),app(skc7,u))**.
% 37.67/37.89  6213[0:EqR:202.4] ssList(u) ssList(app(v,app(u,w))) ssList(w) ssList(v) ||  -> segmentP(app(v,app(u,w)),u)*.
% 37.67/37.89  6230[3:SpL:1889.0,202.4] ssList(skc9) ssList(u) ssList(cons(skc8,nil)) ssList(v) || equal(app(v,skc6),u)* -> segmentP(u,skc9)*.
% 37.67/37.89  6249[0:SSi:6213.1,91.2,91.2] ssList(u) ssList(v) ssList(w) ||  -> segmentP(app(w,app(u,v)),u)*.
% 37.67/37.89  7415[3:SSi:5482.2,5482.1,90.0,2.0,14.1,13.0,10.1,9.0,8.1,12.0,11.1,7.0,79.1,2.0,78.1,2.0,75.1,2.0,74.1,2.0,73.0,2.0,77.0,2.0,76.0,2.0,2531.0,2.0,1.2] ssList(u) ||  -> equal(app(cons(skc8,nil),app(skc9,u)),app(skc7,u))**.
% 37.67/37.89  7421[3:SSi:6230.2,6230.0,90.0,2.0,14.1,13.0,10.1,9.0,8.1,12.0,11.1,7.0,79.1,2.0,78.1,2.0,75.1,2.0,74.1,2.0,73.0,2.0,77.0,2.0,76.0,2.0,2531.0,2.0,1.2] ssList(u) ssList(v) || equal(app(v,skc6),u)*+ -> segmentP(u,skc9)*.
% 37.67/37.89  15420[3:EqR:7421.2] ssList(app(u,skc6)) ssList(u) ||  -> segmentP(app(u,skc6),skc9)*.
% 37.67/37.89  15435[3:SSi:15420.0,327.1] ssList(u) ||  -> segmentP(app(u,skc6),skc9)*.
% 37.67/37.89  15497[3:SpR:279.0,15435.1] ssList(nil) ||  -> segmentP(skc6,skc9)*.
% 37.67/37.89  15512[3:SSi:15497.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0] ||  -> segmentP(skc6,skc9)*.
% 37.67/37.89  19443[3:SpR:7415.1,6249.3] ssList(u) ssList(skc9) ssList(u) ssList(cons(skc8,nil)) ||  -> segmentP(app(skc7,u),skc9)*.
% 37.67/37.89  19480[3:Obv:19443.0] ssList(skc9) ssList(u) ssList(cons(skc8,nil)) ||  -> segmentP(app(skc7,u),skc9)*.
% 37.67/37.89  22544[3:SSi:19480.2,19480.0,90.0,2.0,14.1,13.0,10.1,9.0,8.1,12.0,11.1,7.0,79.1,2.0,78.1,2.0,75.1,2.0,74.1,2.0,73.0,2.0,77.0,2.0,76.0,2.0,2531.0,2.0,1.2] ssList(u) ||  -> segmentP(app(skc7,u),skc9)*.
% 37.67/37.89  26667[3:SpR:452.0,22544.1] ssList(nil) ||  -> segmentP(skc7,skc9)*.
% 37.67/37.89  26675[3:SSi:26667.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0] ||  -> segmentP(skc7,skc9)*.
% 37.67/37.89  29135[3:Res:26675.0,1878.3] ssList(skc9) || neq(skc9,nil) segmentP(skc6,skc9)* -> .
% 37.67/37.89  29432[3:SSi:29135.0,1.0] || neq(skc9,nil) segmentP(skc6,skc9)* -> .
% 37.67/37.89  29433[3:MRR:29432.1,15512.0] || neq(skc9,nil)* -> .
% 37.67/37.89  30402[3:Res:109.2,29433.0] ssList(nil) ssList(skc9) ||  -> equal(skc9,nil)**.
% 37.67/37.89  30410[3:SSi:30402.1,30402.0,1.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0] ||  -> equal(skc9,nil)**.
% 37.67/37.89  30415[3:Rew:30410.0,1889.0] ||  -> equal(app(nil,cons(skc8,nil)),skc6)**.
% 37.67/37.89  30420[3:Rew:30410.0,2889.0] ||  -> equal(cons(skc8,nil),skc7)**.
% 37.67/37.89  30754[3:Rew:30420.0,30415.0] ||  -> equal(app(nil,skc7),skc6)**.
% 37.67/37.89  30755[3:Rew:451.0,30754.0] ||  -> equal(skc7,skc6)**.
% 37.67/37.89  30772[3:Rew:30755.0,1890.0] || segmentP(skc6,skc6)* -> .
% 37.67/37.89  31125[3:MRR:30772.0,285.0] ||  -> .
% 37.67/37.89  32471[3:Spt:31125.0,70.1,1887.0] || neq(skc7,nil)* -> .
% 37.67/37.89  32472[3:Spt:31125.0,70.0] || SkP0(skc6,skc7)* -> .
% 37.67/37.89  32790[3:Res:60.0,32472.0] ||  -> equal(skc7,nil)**.
% 37.67/37.89  32791[3:MRR:32790.0,1075.0] ||  -> .
% 37.67/37.89  32792[2:Spt:32791.0,156.4] || SkP0(skc6,skc7)* -> .
% 37.67/37.89  32794[2:Res:60.0,32792.0] ||  -> equal(skc7,nil)**.
% 37.67/37.89  32795[2:MRR:32794.0,1075.0] ||  -> .
% 37.67/37.89  % SZS output end Refutation
% 37.67/37.89  Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax55 ax57 ax59 ax61 ax63 ax65 ax68 ax71 ax73 ax28 ax84 ax16 ax26 ax15 ax4 ax81 ax82 ax7 ax77
% 37.67/37.89  
%------------------------------------------------------------------------------