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

View Problem - Process Solution

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

% Computer : n028.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:12 EDT 2022

% Result   : Theorem 1.08s 1.28s
% Output   : Refutation 1.08s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC028+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.15/0.34  % Computer : n028.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit : 300
% 0.15/0.34  % WCLimit  : 600
% 0.15/0.34  % DateTime : Sun Jun 12 06:32:36 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 1.08/1.28  
% 1.08/1.28  SPASS V 3.9 
% 1.08/1.28  SPASS beiseite: Proof found.
% 1.08/1.28  % SZS status Theorem
% 1.08/1.28  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.08/1.28  SPASS derived 1691 clauses, backtracked 895 clauses, performed 35 splits and kept 1929 clauses.
% 1.08/1.28  SPASS allocated 99855 KBytes.
% 1.08/1.28  SPASS spent	0:00:00.90 on the problem.
% 1.08/1.28  		0:00:00.04 for the input.
% 1.08/1.28  		0:00:00.07 for the FLOTTER CNF translation.
% 1.08/1.28  		0:00:00.01 for inferences.
% 1.08/1.28  		0:00:00.01 for the backtracking.
% 1.08/1.28  		0:00:00.61 for the reduction.
% 1.08/1.28  
% 1.08/1.28  
% 1.08/1.28  Here is a proof with depth 6, length 90 :
% 1.08/1.28  % SZS output start Refutation
% 1.08/1.28  1[0:Inp] ||  -> ssList(skc5)*.
% 1.08/1.28  2[0:Inp] ||  -> ssList(skc4)*.
% 1.08/1.28  3[0:Inp] ||  -> ssItem(skc7)*.
% 1.08/1.28  4[0:Inp] ||  -> ssItem(skc6)*.
% 1.08/1.28  5[0:Inp] ||  -> ssList(nil)*.
% 1.08/1.28  6[0:Inp] ||  -> cyclefreeP(nil)*.
% 1.08/1.28  7[0:Inp] ||  -> totalorderP(nil)*.
% 1.08/1.28  8[0:Inp] ||  -> strictorderP(nil)*.
% 1.08/1.28  9[0:Inp] ||  -> totalorderedP(nil)*.
% 1.08/1.28  10[0:Inp] ||  -> strictorderedP(nil)*.
% 1.08/1.28  11[0:Inp] ||  -> duplicatefreeP(nil)*.
% 1.08/1.28  12[0:Inp] ||  -> equalelemsP(nil)*.
% 1.08/1.28  51[0:Inp] || equal(skc7,skc6)** -> .
% 1.08/1.28  58[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 1.08/1.28  59[0:Inp] ||  -> SkP1(u,v)* equal(nil,v).
% 1.08/1.28  60[0:Inp] ||  -> SkP1(u,v)* equal(nil,u).
% 1.08/1.28  69[0:Inp] || SkP1(skc4,skc5) -> neq(skc4,nil)*.
% 1.08/1.28  70[0:Inp] || SkP1(skc4,skc5) -> rearsegP(skc5,skc4)*.
% 1.08/1.28  71[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 1.08/1.28  73[0:Inp] ssItem(u) ||  -> cyclefreeP(cons(u,nil))*.
% 1.08/1.28  74[0:Inp] ssItem(u) ||  -> totalorderP(cons(u,nil))*.
% 1.08/1.28  75[0:Inp] ssItem(u) ||  -> strictorderP(cons(u,nil))*.
% 1.08/1.28  76[0:Inp] ssItem(u) ||  -> totalorderedP(cons(u,nil))*.
% 1.08/1.28  77[0:Inp] ssItem(u) ||  -> strictorderedP(cons(u,nil))*.
% 1.08/1.28  78[0:Inp] ssItem(u) ||  -> duplicatefreeP(cons(u,nil))*.
% 1.08/1.28  79[0:Inp] ssItem(u) ||  -> equalelemsP(cons(u,nil))*.
% 1.08/1.28  81[0:Inp] || SkP0(skc5,skc4)* SkP0(skc4,skc5) -> .
% 1.08/1.28  82[0:Inp] ssList(u) ||  -> equal(app(nil,u),u)**.
% 1.08/1.28  91[0:Inp] ssItem(u) ssList(v) ||  -> ssList(cons(u,v))*.
% 1.08/1.28  95[0:Inp] ssList(u) || rearsegP(nil,u)* -> equal(nil,u).
% 1.08/1.28  111[0:Inp] ssItem(u) ssList(v) ||  -> equal(hd(cons(u,v)),u)**.
% 1.08/1.28  122[0:Inp] ssList(u) ssList(v) || equal(v,u) neq(v,u)* -> .
% 1.08/1.28  133[0:Inp] ssList(u) ssList(v) ||  -> equal(nil,v) equal(hd(app(v,u)),hd(v))**.
% 1.08/1.28  154[0:Inp] ssList(u) ssList(v) ||  -> equal(nil,v) equal(app(tl(v),u),tl(app(v,u)))**.
% 1.08/1.28  187[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).
% 1.08/1.28  243[0:Res:2.0,133.0] ssList(u) ||  -> equal(skc4,nil) equal(hd(app(skc4,u)),hd(skc4))**.
% 1.08/1.28  254[0:Res:2.0,111.0] ssItem(u) ||  -> equal(hd(cons(u,skc4)),u)**.
% 1.08/1.28  266[0:Res:2.0,91.0] ssItem(u) ||  -> ssList(cons(u,skc4))*.
% 1.08/1.28  270[0:Res:2.0,95.0] || rearsegP(nil,skc4)* -> equal(skc4,nil).
% 1.08/1.28  284[0:Res:2.0,187.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(skc4,nil).
% 1.08/1.28  320[0:Res:2.0,122.1] ssList(u) || equal(u,skc4) neq(u,skc4)* -> .
% 1.08/1.28  408[0:Res:1.0,154.0] ssList(u) ||  -> equal(skc5,nil) equal(app(tl(skc5),u),tl(app(skc5,u)))**.
% 1.08/1.28  455[0:Res:1.0,187.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(skc5,nil).
% 1.08/1.28  545[1:Spt:243.0,243.2] ssList(u) ||  -> equal(hd(app(skc4,u)),hd(skc4))**.
% 1.08/1.28  551[2:Spt:284.5] ||  -> equal(skc4,nil)**.
% 1.08/1.28  552[2:Rew:551.0,545.1] ssList(u) ||  -> equal(hd(app(nil,u)),hd(nil))**.
% 1.08/1.28  570[2:Rew:551.0,266.1] ssItem(u) ||  -> ssList(cons(u,nil))*.
% 1.08/1.28  571[2:Rew:551.0,254.1] ssItem(u) ||  -> equal(hd(cons(u,nil)),u)**.
% 1.08/1.28  727[2:Rew:82.1,552.1] ssList(u) ||  -> equal(hd(u),hd(nil))*.
% 1.08/1.28  1147[2:SpR:571.1,727.1] ssItem(u) ssList(cons(u,nil)) ||  -> equal(u,hd(nil))*.
% 1.08/1.28  1150[2:SSi:1147.1,79.1,78.1,75.1,74.1,73.1,77.1,76.1,570.1] ssItem(u) ||  -> equal(u,hd(nil))*.
% 1.08/1.28  1238[2:SpR:1150.1,1150.1] ssItem(u) ssItem(v) ||  -> equal(v,u)*.
% 1.08/1.28  1333[2:EmS:1238.0,3.0] ssItem(u) ||  -> equal(u,skc7)*.
% 1.08/1.28  1355[2:EmS:1333.0,4.0] ||  -> equal(skc7,skc6)**.
% 1.08/1.28  1356[2:MRR:1355.0,51.0] ||  -> .
% 1.08/1.28  1552[2:Spt:1356.0,284.5,551.0] || equal(skc4,nil)** -> .
% 1.08/1.28  1553[2:Spt:1356.0,284.0,284.1,284.2,284.3,284.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 1.08/1.28  1557[2:MRR:270.1,1552.0] || rearsegP(nil,skc4)* -> .
% 1.08/1.28  1572[3:Spt:455.5] ||  -> equal(skc5,nil)**.
% 1.08/1.28  1704[3:Rew:1572.0,70.0] || SkP1(skc4,nil) -> rearsegP(skc5,skc4)*.
% 1.08/1.28  1735[3:Rew:1572.0,1704.1] || SkP1(skc4,nil) -> rearsegP(nil,skc4)*.
% 1.08/1.28  1736[3:MRR:1735.1,1557.0] || SkP1(skc4,nil)* -> .
% 1.08/1.28  1850[3:Res:60.0,1736.0] ||  -> equal(skc4,nil)**.
% 1.08/1.28  1851[3:MRR:1850.0,1552.0] ||  -> .
% 1.08/1.28  1852[3:Spt:1851.0,455.5,1572.0] || equal(skc5,nil)** -> .
% 1.08/1.28  1853[3:Spt:1851.0,455.0,455.1,455.2,455.3,455.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 1.08/1.28  1905[0:Res:71.1,81.0] || equal(skc5,nil) SkP0(skc4,skc5)* -> .
% 1.08/1.28  1906[0:Res:58.0,81.0] || SkP0(skc4,skc5)* -> equal(skc4,nil).
% 1.08/1.28  1907[2:MRR:1906.1,1552.0] || SkP0(skc4,skc5)* -> .
% 1.08/1.28  1909[2:Res:58.0,1907.0] ||  -> equal(skc5,nil)**.
% 1.08/1.28  1910[3:MRR:1909.0,1852.0] ||  -> .
% 1.08/1.28  1911[1:Spt:1910.0,243.1] ||  -> equal(skc4,nil)**.
% 1.08/1.28  1919[1:Rew:1911.0,69.0] || SkP1(nil,skc5) -> neq(skc4,nil)*.
% 1.08/1.28  1955[1:Rew:1911.0,320.2] ssList(u) || equal(u,skc4) neq(u,nil)* -> .
% 1.08/1.28  2041[1:Rew:1911.0,1919.1] || SkP1(nil,skc5) -> neq(nil,nil)*.
% 1.08/1.28  2051[1:Rew:1911.0,1905.1] || equal(skc5,nil) SkP0(nil,skc5)* -> .
% 1.08/1.28  2061[1:Rew:1911.0,1955.1] ssList(u) || equal(u,nil) neq(u,nil)* -> .
% 1.08/1.28  2160[2:Spt:408.1] ||  -> equal(skc5,nil)**.
% 1.08/1.28  2294[2:Rew:2160.0,2051.0] || equal(nil,nil) SkP0(nil,skc5)* -> .
% 1.08/1.28  2322[2:Obv:2294.0] || SkP0(nil,skc5)* -> .
% 1.08/1.28  2323[2:Rew:2160.0,2322.0] || SkP0(nil,nil)* -> .
% 1.08/1.28  2408[2:Res:71.1,2323.0] || equal(nil,nil)* -> .
% 1.08/1.28  2410[2:Obv:2408.0] ||  -> .
% 1.08/1.28  2411[2:Spt:2410.0,408.1,2160.0] || equal(skc5,nil)** -> .
% 1.08/1.28  2412[2:Spt:2410.0,408.0,408.2] ssList(u) ||  -> equal(app(tl(skc5),u),tl(app(skc5,u)))**.
% 1.08/1.28  2544[1:Res:2041.1,2061.2] ssList(nil) || SkP1(nil,skc5)* equal(nil,nil) -> .
% 1.08/1.28  2548[1:Obv:2544.2] ssList(nil) || SkP1(nil,skc5)* -> .
% 1.08/1.28  2549[1:SSi:2548.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] || SkP1(nil,skc5)* -> .
% 1.08/1.28  2550[1:Res:59.0,2549.0] ||  -> equal(skc5,nil)**.
% 1.08/1.28  2552[2:MRR:2550.0,2411.0] ||  -> .
% 1.08/1.28  % SZS output end Refutation
% 1.08/1.28  Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax59 ax61 ax63 ax65 ax68 ax71 ax73 ax28 ax16 ax52 ax23 ax15 ax85 ax86 ax77
% 1.08/1.28  
%------------------------------------------------------------------------------