TSTP Solution File: SWC258+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC258+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:53 EDT 2022
% Result : Theorem 0.91s 1.10s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC258+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 11:00:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.91/1.10
% 0.91/1.10 SPASS V 3.9
% 0.91/1.10 SPASS beiseite: Proof found.
% 0.91/1.10 % SZS status Theorem
% 0.91/1.10 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/1.10 SPASS derived 996 clauses, backtracked 641 clauses, performed 23 splits and kept 1488 clauses.
% 0.91/1.10 SPASS allocated 98940 KBytes.
% 0.91/1.10 SPASS spent 0:00:00.75 on the problem.
% 0.91/1.10 0:00:00.04 for the input.
% 0.91/1.10 0:00:00.07 for the FLOTTER CNF translation.
% 0.91/1.10 0:00:00.00 for inferences.
% 0.91/1.10 0:00:00.01 for the backtracking.
% 0.91/1.10 0:00:00.42 for the reduction.
% 0.91/1.10
% 0.91/1.10
% 0.91/1.10 Here is a proof with depth 2, length 50 :
% 0.91/1.10 % SZS output start Refutation
% 0.91/1.10 1[0:Inp] || -> ssList(skc5)*.
% 0.91/1.10 2[0:Inp] || -> ssList(skc4)*.
% 0.91/1.10 6[0:Inp] || -> cyclefreeP(nil)*.
% 0.91/1.10 7[0:Inp] || -> totalorderP(nil)*.
% 0.91/1.10 8[0:Inp] || -> strictorderP(nil)*.
% 0.91/1.10 9[0:Inp] || -> totalorderedP(nil)*.
% 0.91/1.10 10[0:Inp] || -> strictorderedP(nil)*.
% 0.91/1.10 11[0:Inp] || -> duplicatefreeP(nil)*.
% 0.91/1.10 12[0:Inp] || -> equalelemsP(nil)*.
% 0.91/1.10 13[0:Inp] || totalorderedP(skc4)* -> .
% 0.91/1.10 52[0:Inp] || -> ssItem(skf44(u,v))*.
% 0.91/1.10 68[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 0.91/1.10 69[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 0.91/1.10 70[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 0.91/1.10 74[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 0.91/1.10 79[0:Inp] || -> SkP0(u,v) memberP(u,skf44(u,v))*.
% 0.91/1.10 86[0:Inp] || -> SkP0(u,v) equal(cons(skf44(u,v),nil),v)**.
% 0.91/1.10 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.91/1.10 196[0:Rew:69.1,68.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 0.91/1.10 285[0:Res:2.0,187.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 0.91/1.10 456[0:Res:1.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.91/1.10 559[1:Spt:456.5] || -> equal(nil,skc5)**.
% 0.91/1.10 631[1:Rew:559.0,12.0] || -> equalelemsP(skc5)*.
% 0.91/1.10 632[1:Rew:559.0,11.0] || -> duplicatefreeP(skc5)*.
% 0.91/1.10 633[1:Rew:559.0,10.0] || -> strictorderedP(skc5)*.
% 0.91/1.10 634[1:Rew:559.0,9.0] || -> totalorderedP(skc5)*.
% 0.91/1.10 635[1:Rew:559.0,8.0] || -> strictorderP(skc5)*.
% 0.91/1.10 636[1:Rew:559.0,7.0] || -> totalorderP(skc5)*.
% 0.91/1.10 637[1:Rew:559.0,6.0] || -> cyclefreeP(skc5)*.
% 0.91/1.10 653[1:Rew:559.0,70.1] ssItem(u) || memberP(skc5,u)* -> .
% 0.91/1.10 759[2:Spt:196.1] || -> equal(skc5,skc4)**.
% 0.91/1.10 863[2:Rew:759.0,634.0] || -> totalorderedP(skc4)*.
% 0.91/1.10 913[2:MRR:863.0,13.0] || -> .
% 0.91/1.10 1009[2:Spt:913.0,196.1,759.0] || equal(skc5,skc4)** -> .
% 0.91/1.10 1010[2:Spt:913.0,196.0] || SkP0(skc5,skc4)* -> .
% 0.91/1.10 1056[1:Res:79.1,653.1] ssItem(skf44(skc5,u)) || -> SkP0(skc5,u)*.
% 0.91/1.10 1057[1:SSi:1056.0,52.0,637.0,636.0,635.0,634.0,633.0,632.0,631.0,1.0] || -> SkP0(skc5,u)*.
% 0.91/1.10 1058[2:UnC:1057.0,1010.0] || -> .
% 0.91/1.10 1059[1:Spt:1058.0,456.5,559.0] || equal(nil,skc5)** -> .
% 0.91/1.10 1060[1:Spt:1058.0,456.0,456.1,456.2,456.3,456.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.91/1.10 1075[2:Spt:285.5] || -> equal(nil,skc4)**.
% 0.91/1.10 1081[2:Rew:1075.0,9.0] || -> totalorderedP(skc4)*.
% 0.91/1.10 1166[2:MRR:1081.0,13.0] || -> .
% 0.91/1.10 1246[2:Spt:1166.0,285.5,1075.0] || equal(nil,skc4)** -> .
% 0.91/1.10 1247[2:Spt:1166.0,285.0,285.1,285.2,285.3,285.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 0.91/1.10 1253[2:MRR:69.1,1246.0] || SkP0(skc5,skc4)* -> .
% 0.91/1.10 1373[0:SpR:86.1,74.1] ssItem(skf44(u,v)) || -> SkP0(u,v)* totalorderedP(v).
% 0.91/1.10 1382[0:SSi:1373.0,52.0] || -> SkP0(u,v)* totalorderedP(v).
% 0.91/1.10 1391[2:Res:1382.0,1253.0] || -> totalorderedP(skc4)*.
% 0.91/1.10 1392[2:MRR:1391.0,13.0] || -> .
% 0.91/1.10 % SZS output end Refutation
% 0.91/1.10 Formulae used in the proof : co1 ax2 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax38 ax65 ax77
% 0.91/1.10
%------------------------------------------------------------------------------