TSTP Solution File: SWC339-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC339-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:25 EDT 2022
% Result : Unsatisfiable 37.55s 37.79s
% Output : Refutation 37.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 23 RR)
% Number of literals : 53 ( 0 equ; 32 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC339-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC339-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC339-1.p',unknown),
[] ).
cnf(7,axiom,
ssList(sk5),
file('SWC339-1.p',unknown),
[] ).
cnf(8,axiom,
ssList(sk6),
file('SWC339-1.p',unknown),
[] ).
cnf(9,axiom,
equal(app(app(sk5,sk3),sk6),sk4),
file('SWC339-1.p',unknown),
[] ).
cnf(10,axiom,
totalorderedP(sk3),
file('SWC339-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
file('SWC339-1.p',unknown),
[] ).
cnf(99,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(u,v)) ),
file('SWC339-1.p',unknown),
[] ).
cnf(163,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(u,v),w),app(u,app(v,w))) ),
file('SWC339-1.p',unknown),
[] ).
cnf(187,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(app(v,w),u),x)
| segmentP(x,w) ),
file('SWC339-1.p',unknown),
[] ).
cnf(200,plain,
totalorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[6,10]),
[iquote('0:Rew:6.0,10.0')] ).
cnf(203,plain,
~ segmentP(sk2,sk1),
inference(mrr,[status(thm)],[14,200]),
[iquote('0:MRR:14.1,200.0')] ).
cnf(205,plain,
equal(app(app(sk5,sk1),sk6),sk2),
inference(rew,[status(thm),theory(equality)],[6,9,5]),
[iquote('0:Rew:6.0,9.0,5.0,9.0')] ).
cnf(209,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(w,app(v,x)),u)
| segmentP(u,v) ),
inference(rew,[status(thm),theory(equality)],[163,187]),
[iquote('0:Rew:163.3,187.4')] ).
cnf(242,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(app(app(u,v),sk6),app(u,app(v,sk6))) ),
inference(res,[status(thm),theory(equality)],[8,163]),
[iquote('0:Res:8.0,163.0')] ).
cnf(6613,plain,
( ~ ssList(app(u,app(v,w)))
| ~ ssList(v)
| ~ ssList(u)
| ~ ssList(w)
| segmentP(app(u,app(v,w)),v) ),
inference(eqr,[status(thm),theory(equality)],[209]),
[iquote('0:EqR:209.4')] ).
cnf(6652,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| segmentP(app(v,app(u,w)),u) ),
inference(ssi,[status(thm)],[6613,99]),
[iquote('0:SSi:6613.0,99.2,99.2')] ).
cnf(23695,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| equal(app(sk5,app(sk1,sk6)),sk2) ),
inference(spr,[status(thm),theory(equality)],[242,205]),
[iquote('0:SpR:242.2,205.0')] ).
cnf(31628,plain,
equal(app(sk5,app(sk1,sk6)),sk2),
inference(ssi,[status(thm)],[23695,200,1,7]),
[iquote('0:SSi:23695.1,23695.0,200.0,1.0,7.0')] ).
cnf(32623,plain,
( ~ ssList(sk1)
| ~ ssList(sk5)
| ~ ssList(sk6)
| segmentP(sk2,sk1) ),
inference(spr,[status(thm),theory(equality)],[31628,6652]),
[iquote('0:SpR:31628.0,6652.3')] ).
cnf(33157,plain,
segmentP(sk2,sk1),
inference(ssi,[status(thm)],[32623,8,7,200,1]),
[iquote('0:SSi:32623.2,32623.1,32623.0,8.0,7.0,200.0,1.0')] ).
cnf(33158,plain,
$false,
inference(mrr,[status(thm)],[33157,203]),
[iquote('0:MRR:33157.0,203.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC339-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n010.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 05:04:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 37.55/37.79
% 37.55/37.79 SPASS V 3.9
% 37.55/37.79 SPASS beiseite: Proof found.
% 37.55/37.79 % SZS status Theorem
% 37.55/37.79 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 37.55/37.79 SPASS derived 19450 clauses, backtracked 9445 clauses, performed 72 splits and kept 14481 clauses.
% 37.55/37.79 SPASS allocated 103139 KBytes.
% 37.55/37.79 SPASS spent 0:0:33.54 on the problem.
% 37.55/37.79 0:00:00.04 for the input.
% 37.55/37.79 0:00:00.00 for the FLOTTER CNF translation.
% 37.55/37.79 0:00:00.30 for inferences.
% 37.55/37.79 0:00:01.80 for the backtracking.
% 37.55/37.79 0:0:31.03 for the reduction.
% 37.55/37.79
% 37.55/37.79
% 37.55/37.79 Here is a proof with depth 3, length 23 :
% 37.55/37.79 % SZS output start Refutation
% See solution above
% 37.55/37.79 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_14 clause85 clause149 clause173
% 37.55/37.79
%------------------------------------------------------------------------------