TSTP Solution File: SWC276+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC276+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:00 EDT 2022
% Result : Theorem 0.78s 0.98s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC276+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n011.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 01:26:32 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.78/0.98
% 0.78/0.98 SPASS V 3.9
% 0.78/0.98 SPASS beiseite: Proof found.
% 0.78/0.98 % SZS status Theorem
% 0.78/0.98 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.98 SPASS derived 996 clauses, backtracked 641 clauses, performed 23 splits and kept 1487 clauses.
% 0.78/0.98 SPASS allocated 98938 KBytes.
% 0.78/0.98 SPASS spent 0:00:00.62 on the problem.
% 0.78/0.98 0:00:00.04 for the input.
% 0.78/0.98 0:00:00.07 for the FLOTTER CNF translation.
% 0.78/0.98 0:00:00.00 for inferences.
% 0.78/0.98 0:00:00.01 for the backtracking.
% 0.78/0.98 0:00:00.35 for the reduction.
% 0.78/0.98
% 0.78/0.98
% 0.78/0.98 Here is a proof with depth 2, length 50 :
% 0.78/0.98 % SZS output start Refutation
% 0.78/0.98 1[0:Inp] || -> ssList(skc5)*.
% 0.78/0.98 2[0:Inp] || -> ssList(skc4)*.
% 0.78/0.98 6[0:Inp] || -> cyclefreeP(nil)*.
% 0.78/0.98 7[0:Inp] || -> totalorderP(nil)*.
% 0.78/0.98 8[0:Inp] || -> strictorderP(nil)*.
% 0.78/0.98 9[0:Inp] || -> totalorderedP(nil)*.
% 0.78/0.98 10[0:Inp] || -> strictorderedP(nil)*.
% 0.78/0.98 11[0:Inp] || -> duplicatefreeP(nil)*.
% 0.78/0.98 12[0:Inp] || -> equalelemsP(nil)*.
% 0.78/0.98 13[0:Inp] || totalorderedP(skc4)* -> .
% 0.78/0.98 52[0:Inp] || -> ssItem(skf44(u,v))*.
% 0.78/0.98 68[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 0.78/0.98 69[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 0.78/0.98 70[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 0.78/0.98 74[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 0.78/0.98 79[0:Inp] || -> SkP0(u,v) memberP(u,skf44(u,v))*.
% 0.78/0.98 86[0:Inp] || -> SkP0(u,v) equal(cons(skf44(u,v),nil),v)**.
% 0.78/0.98 186[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.78/0.98 195[0:Rew:69.1,68.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 0.78/0.98 284[0:Res:2.0,186.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 0.78/0.98 455[0:Res:1.0,186.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 0.78/0.98 558[1:Spt:455.5] || -> equal(nil,skc5)**.
% 0.78/0.98 630[1:Rew:558.0,12.0] || -> equalelemsP(skc5)*.
% 0.78/0.98 631[1:Rew:558.0,11.0] || -> duplicatefreeP(skc5)*.
% 0.78/0.98 632[1:Rew:558.0,10.0] || -> strictorderedP(skc5)*.
% 0.78/0.98 633[1:Rew:558.0,9.0] || -> totalorderedP(skc5)*.
% 0.78/0.98 634[1:Rew:558.0,8.0] || -> strictorderP(skc5)*.
% 0.78/0.98 635[1:Rew:558.0,7.0] || -> totalorderP(skc5)*.
% 0.78/0.98 636[1:Rew:558.0,6.0] || -> cyclefreeP(skc5)*.
% 0.78/0.98 652[1:Rew:558.0,70.1] ssItem(u) || memberP(skc5,u)* -> .
% 0.78/0.98 758[2:Spt:195.1] || -> equal(skc5,skc4)**.
% 0.78/0.98 862[2:Rew:758.0,633.0] || -> totalorderedP(skc4)*.
% 0.78/0.98 912[2:MRR:862.0,13.0] || -> .
% 0.78/0.98 1008[2:Spt:912.0,195.1,758.0] || equal(skc5,skc4)** -> .
% 0.78/0.98 1009[2:Spt:912.0,195.0] || SkP0(skc5,skc4)* -> .
% 0.78/0.98 1055[1:Res:79.1,652.1] ssItem(skf44(skc5,u)) || -> SkP0(skc5,u)*.
% 0.78/0.98 1056[1:SSi:1055.0,52.0,636.0,635.0,634.0,633.0,632.0,631.0,630.0,1.0] || -> SkP0(skc5,u)*.
% 0.78/0.98 1057[2:UnC:1056.0,1009.0] || -> .
% 0.78/0.98 1058[1:Spt:1057.0,455.5,558.0] || equal(nil,skc5)** -> .
% 0.78/0.98 1059[1:Spt:1057.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).
% 0.78/0.98 1074[2:Spt:284.5] || -> equal(nil,skc4)**.
% 0.78/0.98 1080[2:Rew:1074.0,9.0] || -> totalorderedP(skc4)*.
% 0.78/0.98 1165[2:MRR:1080.0,13.0] || -> .
% 0.78/0.98 1245[2:Spt:1165.0,284.5,1074.0] || equal(nil,skc4)** -> .
% 0.78/0.98 1246[2:Spt:1165.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.78/0.98 1252[2:MRR:69.1,1245.0] || SkP0(skc5,skc4)* -> .
% 0.78/0.98 1372[0:SpR:86.1,74.1] ssItem(skf44(u,v)) || -> SkP0(u,v)* totalorderedP(v).
% 0.78/0.98 1381[0:SSi:1372.0,52.0] || -> SkP0(u,v)* totalorderedP(v).
% 0.78/0.98 1390[2:Res:1381.0,1252.0] || -> totalorderedP(skc4)*.
% 0.78/0.98 1391[2:MRR:1390.0,13.0] || -> .
% 0.78/0.98 % SZS output end Refutation
% 0.78/0.98 Formulae used in the proof : co1 ax2 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax38 ax65 ax77
% 0.78/0.98
%------------------------------------------------------------------------------