TSTP Solution File: SWC105-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC105-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n007.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:45 EDT 2022

% Result   : Unsatisfiable 1.53s 1.71s
% Output   : Refutation 1.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC105-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.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 04:41:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.53/1.71  
% 1.53/1.71  SPASS V 3.9 
% 1.53/1.71  SPASS beiseite: Proof found.
% 1.53/1.71  % SZS status Theorem
% 1.53/1.71  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.53/1.71  SPASS derived 2409 clauses, backtracked 2512 clauses, performed 18 splits and kept 4085 clauses.
% 1.53/1.71  SPASS allocated 78174 KBytes.
% 1.53/1.71  SPASS spent	0:00:01.37 on the problem.
% 1.53/1.71  		0:00:00.04 for the input.
% 1.53/1.71  		0:00:00.00 for the FLOTTER CNF translation.
% 1.53/1.71  		0:00:00.00 for inferences.
% 1.53/1.71  		0:00:00.02 for the backtracking.
% 1.53/1.71  		0:00:01.11 for the reduction.
% 1.53/1.71  
% 1.53/1.71  
% 1.53/1.71  Here is a proof with depth 2, length 140 :
% 1.53/1.71  % SZS output start Refutation
% 1.53/1.71  1[0:Inp] ||  -> ssList(sk1)*.
% 1.53/1.71  2[0:Inp] ||  -> ssList(sk2)*.
% 1.53/1.71  5[0:Inp] ||  -> equal(sk4,sk2)**.
% 1.53/1.71  6[0:Inp] ||  -> equal(sk3,sk1)**.
% 1.53/1.71  7[0:Inp] ||  -> neq(sk2,nil)* equal(nil,sk2).
% 1.53/1.71  8[0:Inp] || rearsegP(sk2,sk1)* neq(sk1,nil) -> equal(nil,sk2).
% 1.53/1.71  9[0:Inp] || equal(nil,sk1) -> neq(sk2,nil)*.
% 1.53/1.71  10[0:Inp] || equal(nil,sk1) neq(sk1,nil) rearsegP(sk2,sk1)* -> .
% 1.53/1.71  11[0:Inp] ||  -> equal(nil,sk4) neq(sk3,nil)*.
% 1.53/1.71  12[0:Inp] ||  -> equal(nil,sk4) rearsegP(sk4,sk3)*.
% 1.53/1.71  13[0:Inp] ||  -> equal(nil,sk3) neq(sk3,nil)*.
% 1.53/1.71  14[0:Inp] ||  -> equal(nil,sk3) rearsegP(sk4,sk3)*.
% 1.53/1.71  72[0:Inp] ssList(u) ||  -> rearsegP(u,nil)*.
% 1.53/1.71  73[0:Inp] ssList(u) ||  -> rearsegP(u,u)*.
% 1.53/1.71  86[0:Inp] ssList(u) ||  -> ssItem(v)* duplicatefreeP(u)*.
% 1.53/1.71  96[0:Inp] ssList(u) || rearsegP(nil,u)* -> equal(nil,u).
% 1.53/1.71  131[0:Inp] ssItem(u) ssItem(v) || neq(u,v)* equal(u,v) -> .
% 1.53/1.71  191[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.53/1.71  202[0:Rew:5.0,14.1,6.0,14.1,6.0,14.0] ||  -> equal(nil,sk1) rearsegP(sk2,sk1)*.
% 1.53/1.71  203[0:Rew:6.0,13.1,6.0,13.0] ||  -> equal(nil,sk1) neq(sk1,nil)*.
% 1.53/1.71  204[0:Rew:5.0,12.1,6.0,12.1,5.0,12.0] ||  -> equal(nil,sk2) rearsegP(sk2,sk1)*.
% 1.53/1.71  205[0:Rew:204.0,202.0] ||  -> rearsegP(sk2,sk1)* equal(sk2,sk1).
% 1.53/1.71  206[0:Rew:6.0,11.1,5.0,11.0] ||  -> equal(nil,sk2) neq(sk1,nil)*.
% 1.53/1.71  207[0:Rew:206.0,203.0] ||  -> neq(sk1,nil)* equal(sk2,sk1).
% 1.53/1.71  208[0:Rew:205.0,204.0] ||  -> rearsegP(sk2,sk1)* equal(nil,sk1).
% 1.53/1.71  209[0:Rew:207.0,206.0] ||  -> neq(sk1,nil)* equal(nil,sk1).
% 1.53/1.71  210[0:Rew:7.0,9.0] || equal(sk2,sk1) -> neq(sk2,nil)*.
% 1.53/1.71  211[0:Rew:8.2,10.0] || rearsegP(sk2,sk1)* neq(sk1,nil) equal(sk2,sk1) -> .
% 1.53/1.71  297[0:Res:2.0,86.0] ||  -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.53/1.71  300[0:Res:2.0,72.0] ||  -> rearsegP(sk2,nil)*.
% 1.53/1.71  312[0:Res:2.0,191.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2).
% 1.53/1.71  458[0:Res:1.0,96.0] || rearsegP(nil,sk1)* -> equal(nil,sk1).
% 1.53/1.71  468[0:Res:1.0,86.0] ||  -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.53/1.71  472[0:Res:1.0,73.0] ||  -> rearsegP(sk1,sk1)*.
% 1.53/1.71  483[0:Res:1.0,191.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.53/1.71  562[1:Spt:86.1] ||  -> ssItem(u)*.
% 1.53/1.71  602[1:MRR:131.1,131.0,562.0] || neq(u,v)* equal(u,v) -> .
% 1.53/1.71  766[2:Spt:483.5] ||  -> equal(nil,sk1)**.
% 1.53/1.71  778[2:Rew:766.0,8.2] || rearsegP(sk2,sk1)* neq(sk1,nil) -> equal(sk2,sk1).
% 1.53/1.71  788[2:Rew:766.0,210.1] || equal(sk2,sk1) -> neq(sk2,sk1)*.
% 1.53/1.71  790[2:Rew:766.0,207.0] ||  -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.53/1.71  839[2:Rew:766.0,300.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  903[2:MRR:788.1,602.0] || equal(sk2,sk1)** -> .
% 1.53/1.71  905[2:MRR:790.1,903.0] ||  -> neq(sk1,sk1)*.
% 1.53/1.71  952[2:Rew:766.0,778.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> equal(sk2,sk1).
% 1.53/1.71  953[2:MRR:952.0,952.1,952.2,839.0,905.0,903.0] ||  -> .
% 1.53/1.71  982[2:Spt:953.0,483.5,766.0] || equal(nil,sk1)** -> .
% 1.53/1.71  983[2:Spt:953.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.53/1.71  985[2:MRR:208.1,982.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  987[2:MRR:458.1,982.0] || rearsegP(nil,sk1)* -> .
% 1.53/1.71  993[2:MRR:8.0,985.0] || neq(sk1,nil)* -> equal(nil,sk2).
% 1.53/1.71  1002[3:Spt:312.5] ||  -> equal(nil,sk2)**.
% 1.53/1.71  1051[3:Rew:1002.0,987.0] || rearsegP(sk2,sk1)* -> .
% 1.53/1.71  1105[3:MRR:1051.0,985.0] ||  -> .
% 1.53/1.71  1180[3:Spt:1105.0,312.5,1002.0] || equal(nil,sk2)** -> .
% 1.53/1.71  1181[3:Spt:1105.0,312.0,312.1,312.2,312.3,312.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.53/1.71  1186[3:MRR:993.1,1180.0] || neq(sk1,nil)* -> .
% 1.53/1.71  1187[3:MRR:207.0,1186.0] ||  -> equal(sk2,sk1)**.
% 1.53/1.71  1247[3:Rew:1187.0,210.1,1187.0,210.0] || equal(sk1,sk1) -> neq(sk1,nil)*.
% 1.53/1.71  1248[3:Obv:1247.0] ||  -> neq(sk1,nil)*.
% 1.53/1.71  1249[3:MRR:1248.0,1186.0] ||  -> .
% 1.53/1.71  1367[1:Spt:1249.0,86.0,86.2] ssList(u) ||  -> duplicatefreeP(u)*.
% 1.53/1.71  1383[2:Spt:468.0] ||  -> ssItem(u)*.
% 1.53/1.71  1428[2:MRR:131.1,131.0,1383.0] || neq(u,v)* equal(u,v) -> .
% 1.53/1.71  1579[3:Spt:483.5] ||  -> equal(nil,sk1)**.
% 1.53/1.71  1632[3:Rew:1579.0,300.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  1644[3:Rew:1579.0,8.2] || rearsegP(sk2,sk1)* neq(sk1,nil) -> equal(sk2,sk1).
% 1.53/1.71  1655[3:Rew:1579.0,207.0] ||  -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.53/1.71  1661[3:Rew:1579.0,210.1] || equal(sk2,sk1) -> neq(sk2,sk1)*.
% 1.53/1.71  1722[3:MRR:1661.1,1428.0] || equal(sk2,sk1)** -> .
% 1.53/1.71  1724[3:MRR:1655.1,1722.0] ||  -> neq(sk1,sk1)*.
% 1.53/1.71  1765[3:Rew:1579.0,1644.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> equal(sk2,sk1).
% 1.53/1.71  1766[3:MRR:1765.0,1765.1,1765.2,1632.0,1724.0,1722.0] ||  -> .
% 1.53/1.71  1797[3:Spt:1766.0,483.5,1579.0] || equal(nil,sk1)** -> .
% 1.53/1.71  1798[3:Spt:1766.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.53/1.71  1800[3:MRR:208.1,1797.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  1802[3:MRR:458.1,1797.0] || rearsegP(nil,sk1)* -> .
% 1.53/1.71  1808[3:MRR:8.0,1800.0] || neq(sk1,nil)* -> equal(nil,sk2).
% 1.53/1.71  1817[4:Spt:312.5] ||  -> equal(nil,sk2)**.
% 1.53/1.71  1866[4:Rew:1817.0,1802.0] || rearsegP(sk2,sk1)* -> .
% 1.53/1.71  1920[4:MRR:1866.0,1800.0] ||  -> .
% 1.53/1.71  1995[4:Spt:1920.0,312.5,1817.0] || equal(nil,sk2)** -> .
% 1.53/1.71  1996[4:Spt:1920.0,312.0,312.1,312.2,312.3,312.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.53/1.71  2001[4:MRR:1808.1,1995.0] || neq(sk1,nil)* -> .
% 1.53/1.71  2002[4:MRR:207.0,2001.0] ||  -> equal(sk2,sk1)**.
% 1.53/1.71  2062[4:Rew:2002.0,210.1,2002.0,210.0] || equal(sk1,sk1) -> neq(sk1,nil)*.
% 1.53/1.71  2063[4:Obv:2062.0] ||  -> neq(sk1,nil)*.
% 1.53/1.71  2064[4:MRR:2063.0,2001.0] ||  -> .
% 1.53/1.71  2182[2:Spt:2064.0,468.1] ||  -> duplicatefreeP(sk1)*.
% 1.53/1.71  2184[3:Spt:297.0] ||  -> ssItem(u)*.
% 1.53/1.71  2224[3:MRR:131.1,131.0,2184.0] || neq(u,v)* equal(u,v) -> .
% 1.53/1.71  2380[4:Spt:483.5] ||  -> equal(nil,sk1)**.
% 1.53/1.71  2433[4:Rew:2380.0,300.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  2445[4:Rew:2380.0,8.2] || rearsegP(sk2,sk1)* neq(sk1,nil) -> equal(sk2,sk1).
% 1.53/1.71  2456[4:Rew:2380.0,207.0] ||  -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.53/1.71  2462[4:Rew:2380.0,210.1] || equal(sk2,sk1) -> neq(sk2,sk1)*.
% 1.53/1.71  2522[4:MRR:2462.1,2224.0] || equal(sk2,sk1)** -> .
% 1.53/1.71  2524[4:MRR:2456.1,2522.0] ||  -> neq(sk1,sk1)*.
% 1.53/1.71  2565[4:Rew:2380.0,2445.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> equal(sk2,sk1).
% 1.53/1.71  2566[4:MRR:2565.0,2565.1,2565.2,2433.0,2524.0,2522.0] ||  -> .
% 1.53/1.71  2597[4:Spt:2566.0,483.5,2380.0] || equal(nil,sk1)** -> .
% 1.53/1.71  2598[4:Spt:2566.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.53/1.71  2600[4:MRR:208.1,2597.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  2602[4:MRR:458.1,2597.0] || rearsegP(nil,sk1)* -> .
% 1.53/1.71  2608[4:MRR:8.0,2600.0] || neq(sk1,nil)* -> equal(nil,sk2).
% 1.53/1.71  2615[5:Spt:312.5] ||  -> equal(nil,sk2)**.
% 1.53/1.71  2664[5:Rew:2615.0,2602.0] || rearsegP(sk2,sk1)* -> .
% 1.53/1.71  2717[5:MRR:2664.0,2600.0] ||  -> .
% 1.53/1.71  2791[5:Spt:2717.0,312.5,2615.0] || equal(nil,sk2)** -> .
% 1.53/1.71  2792[5:Spt:2717.0,312.0,312.1,312.2,312.3,312.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.53/1.71  2797[5:MRR:2608.1,2791.0] || neq(sk1,nil)* -> .
% 1.53/1.71  2798[5:MRR:207.0,2797.0] ||  -> equal(sk2,sk1)**.
% 1.53/1.71  2858[5:Rew:2798.0,210.1,2798.0,210.0] || equal(sk1,sk1) -> neq(sk1,nil)*.
% 1.53/1.71  2859[5:Obv:2858.0] ||  -> neq(sk1,nil)*.
% 1.53/1.71  2860[5:MRR:2859.0,2797.0] ||  -> .
% 1.53/1.71  2975[3:Spt:2860.0,297.1] ||  -> duplicatefreeP(sk2)*.
% 1.53/1.71  2977[4:Spt:483.5] ||  -> equal(nil,sk1)**.
% 1.53/1.71  3031[4:Rew:2977.0,300.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.71  3043[4:Rew:2977.0,8.2] || rearsegP(sk2,sk1)* neq(sk1,nil) -> equal(sk2,sk1).
% 1.53/1.71  3052[4:Rew:2977.0,7.1] ||  -> neq(sk2,nil)* equal(sk2,sk1).
% 1.53/1.71  3055[4:Rew:2977.0,211.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) equal(sk2,sk1) -> .
% 1.53/1.71  3056[4:Rew:2977.0,207.0] ||  -> neq(sk1,sk1)* equal(sk2,sk1).
% 1.53/1.71  3062[4:Rew:2977.0,210.1] || equal(sk2,sk1) -> neq(sk2,sk1)*.
% 1.53/1.71  3106[4:Rew:2977.0,3052.0] ||  -> neq(sk2,sk1)* equal(sk2,sk1).
% 1.53/1.71  3119[4:Rew:3106.1,3062.0] || equal(sk1,sk1) -> neq(sk2,sk1)*.
% 1.53/1.71  3120[4:Obv:3119.0] ||  -> neq(sk2,sk1)*.
% 1.53/1.71  3155[4:Rew:2977.0,3043.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> equal(sk2,sk1).
% 1.53/1.71  3156[4:MRR:3155.0,3155.1,3031.0,3056.0] ||  -> equal(sk2,sk1)**.
% 1.53/1.73  3298[4:Rew:3156.0,3120.0] ||  -> neq(sk1,sk1)*.
% 1.53/1.73  3323[4:Rew:3156.0,3055.2,3156.0,3055.0] || rearsegP(sk1,sk1)* neq(sk1,sk1) equal(sk1,sk1) -> .
% 1.53/1.73  3324[4:Obv:3323.2] || rearsegP(sk1,sk1)* neq(sk1,sk1) -> .
% 1.53/1.73  3325[4:MRR:3324.0,3324.1,472.0,3298.0] ||  -> .
% 1.53/1.73  3412[4:Spt:3325.0,483.5,2977.0] || equal(nil,sk1)** -> .
% 1.53/1.73  3413[4:Spt:3325.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.53/1.73  3415[4:MRR:208.1,3412.0] ||  -> rearsegP(sk2,sk1)*.
% 1.53/1.73  3417[4:MRR:209.1,3412.0] ||  -> neq(sk1,nil)*.
% 1.53/1.73  3419[4:MRR:458.1,3412.0] || rearsegP(nil,sk1)* -> .
% 1.53/1.73  3423[4:MRR:8.0,8.1,3415.0,3417.0] ||  -> equal(nil,sk2)**.
% 1.53/1.73  3453[4:Rew:3423.0,3419.0] || rearsegP(sk2,sk1)* -> .
% 1.53/1.73  3479[4:MRR:3453.0,3415.0] ||  -> .
% 1.53/1.73  % SZS output end Refutation
% 1.53/1.73  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 co1_13 co1_14 clause58 clause59 clause72 clause82 clause117 clause177
% 1.53/1.73  
%------------------------------------------------------------------------------