TSTP Solution File: SWC020-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC020-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:08 EDT 2022
% Result : Unsatisfiable 1.35s 1.55s
% Output : Refutation 1.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC020-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 23:17:57 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.35/1.55
% 1.35/1.55 SPASS V 3.9
% 1.35/1.55 SPASS beiseite: Proof found.
% 1.35/1.55 % SZS status Theorem
% 1.35/1.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.35/1.55 SPASS derived 2126 clauses, backtracked 2016 clauses, performed 30 splits and kept 3464 clauses.
% 1.35/1.55 SPASS allocated 78002 KBytes.
% 1.35/1.55 SPASS spent 0:00:01.17 on the problem.
% 1.35/1.55 0:00:00.04 for the input.
% 1.35/1.55 0:00:00.00 for the FLOTTER CNF translation.
% 1.35/1.55 0:00:00.00 for inferences.
% 1.35/1.55 0:00:00.02 for the backtracking.
% 1.35/1.55 0:00:00.91 for the reduction.
% 1.35/1.55
% 1.35/1.55
% 1.35/1.55 Here is a proof with depth 2, length 99 :
% 1.35/1.55 % SZS output start Refutation
% 1.35/1.55 1[0:Inp] || -> ssList(sk1)*.
% 1.35/1.55 2[0:Inp] || -> ssList(sk2)*.
% 1.35/1.55 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.35/1.55 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.35/1.55 7[0:Inp] ssList(u) || neq(u,nil) frontsegP(sk1,u) frontsegP(sk2,u)* -> .
% 1.35/1.55 8[0:Inp] || equal(nil,sk1) equal(nil,sk2)** -> .
% 1.35/1.55 9[0:Inp] || -> equal(nil,sk4) neq(sk3,nil)*.
% 1.35/1.55 10[0:Inp] || -> equal(nil,sk4) frontsegP(sk4,sk3)*.
% 1.35/1.55 11[0:Inp] || -> equal(nil,sk3) neq(sk3,nil)*.
% 1.35/1.55 12[0:Inp] || -> equal(nil,sk3) frontsegP(sk4,sk3)*.
% 1.35/1.55 72[0:Inp] ssList(u) || -> frontsegP(u,nil)*.
% 1.35/1.55 73[0:Inp] ssList(u) || -> frontsegP(u,u)*.
% 1.35/1.55 84[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.35/1.55 114[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.35/1.55 189[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u).
% 1.35/1.55 200[0:Rew:5.0,12.1,6.0,12.1,6.0,12.0] || -> equal(nil,sk1) frontsegP(sk2,sk1)*.
% 1.35/1.55 201[0:Rew:6.0,11.1,6.0,11.0] || -> equal(nil,sk1) neq(sk1,nil)*.
% 1.35/1.55 202[0:Rew:5.0,10.1,6.0,10.1,5.0,10.0] || -> equal(nil,sk2) frontsegP(sk2,sk1)*.
% 1.35/1.55 203[0:Rew:202.0,200.0] || -> frontsegP(sk2,sk1)* equal(sk2,sk1).
% 1.35/1.55 204[0:Rew:6.0,9.1,5.0,9.0] || -> equal(nil,sk2) neq(sk1,nil)*.
% 1.35/1.55 205[0:Rew:204.0,201.0] || -> neq(sk1,nil)* equal(sk2,sk1).
% 1.35/1.55 206[0:Rew:203.0,202.0] || -> frontsegP(sk2,sk1)* equal(nil,sk1).
% 1.35/1.55 207[0:Rew:205.0,204.0] || -> neq(sk1,nil)* equal(nil,sk1).
% 1.35/1.55 294[0:Res:2.0,84.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.35/1.55 299[0:Res:2.0,72.0] || -> frontsegP(sk2,nil)*.
% 1.35/1.55 436[0:Res:1.0,7.0] || neq(sk1,nil) frontsegP(sk2,sk1)* frontsegP(sk1,sk1) -> .
% 1.35/1.55 466[0:Res:1.0,84.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.35/1.55 472[0:Res:1.0,73.0] || -> frontsegP(sk1,sk1)*.
% 1.35/1.55 481[0:Res:1.0,189.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.35/1.55 559[0:MRR:436.2,472.0] || frontsegP(sk2,sk1)* neq(sk1,nil) -> .
% 1.35/1.55 562[1:Spt:84.1] || -> ssItem(u)*.
% 1.35/1.55 592[1:MRR:114.1,114.0,562.0] || -> equal(u,v) neq(u,v)*.
% 1.35/1.55 766[2:Spt:481.5] || -> equal(nil,sk1)**.
% 1.35/1.55 767[2:Rew:766.0,559.1] || frontsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.35/1.55 768[2:Rew:766.0,205.0] || -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.35/1.55 773[2:Rew:766.0,8.0] || equal(sk1,sk1) equal(nil,sk2)** -> .
% 1.35/1.55 837[2:Rew:766.0,299.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 910[2:MRR:767.0,837.0] || neq(sk1,sk1)* -> .
% 1.35/1.55 911[2:MRR:768.0,910.0] || -> equal(sk2,sk1)**.
% 1.35/1.55 1055[2:Obv:773.0] || equal(nil,sk2)** -> .
% 1.35/1.55 1056[2:Rew:766.0,1055.0,911.0,1055.0] || equal(sk1,sk1)* -> .
% 1.35/1.55 1057[2:Obv:1056.0] || -> .
% 1.35/1.55 1190[2:Spt:1057.0,481.5,766.0] || equal(nil,sk1)** -> .
% 1.35/1.55 1191[2:Spt:1057.0,481.0,481.1,481.2,481.3,481.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.35/1.55 1193[2:MRR:206.1,1190.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 1197[2:MRR:559.0,1193.0] || neq(sk1,nil)* -> .
% 1.35/1.55 1403[2:Res:592.1,1197.0] || -> equal(nil,sk1)**.
% 1.35/1.55 1404[2:MRR:1403.0,1190.0] || -> .
% 1.35/1.55 1405[1:Spt:1404.0,84.0,84.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.35/1.55 1422[2:Spt:466.0] || -> ssItem(u)*.
% 1.35/1.55 1450[2:MRR:114.1,114.0,1422.0] || -> equal(u,v) neq(u,v)*.
% 1.35/1.55 1619[3:Spt:481.5] || -> equal(nil,sk1)**.
% 1.35/1.55 1671[3:Rew:1619.0,299.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 1678[3:Rew:1619.0,8.0] || equal(sk1,sk1) equal(nil,sk2)** -> .
% 1.35/1.55 1682[3:Rew:1619.0,559.1] || frontsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.35/1.55 1683[3:Rew:1619.0,205.0] || -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.35/1.55 1788[3:Obv:1678.0] || equal(nil,sk2)** -> .
% 1.35/1.55 1789[3:Rew:1619.0,1788.0] || equal(sk2,sk1)** -> .
% 1.35/1.55 1790[3:MRR:1683.1,1789.0] || -> neq(sk1,sk1)*.
% 1.35/1.55 1795[3:MRR:1682.0,1682.1,1671.0,1790.0] || -> .
% 1.35/1.55 1837[3:Spt:1795.0,481.5,1619.0] || equal(nil,sk1)** -> .
% 1.35/1.55 1838[3:Spt:1795.0,481.0,481.1,481.2,481.3,481.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.35/1.55 1840[3:MRR:206.1,1837.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 1844[3:MRR:559.0,1840.0] || neq(sk1,nil)* -> .
% 1.35/1.55 2110[3:Res:1450.1,1844.0] || -> equal(nil,sk1)**.
% 1.35/1.55 2111[3:MRR:2110.0,1837.0] || -> .
% 1.35/1.55 2112[2:Spt:2111.0,466.1] || -> duplicatefreeP(sk1)*.
% 1.35/1.55 2114[3:Spt:294.0] || -> ssItem(u)*.
% 1.35/1.55 2144[3:MRR:114.1,114.0,2114.0] || -> equal(u,v) neq(u,v)*.
% 1.35/1.55 2310[4:Spt:481.5] || -> equal(nil,sk1)**.
% 1.35/1.55 2362[4:Rew:2310.0,299.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 2369[4:Rew:2310.0,8.0] || equal(sk1,sk1) equal(nil,sk2)** -> .
% 1.35/1.55 2373[4:Rew:2310.0,559.1] || frontsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.35/1.55 2374[4:Rew:2310.0,205.0] || -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.35/1.55 2479[4:Obv:2369.0] || equal(nil,sk2)** -> .
% 1.35/1.55 2480[4:Rew:2310.0,2479.0] || equal(sk2,sk1)** -> .
% 1.35/1.55 2481[4:MRR:2374.1,2480.0] || -> neq(sk1,sk1)*.
% 1.35/1.55 2486[4:MRR:2373.0,2373.1,2362.0,2481.0] || -> .
% 1.35/1.55 2528[4:Spt:2486.0,481.5,2310.0] || equal(nil,sk1)** -> .
% 1.35/1.55 2529[4:Spt:2486.0,481.0,481.1,481.2,481.3,481.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.35/1.55 2531[4:MRR:206.1,2528.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 2535[4:MRR:559.0,2531.0] || neq(sk1,nil)* -> .
% 1.35/1.55 2800[4:Res:2144.1,2535.0] || -> equal(nil,sk1)**.
% 1.35/1.55 2801[4:MRR:2800.0,2528.0] || -> .
% 1.35/1.55 2802[3:Spt:2801.0,294.1] || -> duplicatefreeP(sk2)*.
% 1.35/1.55 2804[4:Spt:481.5] || -> equal(nil,sk1)**.
% 1.35/1.55 2857[4:Rew:2804.0,299.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 2864[4:Rew:2804.0,8.0] || equal(sk1,sk1) equal(nil,sk2)** -> .
% 1.35/1.55 2868[4:Rew:2804.0,559.1] || frontsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.35/1.55 2869[4:Rew:2804.0,205.0] || -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.35/1.55 2973[4:Obv:2864.0] || equal(nil,sk2)** -> .
% 1.35/1.55 2974[4:Rew:2804.0,2973.0] || equal(sk2,sk1)** -> .
% 1.35/1.55 2975[4:MRR:2869.1,2974.0] || -> neq(sk1,sk1)*.
% 1.35/1.55 2981[4:MRR:2868.0,2868.1,2857.0,2975.0] || -> .
% 1.35/1.55 3024[4:Spt:2981.0,481.5,2804.0] || equal(nil,sk1)** -> .
% 1.35/1.55 3025[4:Spt:2981.0,481.0,481.1,481.2,481.3,481.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.35/1.55 3027[4:MRR:206.1,3024.0] || -> frontsegP(sk2,sk1)*.
% 1.35/1.55 3029[4:MRR:207.1,3024.0] || -> neq(sk1,nil)*.
% 1.35/1.55 3033[4:MRR:559.0,559.1,3027.0,3029.0] || -> .
% 1.35/1.55 % SZS output end Refutation
% 1.35/1.55 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 clause60 clause61 clause72 clause102 clause177
% 1.35/1.55
%------------------------------------------------------------------------------