TSTP Solution File: SWC384+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC384+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:43 EDT 2022
% Result : Theorem 16.85s 17.04s
% Output : Refutation 16.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC384+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n019.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 16:55:40 EDT 2022
% 0.13/0.33 % CPUTime :
% 16.85/17.04
% 16.85/17.04 SPASS V 3.9
% 16.85/17.04 SPASS beiseite: Proof found.
% 16.85/17.04 % SZS status Theorem
% 16.85/17.04 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.85/17.04 SPASS derived 15336 clauses, backtracked 2057 clauses, performed 47 splits and kept 6991 clauses.
% 16.85/17.04 SPASS allocated 118889 KBytes.
% 16.85/17.04 SPASS spent 0:0:14.71 on the problem.
% 16.85/17.04 0:00:00.04 for the input.
% 16.85/17.04 0:00:00.06 for the FLOTTER CNF translation.
% 16.85/17.04 0:00:00.23 for inferences.
% 16.85/17.04 0:00:00.69 for the backtracking.
% 16.85/17.04 0:0:13.37 for the reduction.
% 16.85/17.04
% 16.85/17.04
% 16.85/17.04 Here is a proof with depth 6, length 116 :
% 16.85/17.04 % SZS output start Refutation
% 16.85/17.04 1[0:Inp] || -> ssList(skc5)*.
% 16.85/17.04 2[0:Inp] || -> ssList(skc4)*.
% 16.85/17.04 3[0:Inp] || -> ssItem(skc7)*.
% 16.85/17.04 4[0:Inp] || -> ssItem(skc6)*.
% 16.85/17.04 5[0:Inp] || -> ssList(nil)*.
% 16.85/17.04 6[0:Inp] || -> cyclefreeP(nil)*.
% 16.85/17.04 7[0:Inp] || -> totalorderP(nil)*.
% 16.85/17.04 8[0:Inp] || -> strictorderP(nil)*.
% 16.85/17.04 9[0:Inp] || -> totalorderedP(nil)*.
% 16.85/17.04 10[0:Inp] || -> strictorderedP(nil)*.
% 16.85/17.04 11[0:Inp] || -> duplicatefreeP(nil)*.
% 16.85/17.04 12[0:Inp] || -> equalelemsP(nil)*.
% 16.85/17.04 13[0:Inp] || -> neq(skc5,nil)*.
% 16.85/17.04 52[0:Inp] || -> ssList(skf48(u,v))*.
% 16.85/17.04 53[0:Inp] || -> ssList(skf47(u,v))*.
% 16.85/17.04 54[0:Inp] || -> ssItem(skf46(u,v))*.
% 16.85/17.04 55[0:Inp] || equal(skc7,skc6)** -> .
% 16.85/17.04 70[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 16.85/17.04 71[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 16.85/17.04 72[0:Inp] || singletonP(skc4) segmentP(skc5,skc4)* -> .
% 16.85/17.04 74[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 16.85/17.04 75[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 16.85/17.04 76[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 16.85/17.04 77[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 16.85/17.04 78[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 16.85/17.04 79[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 16.85/17.04 80[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 16.85/17.04 82[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 16.85/17.04 88[0:Inp] || -> SkP0(u,v) equal(cons(skf46(u,v),nil),v)**.
% 16.85/17.04 92[0:Inp] ssItem(u) ssList(v) || -> ssList(cons(u,v))*.
% 16.85/17.04 93[0:Inp] ssList(u) ssList(v) || -> ssList(app(v,u))*.
% 16.85/17.04 110[0:Inp] ssItem(u) ssList(v) || equal(cons(u,v),v)** -> .
% 16.85/17.04 112[0:Inp] ssItem(u) ssList(v) || -> equal(hd(cons(u,v)),u)**.
% 16.85/17.04 121[0:Inp] || -> SkP0(u,v) equal(app(app(skf47(u,v),v),skf48(v,u)),u)**.
% 16.85/17.04 123[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 16.85/17.04 124[0:Inp] ssList(u) ssList(v) || equal(v,u) neq(v,u)* -> .
% 16.85/17.04 130[0:Inp] ssItem(u) ssList(v) || -> equal(app(cons(u,nil),v),cons(u,v))**.
% 16.85/17.04 135[0:Inp] ssList(u) ssList(v) || -> equal(nil,v) equal(hd(app(v,u)),hd(v))**.
% 16.85/17.04 163[0:Inp] ssList(u) ssList(v) ssList(w) || -> equal(app(app(w,v),u),app(w,app(v,u)))**.
% 16.85/17.04 189[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(app(u,x),v),w)* -> segmentP(w,x)*.
% 16.85/17.04 191[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).
% 16.85/17.04 200[0:Rew:71.1,70.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 16.85/17.04 205[0:Rew:163.3,189.4] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(x,app(u,w)),v)*+ -> segmentP(v,u)*.
% 16.85/17.04 248[0:Res:2.0,135.0] ssList(u) || -> equal(nil,skc4) equal(hd(app(skc4,u)),hd(skc4))**.
% 16.85/17.04 259[0:Res:2.0,112.0] ssItem(u) || -> equal(hd(cons(u,skc4)),u)**.
% 16.85/17.04 271[0:Res:2.0,92.0] ssItem(u) || -> ssList(cons(u,skc4))*.
% 16.85/17.04 289[0:Res:2.0,191.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 16.85/17.04 324[0:Res:2.0,123.1] ssItem(u) || equal(cons(u,nil),skc4)** -> singletonP(skc4).
% 16.85/17.04 420[0:Res:1.0,130.0] ssItem(u) || -> equal(app(cons(u,nil),skc5),cons(u,skc5))**.
% 16.85/17.04 428[0:Res:1.0,110.0] ssItem(u) || equal(cons(u,skc5),skc5)** -> .
% 16.85/17.04 452[0:Res:1.0,82.0] || -> equal(app(nil,skc5),skc5)**.
% 16.85/17.04 554[1:Spt:248.0,248.2] ssList(u) || -> equal(hd(app(skc4,u)),hd(skc4))**.
% 16.85/17.04 1846[2:Spt:289.5] || -> equal(nil,skc4)**.
% 16.85/17.04 1883[2:Rew:1846.0,74.1] ssItem(u) || -> cyclefreeP(cons(u,skc4))*.
% 16.85/17.04 1884[2:Rew:1846.0,75.1] ssItem(u) || -> totalorderP(cons(u,skc4))*.
% 16.85/17.04 1885[2:Rew:1846.0,76.1] ssItem(u) || -> strictorderP(cons(u,skc4))*.
% 16.85/17.04 1886[2:Rew:1846.0,77.1] ssItem(u) || -> totalorderedP(cons(u,skc4))*.
% 16.85/17.04 1887[2:Rew:1846.0,78.1] ssItem(u) || -> strictorderedP(cons(u,skc4))*.
% 16.85/17.04 1888[2:Rew:1846.0,79.1] ssItem(u) || -> duplicatefreeP(cons(u,skc4))*.
% 16.85/17.04 1889[2:Rew:1846.0,80.1] ssItem(u) || -> equalelemsP(cons(u,skc4))*.
% 16.85/17.04 1895[2:Rew:1846.0,82.1] ssList(u) || -> equal(app(skc4,u),u)**.
% 16.85/17.04 1980[2:Rew:1895.1,554.1] ssList(u) || -> equal(hd(u),hd(skc4))*.
% 16.85/17.04 2046[2:SpR:1980.1,259.1] ssList(cons(u,skc4)) ssItem(u) || -> equal(hd(skc4),u)*.
% 16.85/17.04 2056[2:SSi:2046.0,271.1,1883.1,1884.1,1885.1,1886.1,1887.1,1888.1,1889.1] ssItem(u) || -> equal(hd(skc4),u)*.
% 16.85/17.04 2076[2:SpR:2056.1,2056.1] ssItem(u) ssItem(v) || -> equal(u,v)*.
% 16.85/17.04 2254[2:EmS:2076.0,3.0] ssItem(u) || -> equal(skc7,u)*.
% 16.85/17.04 2277[2:EmS:2254.0,4.0] || -> equal(skc7,skc6)**.
% 16.85/17.04 2278[2:MRR:2277.0,55.0] || -> .
% 16.85/17.04 2465[2:Spt:2278.0,289.5,1846.0] || equal(nil,skc4)** -> .
% 16.85/17.04 2466[2:Spt:2278.0,289.0,289.1,289.2,289.3,289.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 16.85/17.04 2472[2:MRR:71.1,2465.0] || SkP0(skc5,skc4)* -> .
% 16.85/17.04 2527[3:Spt:72.0] || singletonP(skc4)* -> .
% 16.85/17.04 2528[3:MRR:324.2,2527.0] ssItem(u) || equal(cons(u,nil),skc4)** -> .
% 16.85/17.04 2589[0:SpR:88.1,92.2] ssItem(skf46(u,v)) ssList(nil) || -> SkP0(u,v)* ssList(v).
% 16.85/17.04 2598[3:SpL:88.1,2528.1] ssItem(skf46(u,v)) || equal(v,skc4) -> SkP0(u,v)*.
% 16.85/17.04 2606[3:SSi:2598.0,54.0] || equal(u,skc4) -> SkP0(v,u)*.
% 16.85/17.04 2607[0:SSi:2589.1,2589.0,12.0,11.0,10.0,9.0,8.0,7.0,6.0,5.0,54.0] || -> SkP0(u,v)* ssList(v).
% 16.85/17.04 2617[3:Res:2606.1,2472.0] || equal(skc4,skc4)* -> .
% 16.85/17.04 2618[3:Obv:2617.0] || -> .
% 16.85/17.04 2619[3:Spt:2618.0,72.0,2527.0] || -> singletonP(skc4)*.
% 16.85/17.04 2620[3:Spt:2618.0,72.1] || segmentP(skc5,skc4)* -> .
% 16.85/17.04 2751[0:SpR:88.1,112.2] ssItem(skf46(u,v)) ssList(nil) || -> SkP0(u,v) equal(skf46(u,v),hd(v))**.
% 16.85/17.04 2755[0:SSi:2751.1,2751.0,12.0,11.0,10.0,9.0,8.0,7.0,6.0,5.0,54.0] || -> SkP0(u,v) equal(skf46(u,v),hd(v))**.
% 16.85/17.04 2756[0:Rew:2755.1,88.1] || -> SkP0(u,v)* equal(cons(hd(v),nil),v)**.
% 16.85/17.04 2840[0:SpR:2755.1,54.0] || -> SkP0(u,v)* ssItem(hd(v)).
% 16.85/17.04 2898[0:SpR:2756.1,420.1] ssItem(hd(u)) || -> SkP0(v,u)* equal(cons(hd(u),skc5),app(u,skc5))**.
% 16.85/17.04 2902[0:MRR:2898.0,2840.1] || -> SkP0(u,v)* equal(cons(hd(v),skc5),app(v,skc5))**.
% 16.85/17.04 3135[0:SpL:2902.1,428.1] ssItem(hd(u)) || equal(app(u,skc5),skc5)** -> SkP0(v,u)*.
% 16.85/17.04 3141[0:MRR:3135.0,2840.1] || equal(app(u,skc5),skc5)**+ -> SkP0(v,u)*.
% 16.85/17.04 3172[0:SpL:452.0,3141.0] || equal(skc5,skc5) -> SkP0(u,nil)*.
% 16.85/17.04 3174[0:Obv:3172.0] || -> SkP0(u,nil)*.
% 16.85/17.04 5594[0:SpR:163.3,121.1] ssList(skf48(u,v)) ssList(u) ssList(skf47(v,u)) || -> SkP0(v,u) equal(app(skf47(v,u),app(u,skf48(u,v))),v)**.
% 16.85/17.04 5652[0:SSi:5594.2,5594.0,53.0,52.0] ssList(u) || -> SkP0(v,u) equal(app(skf47(v,u),app(u,skf48(u,v))),v)**.
% 16.85/17.04 5653[0:MRR:5652.0,2607.1] || -> SkP0(u,v) equal(app(skf47(u,v),app(v,skf48(v,u))),u)**.
% 16.85/17.04 7637[0:EqR:205.4] ssList(u) ssList(app(v,app(u,w))) ssList(w) ssList(v) || -> segmentP(app(v,app(u,w)),u)*.
% 16.85/17.04 7674[0:SSi:7637.1,93.2,93.2] ssList(u) ssList(v) ssList(w) || -> segmentP(app(w,app(u,v)),u)*.
% 16.85/17.04 21370[0:SpR:5653.1,7674.3] ssList(u) ssList(skf48(u,v)) ssList(skf47(v,u)) || -> SkP0(v,u)* segmentP(v,u).
% 16.85/17.04 21398[0:SSi:21370.2,21370.1,53.0,52.0] ssList(u) || -> SkP0(v,u)* segmentP(v,u).
% 16.85/17.04 21399[0:MRR:21398.0,2607.1] || -> SkP0(u,v)* segmentP(u,v).
% 16.85/17.04 21473[2:Res:21399.0,2472.0] || -> segmentP(skc5,skc4)*.
% 16.85/17.04 21474[3:MRR:21473.0,2620.0] || -> .
% 16.85/17.04 21475[1:Spt:21474.0,248.1] || -> equal(nil,skc4)**.
% 16.85/17.04 21510[1:Rew:21475.0,12.0] || -> equalelemsP(skc4)*.
% 16.85/17.04 21511[1:Rew:21475.0,11.0] || -> duplicatefreeP(skc4)*.
% 16.85/17.04 21512[1:Rew:21475.0,10.0] || -> strictorderedP(skc4)*.
% 16.85/17.04 21513[1:Rew:21475.0,9.0] || -> totalorderedP(skc4)*.
% 16.85/17.04 21514[1:Rew:21475.0,8.0] || -> strictorderP(skc4)*.
% 16.85/17.04 21515[1:Rew:21475.0,7.0] || -> totalorderP(skc4)*.
% 16.85/17.04 21516[1:Rew:21475.0,6.0] || -> cyclefreeP(skc4)*.
% 16.85/17.04 21525[1:Rew:21475.0,13.0] || -> neq(skc5,skc4)*.
% 16.85/17.04 22016[1:Rew:21475.0,3174.0] || -> SkP0(u,skc4)*.
% 16.85/17.04 22058[1:MRR:200.0,22016.0] || -> equal(skc5,skc4)**.
% 16.85/17.04 22244[1:Rew:22058.0,21525.0] || -> neq(skc4,skc4)*.
% 16.85/17.04 23580[1:Res:22244.0,124.3] ssList(skc4) ssList(skc4) || equal(skc4,skc4)* -> .
% 16.85/17.04 23587[1:Obv:23580.2] ssList(skc4) || -> .
% 16.85/17.04 23588[1:SSi:23587.0,2.0,21510.0,21511.0,21512.0,21513.0,21514.0,21515.0,21516.0] || -> .
% 16.85/17.04 % SZS output end Refutation
% 16.85/17.04 Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax59 ax61 ax63 ax65 ax68 ax71 ax73 ax28 ax16 ax26 ax18 ax23 ax4 ax15 ax81 ax85 ax82 ax7 ax77
% 16.85/17.04
%------------------------------------------------------------------------------