TSTP Solution File: SWC069+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC069+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:30 EDT 2022
% Result : Theorem 0.78s 1.00s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC069+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n013.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 19:17:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.78/1.00
% 0.78/1.00 SPASS V 3.9
% 0.78/1.00 SPASS beiseite: Proof found.
% 0.78/1.00 % SZS status Theorem
% 0.78/1.00 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.78/1.00 SPASS derived 1412 clauses, backtracked 267 clauses, performed 24 splits and kept 1194 clauses.
% 0.78/1.00 SPASS allocated 99448 KBytes.
% 0.78/1.00 SPASS spent 0:00:00.64 on the problem.
% 0.78/1.00 0:00:00.04 for the input.
% 0.78/1.00 0:00:00.06 for the FLOTTER CNF translation.
% 0.78/1.00 0:00:00.01 for inferences.
% 0.78/1.00 0:00:00.01 for the backtracking.
% 0.78/1.00 0:00:00.31 for the reduction.
% 0.78/1.00
% 0.78/1.00
% 0.78/1.00 Here is a proof with depth 2, length 71 :
% 0.78/1.00 % SZS output start Refutation
% 0.78/1.00 1[0:Inp] || -> ssList(skc7)*.
% 0.78/1.00 2[0:Inp] || -> ssList(skc6)*.
% 0.78/1.00 3[0:Inp] || -> ssList(skc5)*.
% 0.78/1.00 6[0:Inp] || -> ssList(nil)*.
% 0.78/1.00 7[0:Inp] || -> cyclefreeP(nil)*.
% 0.78/1.00 8[0:Inp] || -> totalorderP(nil)*.
% 0.78/1.00 9[0:Inp] || -> strictorderP(nil)*.
% 0.78/1.00 10[0:Inp] || -> totalorderedP(nil)*.
% 0.78/1.00 11[0:Inp] || -> strictorderedP(nil)*.
% 0.78/1.00 12[0:Inp] || -> duplicatefreeP(nil)*.
% 0.78/1.00 13[0:Inp] || -> equalelemsP(nil)*.
% 0.78/1.00 64[0:Inp] ssList(u) || -> segmentP(u,u)*.
% 0.78/1.00 65[0:Inp] ssList(u) || -> segmentP(u,nil)*.
% 0.78/1.00 67[0:Inp] || equal(skc6,nil)** -> equal(nil,skc5).
% 0.78/1.00 68[0:Inp] || neq(skc6,nil) -> neq(skc7,nil)*.
% 0.78/1.00 69[0:Inp] || neq(skc6,nil) -> segmentP(skc6,skc7)*.
% 0.78/1.00 70[0:Inp] || neq(skc6,nil) -> segmentP(skc5,skc7)*.
% 0.78/1.00 80[0:Inp] || equal(skc6,nil)** equal(nil,skc5) -> .
% 0.78/1.00 96[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 0.78/1.00 107[0:Inp] ssList(u) ssList(v) || -> neq(v,u)* equal(v,u).
% 0.78/1.00 127[0:Inp] ssList(u) || neq(u,nil) segmentP(skc5,u) segmentP(skc6,u)* -> .
% 0.78/1.00 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).
% 0.78/1.00 196[0:Rew:67.1,80.1] || equal(skc6,nil)** equal(skc5,skc5) -> .
% 0.78/1.00 197[0:Obv:196.1] || equal(skc6,nil)** -> .
% 0.78/1.00 246[0:Res:3.0,127.0] || neq(skc5,nil) segmentP(skc6,skc5)* segmentP(skc5,skc5) -> .
% 0.78/1.00 285[0:Res:3.0,64.0] || -> segmentP(skc5,skc5)*.
% 0.78/1.00 287[0:Res:3.0,187.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 0.78/1.00 426[0:Res:2.0,107.0] ssList(u) || -> neq(skc6,u)* equal(skc6,u).
% 0.78/1.00 458[0:Res:2.0,65.0] || -> segmentP(skc6,nil)*.
% 0.78/1.00 554[0:MRR:246.2,285.0] || segmentP(skc6,skc5)* neq(skc5,nil) -> .
% 0.78/1.00 571[1:Spt:287.5] || -> equal(nil,skc5)**.
% 0.78/1.00 585[1:Rew:571.0,68.0] || neq(skc6,skc5) -> neq(skc7,nil)*.
% 0.78/1.00 587[1:Rew:571.0,70.0] || neq(skc6,skc5) -> segmentP(skc5,skc7)*.
% 0.78/1.00 610[1:Rew:571.0,96.2] ssList(u) || segmentP(nil,u)* -> equal(skc5,u).
% 0.78/1.00 625[1:Rew:571.0,13.0] || -> equalelemsP(skc5)*.
% 0.78/1.00 626[1:Rew:571.0,12.0] || -> duplicatefreeP(skc5)*.
% 0.78/1.00 627[1:Rew:571.0,11.0] || -> strictorderedP(skc5)*.
% 0.78/1.00 628[1:Rew:571.0,10.0] || -> totalorderedP(skc5)*.
% 0.78/1.00 629[1:Rew:571.0,9.0] || -> strictorderP(skc5)*.
% 0.78/1.00 630[1:Rew:571.0,8.0] || -> totalorderP(skc5)*.
% 0.78/1.00 631[1:Rew:571.0,7.0] || -> cyclefreeP(skc5)*.
% 0.78/1.00 633[1:Rew:571.0,458.0] || -> segmentP(skc6,skc5)*.
% 0.78/1.00 643[1:Rew:571.0,197.0] || equal(skc6,skc5)** -> .
% 0.78/1.00 652[1:Rew:571.0,554.1] || segmentP(skc6,skc5)* neq(skc5,skc5) -> .
% 0.78/1.00 686[1:Rew:571.0,585.1] || neq(skc6,skc5) -> neq(skc7,skc5)*.
% 0.78/1.00 697[1:MRR:652.0,633.0] || neq(skc5,skc5)* -> .
% 0.78/1.00 726[1:Rew:571.0,610.1] ssList(u) || segmentP(skc5,u)* -> equal(skc5,u).
% 0.78/1.00 765[2:Spt:686.0] || neq(skc6,skc5)* -> .
% 0.78/1.00 966[2:Res:426.1,765.0] ssList(skc5) || -> equal(skc6,skc5)**.
% 0.78/1.00 967[2:SSi:966.0,3.0,625.0,626.0,627.0,628.0,629.0,630.0,631.0] || -> equal(skc6,skc5)**.
% 0.78/1.00 968[2:MRR:967.0,643.0] || -> .
% 0.78/1.00 969[2:Spt:968.0,686.0,765.0] || -> neq(skc6,skc5)*.
% 0.78/1.00 970[2:Spt:968.0,686.1] || -> neq(skc7,skc5)*.
% 0.78/1.00 973[2:MRR:587.0,969.0] || -> segmentP(skc5,skc7)*.
% 0.78/1.00 981[2:Res:973.0,726.1] ssList(skc7) || -> equal(skc7,skc5)**.
% 0.78/1.00 982[2:SSi:981.0,1.0] || -> equal(skc7,skc5)**.
% 0.78/1.00 984[2:Rew:982.0,970.0] || -> neq(skc5,skc5)*.
% 0.78/1.00 987[2:MRR:984.0,697.0] || -> .
% 0.78/1.00 988[1:Spt:987.0,287.5,571.0] || equal(nil,skc5)** -> .
% 0.78/1.00 989[1:Spt:987.0,287.0,287.1,287.2,287.3,287.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.78/1.00 1029[2:Spt:70.0] || neq(skc6,nil)* -> .
% 0.78/1.00 1030[2:Res:426.1,1029.0] ssList(nil) || -> equal(skc6,nil)**.
% 0.78/1.00 1031[2:SSi:1030.0,6.0,7.0,8.0,9.0] || -> equal(skc6,nil)**.
% 0.78/1.00 1032[2:MRR:1031.0,197.0] || -> .
% 0.78/1.00 1033[2:Spt:1032.0,70.0,1029.0] || -> neq(skc6,nil)*.
% 0.78/1.00 1034[2:Spt:1032.0,70.1] || -> segmentP(skc5,skc7)*.
% 0.78/1.00 1035[2:MRR:69.0,1033.0] || -> segmentP(skc6,skc7)*.
% 0.78/1.00 1036[2:MRR:68.0,1033.0] || -> neq(skc7,nil)*.
% 0.78/1.00 1956[2:Res:1035.0,127.3] ssList(skc7) || neq(skc7,nil) segmentP(skc5,skc7)* -> .
% 0.78/1.00 1960[2:SSi:1956.0,1.0] || neq(skc7,nil) segmentP(skc5,skc7)* -> .
% 0.78/1.00 1961[2:MRR:1960.0,1960.1,1036.0,1034.0] || -> .
% 0.78/1.00 % SZS output end Refutation
% 0.78/1.00 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax55 ax57 ax58 ax15 ax77
% 0.78/1.00
%------------------------------------------------------------------------------