TSTP Solution File: SWC309+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC309+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:03:13 EDT 2022
% Result : Theorem 0.84s 1.07s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC309+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 00:05:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.84/1.07
% 0.84/1.07 SPASS V 3.9
% 0.84/1.07 SPASS beiseite: Proof found.
% 0.84/1.07 % SZS status Theorem
% 0.84/1.07 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/1.07 SPASS derived 1572 clauses, backtracked 690 clauses, performed 13 splits and kept 1608 clauses.
% 0.84/1.07 SPASS allocated 99792 KBytes.
% 0.84/1.07 SPASS spent 0:00:00.71 on the problem.
% 0.84/1.07 0:00:00.04 for the input.
% 0.84/1.07 0:00:00.07 for the FLOTTER CNF translation.
% 0.84/1.07 0:00:00.01 for inferences.
% 0.84/1.07 0:00:00.01 for the backtracking.
% 0.84/1.07 0:00:00.42 for the reduction.
% 0.84/1.07
% 0.84/1.07
% 0.84/1.07 Here is a proof with depth 6, length 73 :
% 0.84/1.07 % SZS output start Refutation
% 0.84/1.07 1[0:Inp] || -> ssList(skc5)*.
% 0.84/1.07 2[0:Inp] || -> ssList(skc4)*.
% 0.84/1.07 3[0:Inp] || -> ssItem(skc7)*.
% 0.84/1.07 4[0:Inp] || -> ssItem(skc6)*.
% 0.84/1.07 5[0:Inp] || -> ssList(nil)*.
% 0.84/1.07 6[0:Inp] || -> cyclefreeP(nil)*.
% 0.84/1.07 7[0:Inp] || -> totalorderP(nil)*.
% 0.84/1.07 8[0:Inp] || -> strictorderP(nil)*.
% 0.84/1.07 9[0:Inp] || -> totalorderedP(nil)*.
% 0.84/1.07 10[0:Inp] || -> strictorderedP(nil)*.
% 0.84/1.07 11[0:Inp] || -> duplicatefreeP(nil)*.
% 0.84/1.07 12[0:Inp] || -> equalelemsP(nil)*.
% 0.84/1.07 13[0:Inp] || -> neq(skc5,nil)*.
% 0.84/1.07 52[0:Inp] || equal(skc7,skc6)** -> .
% 0.84/1.07 67[0:Inp] || equal(skc5,nil)** -> equal(skc4,nil).
% 0.84/1.07 69[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 0.84/1.07 70[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 0.84/1.07 71[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 0.84/1.07 72[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 0.84/1.07 73[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 0.84/1.07 74[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 0.84/1.07 75[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 0.84/1.07 77[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 0.84/1.07 81[0:Inp] ssList(u) || -> ssItem(hd(u))* equal(nil,u).
% 0.84/1.07 82[0:Inp] ssList(u) || -> ssList(tl(u))* equal(nil,u).
% 0.84/1.07 86[0:Inp] ssItem(u) ssList(v) || -> ssList(cons(u,v))*.
% 0.84/1.07 106[0:Inp] ssItem(u) ssList(v) || -> equal(hd(cons(u,v)),u)**.
% 0.84/1.07 113[0:Inp] ssList(u) || -> equal(nil,u) equal(cons(hd(u),tl(u)),u)**.
% 0.84/1.07 117[0:Inp] ssList(u) ssList(v) || equal(v,u) neq(v,u)* -> .
% 0.84/1.07 123[0:Inp] ssItem(u) ssList(v) || -> equal(app(cons(u,nil),v),cons(u,v))**.
% 0.84/1.07 128[0:Inp] ssList(u) ssList(v) || -> equal(nil,v) equal(hd(app(v,u)),hd(v))**.
% 0.84/1.07 148[0:Inp] ssList(u) ssItem(v) || strictorderedP(cons(v,u))* -> lt(v,hd(u)) equal(nil,u).
% 0.84/1.07 175[0:Inp] ssItem(u) ssList(v) || equal(app(cons(u,nil),v),skc5)** -> equal(app(v,cons(u,nil)),skc4)**.
% 0.84/1.07 176[0:Inp] ssItem(u) ssList(v) || equal(app(cons(u,nil),v),skc5)** equal(app(v,cons(u,nil)),skc4)** -> .
% 0.84/1.07 196[0:Rew:123.2,175.2] ssItem(u) ssList(v) || equal(cons(u,v),skc5) -> equal(app(v,cons(u,nil)),skc4)**.
% 0.84/1.07 197[0:Rew:196.3,176.3,123.2,176.2] ssItem(u) ssList(v) || equal(cons(u,v),skc5)** equal(skc4,skc4) -> .
% 0.84/1.07 198[0:Obv:197.3] ssList(u) ssItem(v) || equal(cons(v,u),skc5)** -> .
% 0.84/1.07 247[0:Res:2.0,117.0] ssList(u) || equal(skc4,u) neq(skc4,u)* -> .
% 0.84/1.07 415[0:Res:1.0,128.0] ssList(u) || -> equal(skc5,nil) equal(hd(app(skc5,u)),hd(skc5))**.
% 0.84/1.07 421[0:Res:1.0,113.0] || -> equal(skc5,nil) equal(cons(hd(skc5),tl(skc5)),skc5)**.
% 0.84/1.07 426[0:Res:1.0,106.0] ssItem(u) || -> equal(hd(cons(u,skc5)),u)**.
% 0.84/1.07 438[0:Res:1.0,86.0] ssItem(u) || -> ssList(cons(u,skc5))*.
% 0.84/1.07 446[0:Res:1.0,81.0] || -> ssItem(hd(skc5))* equal(skc5,nil).
% 0.84/1.07 447[0:Res:1.0,82.0] || -> ssList(tl(skc5))* equal(skc5,nil).
% 0.84/1.07 480[0:Res:1.0,148.1] ssItem(u) || strictorderedP(cons(u,skc5))* -> lt(u,hd(skc5)) equal(skc5,nil).
% 0.84/1.07 545[1:Spt:415.0,415.2] ssList(u) || -> equal(hd(app(skc5,u)),hd(skc5))**.
% 0.84/1.07 553[2:Spt:480.3] || -> equal(skc5,nil)**.
% 0.84/1.07 554[2:Rew:553.0,545.1] ssList(u) || -> equal(hd(app(nil,u)),hd(nil))**.
% 0.84/1.07 571[2:Rew:553.0,438.1] ssItem(u) || -> ssList(cons(u,nil))*.
% 0.84/1.07 572[2:Rew:553.0,426.1] ssItem(u) || -> equal(hd(cons(u,nil)),u)**.
% 0.84/1.07 898[2:Rew:77.1,554.1] ssList(u) || -> equal(hd(u),hd(nil))*.
% 0.84/1.07 1172[2:SpR:572.1,898.1] ssItem(u) ssList(cons(u,nil)) || -> equal(u,hd(nil))*.
% 0.84/1.07 1175[2:SSi:1172.1,75.1,74.1,71.1,70.1,69.1,73.1,72.1,571.1] ssItem(u) || -> equal(u,hd(nil))*.
% 0.84/1.07 1241[2:SpR:1175.1,1175.1] ssItem(u) ssItem(v) || -> equal(v,u)*.
% 0.84/1.07 1279[2:EmS:1241.0,3.0] ssItem(u) || -> equal(u,skc7)*.
% 0.84/1.07 1300[2:EmS:1279.0,4.0] || -> equal(skc7,skc6)**.
% 0.84/1.07 1301[2:MRR:1300.0,52.0] || -> .
% 0.84/1.07 1429[2:Spt:1301.0,480.3,553.0] || equal(skc5,nil)** -> .
% 0.84/1.07 1430[2:Spt:1301.0,480.0,480.1,480.2] ssItem(u) || strictorderedP(cons(u,skc5))* -> lt(u,hd(skc5)).
% 0.84/1.07 1431[2:MRR:447.1,1429.0] || -> ssList(tl(skc5))*.
% 0.84/1.07 1432[2:MRR:446.1,1429.0] || -> ssItem(hd(skc5))*.
% 0.84/1.07 1436[2:MRR:421.0,1429.0] || -> equal(cons(hd(skc5),tl(skc5)),skc5)**.
% 0.84/1.07 1936[2:SpL:1436.0,198.2] ssList(tl(skc5)) ssItem(hd(skc5)) || equal(skc5,skc5)* -> .
% 0.84/1.07 1940[2:Obv:1936.2] ssList(tl(skc5)) ssItem(hd(skc5)) || -> .
% 0.84/1.07 1941[2:SSi:1940.1,1940.0,1432.0,1431.0] || -> .
% 0.84/1.07 1948[1:Spt:1941.0,415.1] || -> equal(skc5,nil)**.
% 0.84/1.07 1953[1:Rew:1948.0,13.0] || -> neq(nil,nil)*.
% 0.84/1.07 2066[1:Rew:1948.0,67.0] || equal(nil,nil) -> equal(skc4,nil)**.
% 0.84/1.07 2067[1:Obv:2066.0] || -> equal(skc4,nil)**.
% 0.84/1.07 2120[1:Rew:2067.0,247.2,2067.0,247.1] ssList(u) || equal(nil,u) neq(nil,u)* -> .
% 0.84/1.07 2490[1:Res:1953.0,2120.2] ssList(nil) || equal(nil,nil)* -> .
% 0.84/1.07 2493[1:Obv:2490.1] ssList(nil) || -> .
% 0.84/1.07 2494[1:SSi:2493.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] || -> .
% 0.84/1.07 % SZS output end Refutation
% 0.84/1.07 Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax59 ax61 ax63 ax65 ax68 ax71 ax73 ax28 ax75 ax76 ax16 ax23 ax78 ax15 ax81 ax85 ax70
% 0.84/1.07
%------------------------------------------------------------------------------