TSTP Solution File: SWC392-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC392-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:03:47 EDT 2022
% Result : Unsatisfiable 2.25s 2.50s
% Output : Refutation 2.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC392-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n022.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 10:14:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 2.25/2.50
% 2.25/2.50 SPASS V 3.9
% 2.25/2.50 SPASS beiseite: Proof found.
% 2.25/2.50 % SZS status Theorem
% 2.25/2.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.25/2.50 SPASS derived 5506 clauses, backtracked 1851 clauses, performed 31 splits and kept 4919 clauses.
% 2.25/2.50 SPASS allocated 82091 KBytes.
% 2.25/2.50 SPASS spent 0:00:02.02 on the problem.
% 2.25/2.50 0:00:00.04 for the input.
% 2.25/2.50 0:00:00.00 for the FLOTTER CNF translation.
% 2.25/2.50 0:00:00.05 for inferences.
% 2.25/2.50 0:00:00.04 for the backtracking.
% 2.25/2.50 0:00:01.74 for the reduction.
% 2.25/2.50
% 2.25/2.50
% 2.25/2.50 Here is a proof with depth 2, length 76 :
% 2.25/2.50 % SZS output start Refutation
% 2.25/2.50 2[0:Inp] || -> ssList(sk2)*.
% 2.25/2.50 5[0:Inp] || -> equal(sk4,sk2)**.
% 2.25/2.50 6[0:Inp] || -> equal(sk3,sk1)**.
% 2.25/2.50 7[0:Inp] || -> ssItem(sk5)*.
% 2.25/2.50 8[0:Inp] || -> memberP(sk1,sk5)*.
% 2.25/2.50 9[0:Inp] || memberP(sk2,sk5)* -> .
% 2.25/2.50 10[0:Inp] || -> ssItem(sk6)* equal(nil,sk4).
% 2.25/2.50 11[0:Inp] || -> ssItem(sk6)* equal(nil,sk3).
% 2.25/2.50 12[0:Inp] || -> equal(cons(sk6,nil),sk3)** equal(nil,sk4).
% 2.25/2.50 13[0:Inp] || -> memberP(sk4,sk6)* equal(nil,sk4).
% 2.25/2.50 15[0:Inp] || -> equal(cons(sk6,nil),sk3)** equal(nil,sk3).
% 2.25/2.50 16[0:Inp] || -> memberP(sk4,sk6)* equal(nil,sk3).
% 2.25/2.50 18[0:Inp] || -> equalelemsP(nil)*.
% 2.25/2.50 19[0:Inp] || -> duplicatefreeP(nil)*.
% 2.25/2.50 20[0:Inp] || -> strictorderedP(nil)*.
% 2.25/2.50 21[0:Inp] || -> totalorderedP(nil)*.
% 2.25/2.50 22[0:Inp] || -> strictorderP(nil)*.
% 2.25/2.50 23[0:Inp] || -> totalorderP(nil)*.
% 2.25/2.50 24[0:Inp] || -> cyclefreeP(nil)*.
% 2.25/2.50 25[0:Inp] || -> ssList(nil)*.
% 2.25/2.50 88[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 2.25/2.50 89[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 2.25/2.50 178[0:Inp] ssItem(u) ssItem(v) ssList(w) || memberP(cons(v,w),u)* -> equal(u,v) memberP(w,u).
% 2.25/2.50 205[0:Rew:6.0,11.1] || -> ssItem(sk6)* equal(nil,sk1).
% 2.25/2.50 206[0:Rew:205.1,10.1,5.0,10.1] || -> ssItem(sk6)* equal(sk2,sk1).
% 2.25/2.50 207[0:Rew:6.0,16.1,5.0,16.0] || -> equal(nil,sk1) memberP(sk2,sk6)*.
% 2.25/2.50 208[0:Rew:207.1,13.1,5.0,13.1,5.0,13.0] || -> equal(sk2,sk1) memberP(sk2,sk6)*.
% 2.25/2.50 209[0:Rew:6.0,15.1,6.0,15.0] || -> equal(nil,sk1) equal(cons(sk6,nil),sk1)**.
% 2.25/2.50 210[0:Rew:209.1,12.1,5.0,12.1,6.0,12.0] || -> equal(sk2,sk1) equal(cons(sk6,nil),sk1)**.
% 2.25/2.50 402[0:Res:2.0,89.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 2.25/2.50 494[1:Spt:89.1] || -> ssItem(u)*.
% 2.25/2.50 498[1:MRR:88.0,494.0] || memberP(nil,u)* -> .
% 2.25/2.50 615[1:MRR:178.1,178.0,494.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w).
% 2.25/2.50 694[2:Spt:208.0] || -> equal(sk2,sk1)**.
% 2.25/2.50 802[2:Rew:694.0,9.0] || memberP(sk1,sk5)* -> .
% 2.25/2.50 857[2:MRR:802.0,8.0] || -> .
% 2.25/2.50 944[2:Spt:857.0,208.0,694.0] || equal(sk2,sk1)** -> .
% 2.25/2.50 945[2:Spt:857.0,208.1] || -> memberP(sk2,sk6)*.
% 2.25/2.50 946[2:MRR:210.0,944.0] || -> equal(cons(sk6,nil),sk1)**.
% 2.25/2.50 1865[2:SpL:946.0,615.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 2.25/2.50 1875[2:SSi:1865.0,18.0,19.0,20.0,21.0,22.0,23.0,24.0,25.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 2.25/2.50 1876[2:MRR:1875.2,498.0] || memberP(sk1,u)* -> equal(u,sk6).
% 2.25/2.50 1884[2:Res:8.0,1876.0] || -> equal(sk6,sk5)**.
% 2.25/2.50 1886[2:Rew:1884.0,945.0] || -> memberP(sk2,sk5)*.
% 2.25/2.50 1896[2:MRR:1886.0,9.0] || -> .
% 2.25/2.50 1898[1:Spt:1896.0,89.0,89.2] ssList(u) || -> duplicatefreeP(u)*.
% 2.25/2.50 1921[2:Spt:402.0] || -> ssItem(u)*.
% 2.25/2.50 1932[2:MRR:88.0,1921.0] || memberP(nil,u)* -> .
% 2.25/2.50 2042[2:MRR:178.1,178.0,1921.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w).
% 2.25/2.50 2118[3:Spt:208.0] || -> equal(sk2,sk1)**.
% 2.25/2.50 2127[3:Rew:2118.0,9.0] || memberP(sk1,sk5)* -> .
% 2.25/2.50 2285[3:MRR:2127.0,8.0] || -> .
% 2.25/2.50 2373[3:Spt:2285.0,208.0,2118.0] || equal(sk2,sk1)** -> .
% 2.25/2.50 2374[3:Spt:2285.0,208.1] || -> memberP(sk2,sk6)*.
% 2.25/2.50 2375[3:MRR:210.0,2373.0] || -> equal(cons(sk6,nil),sk1)**.
% 2.25/2.50 3340[3:SpL:2375.0,2042.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 2.25/2.50 3350[3:SSi:3340.0,25.0,24.0,23.0,22.0,21.0,20.0,19.0,18.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 2.25/2.50 3351[3:MRR:3350.2,1932.0] || memberP(sk1,u)* -> equal(u,sk6).
% 2.25/2.50 3359[3:Res:8.0,3351.0] || -> equal(sk6,sk5)**.
% 2.25/2.50 3361[3:Rew:3359.0,2374.0] || -> memberP(sk2,sk5)*.
% 2.25/2.50 3371[3:MRR:3361.0,9.0] || -> .
% 2.25/2.50 3373[2:Spt:3371.0,402.1] || -> duplicatefreeP(sk2)*.
% 2.25/2.50 3375[3:Spt:206.1] || -> equal(sk2,sk1)**.
% 2.25/2.50 3384[3:Rew:3375.0,9.0] || memberP(sk1,sk5)* -> .
% 2.25/2.50 3547[3:MRR:3384.0,8.0] || -> .
% 2.25/2.50 3639[3:Spt:3547.0,206.1,3375.0] || equal(sk2,sk1)** -> .
% 2.25/2.50 3640[3:Spt:3547.0,206.0] || -> ssItem(sk6)*.
% 2.25/2.50 3641[3:MRR:208.0,3639.0] || -> memberP(sk2,sk6)*.
% 2.25/2.50 3642[3:MRR:210.0,3639.0] || -> equal(cons(sk6,nil),sk1)**.
% 2.25/2.50 7870[3:SpL:3642.0,178.3] ssItem(u) ssItem(sk6) ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 2.25/2.50 7877[3:SSi:7870.2,7870.1,18.0,19.0,20.0,21.0,22.0,23.0,24.0,25.0,3640.0] ssItem(u) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*.
% 2.25/2.50 7878[3:MRR:7877.3,88.1] ssItem(u) || memberP(sk1,u)* -> equal(u,sk6).
% 2.25/2.50 7889[3:Res:8.0,7878.1] ssItem(sk5) || -> equal(sk6,sk5)**.
% 2.25/2.50 7891[3:SSi:7889.0,7.0] || -> equal(sk6,sk5)**.
% 2.25/2.50 7893[3:Rew:7891.0,3641.0] || -> memberP(sk2,sk5)*.
% 2.25/2.50 8002[3:MRR:7893.0,9.0] || -> .
% 2.25/2.50 % SZS output end Refutation
% 2.25/2.50 Formulae used in the proof : co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 co1_13 co1_15 co1_16 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause71 clause72 clause161
% 2.25/2.50
%------------------------------------------------------------------------------