TSTP Solution File: SWC179+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC179+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:17 EDT 2022
% Result : Theorem 0.86s 1.07s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC179+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n015.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.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 09:20:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.86/1.07
% 0.86/1.07 SPASS V 3.9
% 0.86/1.07 SPASS beiseite: Proof found.
% 0.86/1.07 % SZS status Theorem
% 0.86/1.07 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/1.07 SPASS derived 1306 clauses, backtracked 765 clauses, performed 24 splits and kept 1780 clauses.
% 0.86/1.07 SPASS allocated 99203 KBytes.
% 0.86/1.07 SPASS spent 0:00:00.72 on the problem.
% 0.86/1.07 0:00:00.04 for the input.
% 0.86/1.07 0:00:00.06 for the FLOTTER CNF translation.
% 0.86/1.07 0:00:00.01 for inferences.
% 0.86/1.07 0:00:00.01 for the backtracking.
% 0.86/1.07 0:00:00.44 for the reduction.
% 0.86/1.07
% 0.86/1.07
% 0.86/1.07 Here is a proof with depth 2, length 38 :
% 0.86/1.07 % SZS output start Refutation
% 0.86/1.07 1[0:Inp] || -> ssList(skc5)*.
% 0.86/1.07 2[0:Inp] || -> ssList(skc4)*.
% 0.86/1.07 11[0:Inp] || -> duplicatefreeP(nil)*.
% 0.86/1.07 13[0:Inp] || duplicatefreeP(skc4)* -> .
% 0.86/1.07 54[0:Inp] || -> ssItem(skf46(u,v))*.
% 0.86/1.07 70[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 0.86/1.07 71[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 0.86/1.07 78[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 0.86/1.07 87[0:Inp] || -> SkP0(u,v) equal(cons(skf46(u,v),nil),v)**.
% 0.86/1.07 190[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.86/1.07 199[0:Rew:71.1,70.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 0.86/1.07 288[0:Res:2.0,190.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 0.86/1.07 459[0:Res:1.0,190.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 0.86/1.07 561[1:Spt:459.5] || -> equal(nil,skc5)**.
% 0.86/1.07 563[1:Rew:561.0,78.1] ssItem(u) || -> duplicatefreeP(cons(u,skc5))*.
% 0.86/1.07 635[1:Rew:561.0,11.0] || -> duplicatefreeP(skc5)*.
% 0.86/1.07 663[1:Rew:561.0,87.1] || -> SkP0(u,v) equal(cons(skf46(u,v),skc5),v)**.
% 0.86/1.07 762[2:Spt:199.1] || -> equal(skc5,skc4)**.
% 0.86/1.07 864[2:Rew:762.0,635.0] || -> duplicatefreeP(skc4)*.
% 0.86/1.07 913[2:MRR:864.0,13.0] || -> .
% 0.86/1.07 1013[2:Spt:913.0,199.1,762.0] || equal(skc5,skc4)** -> .
% 0.86/1.07 1014[2:Spt:913.0,199.0] || SkP0(skc5,skc4)* -> .
% 0.86/1.07 1390[1:SpR:663.1,563.1] ssItem(skf46(u,v)) || -> SkP0(u,v)* duplicatefreeP(v).
% 0.86/1.07 1404[1:SSi:1390.0,54.0] || -> SkP0(u,v)* duplicatefreeP(v).
% 0.86/1.07 1439[2:Res:1404.0,1014.0] || -> duplicatefreeP(skc4)*.
% 0.86/1.07 1440[2:MRR:1439.0,13.0] || -> .
% 0.86/1.07 1441[1:Spt:1440.0,459.5,561.0] || equal(nil,skc5)** -> .
% 0.86/1.07 1442[1:Spt:1440.0,459.0,459.1,459.2,459.3,459.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.86/1.07 1466[2:Spt:288.5] || -> equal(nil,skc4)**.
% 0.86/1.07 1474[2:Rew:1466.0,11.0] || -> duplicatefreeP(skc4)*.
% 0.86/1.07 1561[2:MRR:1474.0,13.0] || -> .
% 0.86/1.07 1639[2:Spt:1561.0,288.5,1466.0] || equal(nil,skc4)** -> .
% 0.86/1.07 1640[2:Spt:1561.0,288.0,288.1,288.2,288.3,288.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 0.86/1.07 1646[2:MRR:71.1,1639.0] || SkP0(skc5,skc4)* -> .
% 0.86/1.07 1762[0:SpR:87.1,78.1] ssItem(skf46(u,v)) || -> SkP0(u,v)* duplicatefreeP(v).
% 0.86/1.07 1770[0:SSi:1762.0,54.0] || -> SkP0(u,v)* duplicatefreeP(v).
% 0.86/1.07 1779[2:Res:1770.0,1646.0] || -> duplicatefreeP(skc4)*.
% 0.86/1.07 1780[2:MRR:1779.0,13.0] || -> .
% 0.86/1.07 % SZS output end Refutation
% 0.86/1.07 Formulae used in the proof : co1 ax2 ax17 ax72 ax71 ax77
% 0.86/1.07
%------------------------------------------------------------------------------