TSTP Solution File: SWC210+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC210+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:02:30 EDT 2022
% Result : Theorem 0.92s 1.13s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC210+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 11:10:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.92/1.13
% 0.92/1.13 SPASS V 3.9
% 0.92/1.13 SPASS beiseite: Proof found.
% 0.92/1.13 % SZS status Theorem
% 0.92/1.13 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.92/1.13 SPASS derived 1246 clauses, backtracked 923 clauses, performed 30 splits and kept 1631 clauses.
% 0.92/1.13 SPASS allocated 99418 KBytes.
% 0.92/1.13 SPASS spent 0:00:00.77 on the problem.
% 0.92/1.13 0:00:00.04 for the input.
% 0.92/1.13 0:00:00.07 for the FLOTTER CNF translation.
% 0.92/1.13 0:00:00.01 for inferences.
% 0.92/1.13 0:00:00.01 for the backtracking.
% 0.92/1.13 0:00:00.48 for the reduction.
% 0.92/1.13
% 0.92/1.13
% 0.92/1.13 Here is a proof with depth 2, length 52 :
% 0.92/1.13 % SZS output start Refutation
% 0.92/1.13 1[0:Inp] || -> ssList(skc5)*.
% 0.92/1.13 2[0:Inp] || -> ssList(skc4)*.
% 0.92/1.13 5[0:Inp] || -> ssList(nil)*.
% 0.92/1.13 6[0:Inp] || -> cyclefreeP(nil)*.
% 0.92/1.13 7[0:Inp] || -> totalorderP(nil)*.
% 0.92/1.13 8[0:Inp] || -> strictorderP(nil)*.
% 0.92/1.13 9[0:Inp] || -> totalorderedP(nil)*.
% 0.92/1.13 10[0:Inp] || -> strictorderedP(nil)*.
% 0.92/1.13 11[0:Inp] || -> duplicatefreeP(nil)*.
% 0.92/1.13 12[0:Inp] || -> equalelemsP(nil)*.
% 0.92/1.13 50[0:Inp] || singletonP(nil)* -> .
% 0.92/1.13 58[0:Inp] || -> singletonP(u) SkP0(u,v)*.
% 0.92/1.13 59[0:Inp] || -> SkP0(u,v)* neq(v,nil).
% 0.92/1.13 68[0:Inp] || SkP0(skc4,skc5)* -> neq(skc5,nil).
% 0.92/1.13 69[0:Inp] || neq(u,nil) -> SkP0(u,v)*.
% 0.92/1.13 79[0:Inp] || neq(skc5,nil) SkP0(skc4,skc5)* -> .
% 0.92/1.13 106[0:Inp] ssList(u) ssList(v) || -> neq(v,u)* equal(v,u).
% 0.92/1.13 151[0:Inp] ssList(u) ssItem(v) || strictorderedP(cons(v,u))* -> lt(v,hd(u)) equal(nil,u).
% 0.92/1.13 185[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).
% 0.92/1.13 194[0:MRR:68.0,59.1] || -> neq(skc5,nil)*.
% 0.92/1.13 195[0:MRR:79.0,194.0] || SkP0(skc4,skc5)* -> .
% 0.92/1.13 251[0:Res:2.0,106.0] ssList(u) || -> neq(skc4,u)* equal(skc4,u).
% 0.92/1.13 284[0:Res:2.0,185.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(skc4,nil).
% 0.92/1.13 478[0:Res:1.0,151.1] ssItem(u) || strictorderedP(cons(u,skc5))* -> lt(u,hd(skc5)) equal(skc5,nil).
% 0.92/1.13 494[0:Res:1.0,106.1] ssList(u) || -> neq(u,skc5)* equal(u,skc5).
% 0.92/1.13 551[1:Spt:478.3] || -> equal(skc5,nil)**.
% 0.92/1.13 615[1:Rew:551.0,494.2] ssList(u) || -> neq(u,skc5)* equal(u,nil).
% 0.92/1.13 662[1:Rew:551.0,195.0] || SkP0(skc4,nil)* -> .
% 0.92/1.13 722[1:Rew:551.0,615.1] ssList(u) || -> neq(u,nil)* equal(u,nil).
% 0.92/1.13 808[2:Spt:284.5] || -> equal(skc4,nil)**.
% 0.92/1.13 959[2:Rew:808.0,662.0] || SkP0(nil,nil)* -> .
% 0.92/1.13 1053[2:Res:58.1,959.0] || -> singletonP(nil)*.
% 0.92/1.13 1054[2:MRR:1053.0,50.0] || -> .
% 0.92/1.13 1055[2:Spt:1054.0,284.5,808.0] || equal(skc4,nil)** -> .
% 0.92/1.13 1056[2:Spt:1054.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).
% 0.92/1.13 1080[1:Res:58.1,662.0] || -> singletonP(skc4)*.
% 0.92/1.13 1104[1:Res:69.1,662.0] || neq(skc4,nil)* -> .
% 0.92/1.13 1406[1:Res:722.1,1104.0] ssList(skc4) || -> equal(skc4,nil)**.
% 0.92/1.13 1562[1:SSi:1406.0,2.0,1080.0] || -> equal(skc4,nil)**.
% 0.92/1.13 1563[2:MRR:1562.0,1055.0] || -> .
% 0.92/1.13 1586[1:Spt:1563.0,478.3,551.0] || equal(skc5,nil)** -> .
% 0.92/1.13 1587[1:Spt:1563.0,478.0,478.1,478.2] ssItem(u) || strictorderedP(cons(u,skc5))* -> lt(u,hd(skc5)).
% 0.92/1.13 1601[2:Spt:284.5] || -> equal(skc4,nil)**.
% 0.92/1.13 1729[2:Rew:1601.0,195.0] || SkP0(nil,skc5)* -> .
% 0.92/1.13 1866[2:Res:58.1,1729.0] || -> singletonP(nil)*.
% 0.92/1.13 1867[2:MRR:1866.0,50.0] || -> .
% 0.92/1.13 1868[2:Spt:1867.0,284.5,1601.0] || equal(skc4,nil)** -> .
% 0.92/1.13 1869[2:Spt:1867.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).
% 0.92/1.13 1900[0:Res:69.1,195.0] || neq(skc4,nil)* -> .
% 0.92/1.13 1981[0:Res:251.1,1900.0] ssList(nil) || -> equal(skc4,nil)**.
% 0.92/1.13 1982[0:SSi:1981.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] || -> equal(skc4,nil)**.
% 0.92/1.13 1983[2:MRR:1982.0,1868.0] || -> .
% 0.92/1.13 % SZS output end Refutation
% 0.92/1.13 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax39 ax15 ax70 ax77
% 0.92/1.13
%------------------------------------------------------------------------------