TSTP Solution File: SWC286+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC286+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:04 EDT 2022
% Result : Theorem 0.84s 1.08s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC286+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 01:14:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.84/1.08
% 0.84/1.08 SPASS V 3.9
% 0.84/1.08 SPASS beiseite: Proof found.
% 0.84/1.08 % SZS status Theorem
% 0.84/1.08 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.84/1.08 SPASS derived 997 clauses, backtracked 641 clauses, performed 23 splits and kept 1490 clauses.
% 0.84/1.08 SPASS allocated 98942 KBytes.
% 0.84/1.08 SPASS spent 0:00:00.73 on the problem.
% 0.84/1.08 0:00:00.04 for the input.
% 0.84/1.08 0:00:00.06 for the FLOTTER CNF translation.
% 0.84/1.08 0:00:00.00 for inferences.
% 0.84/1.08 0:00:00.01 for the backtracking.
% 0.84/1.08 0:00:00.41 for the reduction.
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08 Here is a proof with depth 2, length 50 :
% 0.84/1.08 % SZS output start Refutation
% 0.84/1.08 1[0:Inp] || -> ssList(skc5)*.
% 0.84/1.08 2[0:Inp] || -> ssList(skc4)*.
% 0.84/1.08 6[0:Inp] || -> cyclefreeP(nil)*.
% 0.84/1.08 7[0:Inp] || -> totalorderP(nil)*.
% 0.84/1.08 8[0:Inp] || -> strictorderP(nil)*.
% 0.84/1.08 9[0:Inp] || -> totalorderedP(nil)*.
% 0.84/1.08 10[0:Inp] || -> strictorderedP(nil)*.
% 0.84/1.08 11[0:Inp] || -> duplicatefreeP(nil)*.
% 0.84/1.08 12[0:Inp] || -> equalelemsP(nil)*.
% 0.84/1.08 13[0:Inp] || strictorderedP(skc4)* -> .
% 0.84/1.08 52[0:Inp] || -> ssItem(skf44(u,v))*.
% 0.84/1.08 68[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 0.84/1.08 69[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 0.84/1.08 70[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 0.84/1.08 75[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 0.84/1.08 79[0:Inp] || -> SkP0(u,v) memberP(u,skf44(u,v))*.
% 0.84/1.08 86[0:Inp] || -> SkP0(u,v) equal(cons(skf44(u,v),nil),v)**.
% 0.84/1.08 187[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.84/1.08 196[0:Rew:69.1,68.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 0.84/1.08 285[0:Res:2.0,187.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 0.84/1.08 456[0:Res:1.0,187.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 0.84/1.08 559[1:Spt:456.5] || -> equal(nil,skc5)**.
% 0.84/1.08 631[1:Rew:559.0,12.0] || -> equalelemsP(skc5)*.
% 0.84/1.08 632[1:Rew:559.0,11.0] || -> duplicatefreeP(skc5)*.
% 0.84/1.08 633[1:Rew:559.0,10.0] || -> strictorderedP(skc5)*.
% 0.84/1.08 634[1:Rew:559.0,9.0] || -> totalorderedP(skc5)*.
% 0.84/1.08 635[1:Rew:559.0,8.0] || -> strictorderP(skc5)*.
% 0.84/1.08 636[1:Rew:559.0,7.0] || -> totalorderP(skc5)*.
% 0.84/1.08 637[1:Rew:559.0,6.0] || -> cyclefreeP(skc5)*.
% 0.84/1.08 653[1:Rew:559.0,70.1] ssItem(u) || memberP(skc5,u)* -> .
% 0.84/1.08 759[2:Spt:196.1] || -> equal(skc5,skc4)**.
% 0.84/1.08 862[2:Rew:759.0,633.0] || -> strictorderedP(skc4)*.
% 0.84/1.08 911[2:MRR:862.0,13.0] || -> .
% 0.84/1.08 1009[2:Spt:911.0,196.1,759.0] || equal(skc5,skc4)** -> .
% 0.84/1.08 1010[2:Spt:911.0,196.0] || SkP0(skc5,skc4)* -> .
% 0.84/1.08 1057[1:Res:79.1,653.1] ssItem(skf44(skc5,u)) || -> SkP0(skc5,u)*.
% 0.84/1.08 1058[1:SSi:1057.0,52.0,637.0,636.0,635.0,634.0,633.0,632.0,631.0,1.0] || -> SkP0(skc5,u)*.
% 0.84/1.08 1059[2:UnC:1058.0,1010.0] || -> .
% 0.84/1.08 1060[1:Spt:1059.0,456.5,559.0] || equal(nil,skc5)** -> .
% 0.84/1.08 1061[1:Spt:1059.0,456.0,456.1,456.2,456.3,456.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.84/1.08 1076[2:Spt:285.5] || -> equal(nil,skc4)**.
% 0.84/1.08 1083[2:Rew:1076.0,10.0] || -> strictorderedP(skc4)*.
% 0.84/1.08 1169[2:MRR:1083.0,13.0] || -> .
% 0.84/1.08 1248[2:Spt:1169.0,285.5,1076.0] || equal(nil,skc4)** -> .
% 0.84/1.08 1249[2:Spt:1169.0,285.0,285.1,285.2,285.3,285.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 0.84/1.08 1255[2:MRR:69.1,1248.0] || SkP0(skc5,skc4)* -> .
% 0.84/1.08 1375[0:SpR:86.1,75.1] ssItem(skf44(u,v)) || -> SkP0(u,v)* strictorderedP(v).
% 0.84/1.08 1384[0:SSi:1375.0,52.0] || -> SkP0(u,v)* strictorderedP(v).
% 0.84/1.08 1393[2:Res:1384.0,1255.0] || -> strictorderedP(skc4)*.
% 0.84/1.08 1394[2:MRR:1393.0,13.0] || -> .
% 0.84/1.08 % SZS output end Refutation
% 0.84/1.08 Formulae used in the proof : co1 ax2 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax38 ax68 ax77
% 0.84/1.08
%------------------------------------------------------------------------------