TSTP Solution File: SWC312+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC312+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:03:14 EDT 2022

% Result   : Theorem 96.73s 96.92s
% Output   : Refutation 96.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC312+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n006.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 12 10:42:42 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 96.73/96.92  
% 96.73/96.92  SPASS V 3.9 
% 96.73/96.92  SPASS beiseite: Proof found.
% 96.73/96.92  % SZS status Theorem
% 96.73/96.92  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 96.73/96.92  SPASS derived 32476 clauses, backtracked 11922 clauses, performed 50 splits and kept 17421 clauses.
% 96.73/96.92  SPASS allocated 149377 KBytes.
% 96.73/96.92  SPASS spent	0:1:19.95 on the problem.
% 96.73/96.92  		0:00:00.04 for the input.
% 96.73/96.92  		0:00:00.06 for the FLOTTER CNF translation.
% 96.73/96.92  		0:00:00.58 for inferences.
% 96.73/96.92  		0:00:03.28 for the backtracking.
% 96.73/96.92  		0:1:15.53 for the reduction.
% 96.73/96.92  
% 96.73/96.92  
% 96.73/96.92  Here is a proof with depth 6, length 91 :
% 96.73/96.92  % SZS output start Refutation
% 96.73/96.92  1[0:Inp] ||  -> ssList(skc9)*.
% 96.73/96.92  2[0:Inp] ||  -> ssItem(skc8)*.
% 96.73/96.92  3[0:Inp] ||  -> ssList(skc7)*.
% 96.73/96.92  5[0:Inp] ||  -> ssItem(skc11)*.
% 96.73/96.92  6[0:Inp] ||  -> ssItem(skc10)*.
% 96.73/96.92  7[0:Inp] ||  -> ssList(nil)*.
% 96.73/96.92  8[0:Inp] ||  -> cyclefreeP(nil)*.
% 96.73/96.92  9[0:Inp] ||  -> totalorderP(nil)*.
% 96.73/96.92  10[0:Inp] ||  -> strictorderP(nil)*.
% 96.73/96.92  11[0:Inp] ||  -> totalorderedP(nil)*.
% 96.73/96.92  12[0:Inp] ||  -> strictorderedP(nil)*.
% 96.73/96.92  13[0:Inp] ||  -> duplicatefreeP(nil)*.
% 96.73/96.92  14[0:Inp] ||  -> equalelemsP(nil)*.
% 96.73/96.92  53[0:Inp] || equal(skc11,skc10)** -> .
% 96.73/96.92  60[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 96.73/96.92  69[0:Inp] || equal(skc7,nil)** -> equal(skc6,nil).
% 96.73/96.92  70[0:Inp] || SkP0(skc6,skc7) -> neq(skc7,nil)*.
% 96.73/96.92  71[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 96.73/96.92  73[0:Inp] ssItem(u) ||  -> cyclefreeP(cons(u,nil))*.
% 96.73/96.92  74[0:Inp] ssItem(u) ||  -> totalorderP(cons(u,nil))*.
% 96.73/96.92  75[0:Inp] ssItem(u) ||  -> strictorderP(cons(u,nil))*.
% 96.73/96.92  76[0:Inp] ssItem(u) ||  -> totalorderedP(cons(u,nil))*.
% 96.73/96.92  77[0:Inp] ssItem(u) ||  -> strictorderedP(cons(u,nil))*.
% 96.73/96.92  78[0:Inp] ssItem(u) ||  -> duplicatefreeP(cons(u,nil))*.
% 96.73/96.92  79[0:Inp] ssItem(u) ||  -> equalelemsP(cons(u,nil))*.
% 96.73/96.92  81[0:Inp] ssList(u) ||  -> equal(app(nil,u),u)**.
% 96.73/96.92  90[0:Inp] ssItem(u) ssList(v) ||  -> ssList(cons(u,v))*.
% 96.73/96.92  98[0:Inp] || neq(skc7,nil) -> equal(app(cons(skc8,nil),skc9),skc7)**.
% 96.73/96.92  99[0:Inp] || neq(skc7,nil) -> equal(app(skc9,cons(skc8,nil)),skc6)**.
% 96.73/96.92  112[0:Inp] ssItem(u) ssList(v) ||  -> equal(hd(cons(u,v)),u)**.
% 96.73/96.92  123[0:Inp] ssList(u) ssList(v) || equal(v,u) neq(v,u)* -> .
% 96.73/96.92  129[0:Inp] ssItem(u) ssList(v) ||  -> equal(app(cons(u,nil),v),cons(u,v))**.
% 96.73/96.92  134[0:Inp] ssList(u) ssList(v) ||  -> equal(nil,v) equal(hd(app(v,u)),hd(v))**.
% 96.73/96.92  154[0:Inp] ssList(u) ssItem(v) || strictorderedP(cons(v,u))* -> lt(v,hd(u)) equal(nil,u).
% 96.73/96.92  188[0:Inp] ssItem(u) ssList(v) || equal(app(cons(u,nil),v),skc7)** equal(app(v,cons(u,nil)),skc6)** SkP0(skc6,skc7) -> .
% 96.73/96.92  203[0:Rew:129.2,188.2] ssList(u) ssItem(v) || SkP0(skc6,skc7) equal(cons(v,u),skc7) equal(app(u,cons(v,nil)),skc6)** -> .
% 96.73/96.92  418[0:Res:3.0,134.0] ssList(u) ||  -> equal(skc7,nil) equal(hd(app(skc7,u)),hd(skc7))**.
% 96.73/96.92  429[0:Res:3.0,112.0] ssItem(u) ||  -> equal(hd(cons(u,skc7)),u)**.
% 96.73/96.92  441[0:Res:3.0,90.0] ssItem(u) ||  -> ssList(cons(u,skc7))*.
% 96.73/96.92  483[0:Res:3.0,154.1] ssItem(u) || strictorderedP(cons(u,skc7))* -> lt(u,hd(skc7)) equal(skc7,nil).
% 96.73/96.92  548[1:Spt:418.0,418.2] ssList(u) ||  -> equal(hd(app(skc7,u)),hd(skc7))**.
% 96.73/96.92  556[2:Spt:203.0,203.1,203.3,203.4] ssList(u) ssItem(v) || equal(cons(v,u),skc7) equal(app(u,cons(v,nil)),skc6)** -> .
% 96.73/96.92  559[3:Spt:483.3] ||  -> equal(skc7,nil)**.
% 96.73/96.92  560[3:Rew:559.0,548.1] ssList(u) ||  -> equal(hd(app(nil,u)),hd(nil))**.
% 96.73/96.92  582[3:Rew:559.0,441.1] ssItem(u) ||  -> ssList(cons(u,nil))*.
% 96.73/96.92  583[3:Rew:559.0,429.1] ssItem(u) ||  -> equal(hd(cons(u,nil)),u)**.
% 96.73/96.92  909[3:Rew:81.1,560.1] ssList(u) ||  -> equal(hd(u),hd(nil))*.
% 96.73/96.92  1206[3:SpR:583.1,909.1] ssItem(u) ssList(cons(u,nil)) ||  -> equal(u,hd(nil))*.
% 96.73/96.92  1209[3:SSi:1206.1,79.1,78.1,75.1,74.1,73.1,77.1,76.1,582.1] ssItem(u) ||  -> equal(u,hd(nil))*.
% 96.73/96.92  1279[3:SpR:1209.1,1209.1] ssItem(u) ssItem(v) ||  -> equal(v,u)*.
% 96.73/96.92  1317[3:EmS:1279.0,2.0] ssItem(u) ||  -> equal(u,skc8)*.
% 96.73/96.92  1339[3:EmS:1317.0,5.0] ||  -> equal(skc11,skc8)**.
% 96.73/96.92  1340[3:EmS:1317.0,6.0] ||  -> equal(skc10,skc8)**.
% 96.73/96.92  1342[3:Rew:1339.0,53.0] || equal(skc10,skc8)** -> .
% 96.73/96.92  1449[3:Rew:1340.0,1342.0] || equal(skc8,skc8)* -> .
% 96.73/96.92  1450[3:Obv:1449.0] ||  -> .
% 96.73/96.92  1479[3:Spt:1450.0,483.3,559.0] || equal(skc7,nil)** -> .
% 96.73/96.92  1480[3:Spt:1450.0,483.0,483.1,483.2] ssItem(u) || strictorderedP(cons(u,skc7))* -> lt(u,hd(skc7)).
% 96.73/96.92  2435[4:Spt:70.1] ||  -> neq(skc7,nil)*.
% 96.73/96.92  2436[4:MRR:98.0,2435.0] ||  -> equal(app(cons(skc8,nil),skc9),skc7)**.
% 96.73/96.92  2437[4:MRR:99.0,2435.0] ||  -> equal(app(skc9,cons(skc8,nil)),skc6)**.
% 96.73/96.92  3368[4:SpR:129.2,2436.0] ssItem(skc8) ssList(skc9) ||  -> equal(cons(skc8,skc9),skc7)**.
% 96.73/96.92  3379[4:SSi:3368.1,3368.0,1.0,2.0] ||  -> equal(cons(skc8,skc9),skc7)**.
% 96.73/96.92  48201[4:SpL:2437.0,556.3] ssList(skc9) ssItem(skc8) || equal(cons(skc8,skc9),skc7)** equal(skc6,skc6) -> .
% 96.73/96.92  50977[4:Obv:48201.3] ssList(skc9) ssItem(skc8) || equal(cons(skc8,skc9),skc7)** -> .
% 96.73/96.92  50978[4:Rew:3379.0,50977.2] ssList(skc9) ssItem(skc8) || equal(skc7,skc7)* -> .
% 96.73/96.92  50979[4:Obv:50978.2] ssList(skc9) ssItem(skc8) ||  -> .
% 96.73/96.92  50980[4:SSi:50979.1,50979.0,2.0,1.0] ||  -> .
% 96.73/96.92  51958[4:Spt:50980.0,70.1,2435.0] || neq(skc7,nil)* -> .
% 96.73/96.92  51959[4:Spt:50980.0,70.0] || SkP0(skc6,skc7)* -> .
% 96.73/96.92  53380[4:Res:60.0,51959.0] ||  -> equal(skc7,nil)**.
% 96.73/96.92  53381[4:MRR:53380.0,1479.0] ||  -> .
% 96.73/96.92  53382[2:Spt:53381.0,203.2] || SkP0(skc6,skc7)* -> .
% 96.73/96.92  53715[2:Res:71.1,53382.0] || equal(skc6,nil)** -> .
% 96.73/96.92  53716[2:Res:60.0,53382.0] ||  -> equal(skc7,nil)**.
% 96.73/96.92  54846[2:Rew:53716.0,69.0] || equal(nil,nil) -> equal(skc6,nil)**.
% 96.73/96.92  54884[2:Obv:54846.0] ||  -> equal(skc6,nil)**.
% 96.73/96.92  54885[2:MRR:54884.0,53715.0] ||  -> .
% 96.73/96.92  56094[1:Spt:54885.0,418.1] ||  -> equal(skc7,nil)**.
% 96.73/96.92  56106[1:Rew:56094.0,70.1,56094.0,70.0] || SkP0(skc6,nil) -> neq(nil,nil)*.
% 96.73/96.92  56118[1:Rew:56094.0,69.0] || equal(nil,nil) -> equal(skc6,nil)**.
% 96.73/96.92  56119[1:Obv:56118.0] ||  -> equal(skc6,nil)**.
% 96.73/96.92  57057[1:Rew:56119.0,56106.0] || SkP0(nil,nil) -> neq(nil,nil)*.
% 96.73/96.92  59846[2:Spt:57057.0] || SkP0(nil,nil)* -> .
% 96.73/96.92  59847[2:Res:71.1,59846.0] || equal(nil,nil)* -> .
% 96.73/96.92  59849[2:Obv:59847.0] ||  -> .
% 96.73/96.92  59850[2:Spt:59849.0,57057.0,59846.0] ||  -> SkP0(nil,nil)*.
% 96.73/96.92  59851[2:Spt:59849.0,57057.1] ||  -> neq(nil,nil)*.
% 96.73/96.92  59854[2:Res:59851.0,123.3] ssList(nil) ssList(nil) || equal(nil,nil)* -> .
% 96.73/96.92  59856[2:Obv:59854.2] ssList(nil) ||  -> .
% 96.73/96.92  59857[2:SSi:59856.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0] ||  -> .
% 96.73/96.92  % SZS output end Refutation
% 96.73/96.92  Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax59 ax61 ax63 ax65 ax68 ax71 ax73 ax28 ax16 ax23 ax15 ax81 ax85 ax70
% 96.73/96.92  
%------------------------------------------------------------------------------