TSTP Solution File: SWC007-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC007-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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:02 EDT 2022
% Result : Unsatisfiable 10.21s 10.42s
% Output : Refutation 10.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 34 ( 21 unt; 0 nHn; 34 RR)
% Number of literals : 63 ( 0 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC007-1.p',unknown),
[] ).
cnf(2,axiom,
ssList(sk2),
file('SWC007-1.p',unknown),
[] ).
cnf(5,axiom,
equal(nil,sk3),
file('SWC007-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk3,sk1),
file('SWC007-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(app(u,v),w),sk2)
| ~ equal(app(u,w),sk1) ),
file('SWC007-1.p',unknown),
[] ).
cnf(9,axiom,
equalelemsP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(10,axiom,
duplicatefreeP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(11,axiom,
strictorderedP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(12,axiom,
totalorderedP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(13,axiom,
strictorderP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(14,axiom,
totalorderP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(15,axiom,
cyclefreeP(nil),
file('SWC007-1.p',unknown),
[] ).
cnf(81,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC007-1.p',unknown),
[] ).
cnf(82,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC007-1.p',unknown),
[] ).
cnf(157,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(u,v),w),app(u,app(v,w))) ),
file('SWC007-1.p',unknown),
[] ).
cnf(196,plain,
equal(nil,sk1),
inference(rew,[status(thm),theory(equality)],[7,5]),
[iquote('0:Rew:7.0,5.0')] ).
cnf(198,plain,
cyclefreeP(sk1),
inference(rew,[status(thm),theory(equality)],[196,15]),
[iquote('0:Rew:196.0,15.0')] ).
cnf(199,plain,
totalorderP(sk1),
inference(rew,[status(thm),theory(equality)],[196,14]),
[iquote('0:Rew:196.0,14.0')] ).
cnf(200,plain,
strictorderP(sk1),
inference(rew,[status(thm),theory(equality)],[196,13]),
[iquote('0:Rew:196.0,13.0')] ).
cnf(201,plain,
totalorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[196,12]),
[iquote('0:Rew:196.0,12.0')] ).
cnf(202,plain,
strictorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[196,11]),
[iquote('0:Rew:196.0,11.0')] ).
cnf(203,plain,
duplicatefreeP(sk1),
inference(rew,[status(thm),theory(equality)],[196,10]),
[iquote('0:Rew:196.0,10.0')] ).
cnf(204,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[196,9]),
[iquote('0:Rew:196.0,9.0')] ).
cnf(217,plain,
( ~ ssList(u)
| equal(app(sk1,u),u) ),
inference(rew,[status(thm),theory(equality)],[196,82]),
[iquote('0:Rew:196.0,82.1')] ).
cnf(218,plain,
( ~ ssList(u)
| equal(app(u,sk1),u) ),
inference(rew,[status(thm),theory(equality)],[196,81]),
[iquote('0:Rew:196.0,81.1')] ).
cnf(250,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(w,u),sk1)
| ~ equal(app(w,app(v,u)),sk2) ),
inference(rew,[status(thm),theory(equality)],[157,8]),
[iquote('0:Rew:157.3,8.3')] ).
cnf(334,plain,
equal(app(sk2,sk1),sk2),
inference(res,[status(thm),theory(equality)],[2,218]),
[iquote('0:Res:2.0,218.0')] ).
cnf(442,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(sk1,app(u,v)),sk2)
| ~ equal(app(sk1,v),sk1) ),
inference(res,[status(thm),theory(equality)],[1,250]),
[iquote('0:Res:1.0,250.0')] ).
cnf(585,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(app(app(sk1,v),u),app(sk1,app(v,u))) ),
inference(res,[status(thm),theory(equality)],[1,157]),
[iquote('0:Res:1.0,157.2')] ).
cnf(640,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(app(sk1,app(u,v)),app(u,v)) ),
inference(rew,[status(thm),theory(equality)],[217,585]),
[iquote('0:Rew:217.1,585.2')] ).
cnf(652,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(u,sk1)
| ~ equal(app(v,u),sk2) ),
inference(rew,[status(thm),theory(equality)],[217,442,640]),
[iquote('0:Rew:217.1,442.3,640.2,442.2')] ).
cnf(13727,plain,
( ~ ssList(sk1)
| ~ ssList(sk2)
| ~ equal(sk1,sk1)
| ~ equal(sk2,sk2) ),
inference(spl,[status(thm),theory(equality)],[334,652]),
[iquote('0:SpL:334.0,652.3')] ).
cnf(14979,plain,
( ~ ssList(sk1)
| ~ ssList(sk2) ),
inference(obv,[status(thm),theory(equality)],[13727]),
[iquote('0:Obv:13727.3')] ).
cnf(14980,plain,
$false,
inference(ssi,[status(thm)],[14979,2,204,203,198,199,200,201,202,1]),
[iquote('0:SSi:14979.1,14979.0,2.0,204.0,203.0,198.0,199.0,200.0,201.0,202.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC007-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n009.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 08:22:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 10.21/10.42
% 10.21/10.42 SPASS V 3.9
% 10.21/10.42 SPASS beiseite: Proof found.
% 10.21/10.42 % SZS status Theorem
% 10.21/10.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.21/10.42 SPASS derived 9010 clauses, backtracked 1929 clauses, performed 8 splits and kept 4398 clauses.
% 10.21/10.42 SPASS allocated 89366 KBytes.
% 10.21/10.42 SPASS spent 0:00:09.00 on the problem.
% 10.21/10.42 0:00:00.04 for the input.
% 10.21/10.42 0:00:00.00 for the FLOTTER CNF translation.
% 10.21/10.42 0:00:00.16 for inferences.
% 10.21/10.42 0:00:00.40 for the backtracking.
% 10.21/10.42 0:00:08.17 for the reduction.
% 10.21/10.42
% 10.21/10.42
% 10.21/10.42 Here is a proof with depth 2, length 34 :
% 10.21/10.42 % SZS output start Refutation
% See solution above
% 10.21/10.42 Formulae used in the proof : co1_1 co1_2 co1_5 co1_7 co1_8 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause73 clause74 clause149
% 10.21/10.42
%------------------------------------------------------------------------------