TSTP Solution File: SWC024-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC024-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:10 EDT 2022
% Result : Unsatisfiable 2.73s 2.98s
% Output : Refutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 44 ( 25 unt; 1 nHn; 44 RR)
% Number of literals : 83 ( 0 equ; 47 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC024-1.p',unknown),
[] ).
cnf(2,axiom,
ssList(sk2),
file('SWC024-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC024-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC024-1.p',unknown),
[] ).
cnf(7,axiom,
neq(sk2,nil),
file('SWC024-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(sk1,u)
| ~ frontsegP(sk2,u) ),
file('SWC024-1.p',unknown),
[] ).
cnf(9,axiom,
ssList(sk5),
file('SWC024-1.p',unknown),
[] ).
cnf(10,axiom,
equal(app(sk3,sk5),sk4),
file('SWC024-1.p',unknown),
[] ).
cnf(11,axiom,
equalelemsP(sk3),
file('SWC024-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ equal(nil,sk3)
| equal(sk4,nil) ),
file('SWC024-1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(15,axiom,
duplicatefreeP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(16,axiom,
strictorderedP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(17,axiom,
totalorderedP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(18,axiom,
strictorderP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(19,axiom,
totalorderP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(20,axiom,
cyclefreeP(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(21,axiom,
ssList(nil),
file('SWC024-1.p',unknown),
[] ).
cnf(74,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC024-1.p',unknown),
[] ).
cnf(96,axiom,
( ~ ssList(u)
| ~ equal(nil,u)
| frontsegP(nil,u) ),
file('SWC024-1.p',unknown),
[] ).
cnf(113,axiom,
( ~ ssList(u)
| ~ ssList(v)
| equal(u,v)
| neq(u,v) ),
file('SWC024-1.p',unknown),
[] ).
cnf(131,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(u,v),nil)
| equal(nil,u) ),
file('SWC024-1.p',unknown),
[] ).
cnf(150,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(u,v)
| frontsegP(app(u,w),v) ),
file('SWC024-1.p',unknown),
[] ).
cnf(199,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[6,11]),
[iquote('0:Rew:6.0,11.0')] ).
cnf(202,plain,
equal(app(sk1,sk5),sk2),
inference(rew,[status(thm),theory(equality)],[6,10,5]),
[iquote('0:Rew:6.0,10.0,5.0,10.0')] ).
cnf(203,plain,
( ~ equal(nil,sk1)
| equal(nil,sk2) ),
inference(rew,[status(thm),theory(equality)],[5,13,6]),
[iquote('0:Rew:5.0,13.1,6.0,13.0')] ).
cnf(435,plain,
( ~ neq(sk2,nil)
| ~ frontsegP(sk2,sk2)
| ~ frontsegP(sk1,sk2) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.0')] ).
cnf(456,plain,
( ~ equal(nil,sk2)
| frontsegP(nil,sk2) ),
inference(res,[status(thm),theory(equality)],[2,96]),
[iquote('0:Res:2.0,96.0')] ).
cnf(471,plain,
frontsegP(sk2,sk2),
inference(res,[status(thm),theory(equality)],[2,74]),
[iquote('0:Res:2.0,74.0')] ).
cnf(557,plain,
~ frontsegP(sk1,sk2),
inference(mrr,[status(thm)],[435,7,471]),
[iquote('0:MRR:435.0,435.1,7.0,471.0')] ).
cnf(2362,plain,
( ~ ssList(sk1)
| ~ ssList(sk5)
| ~ equal(nil,sk2)
| equal(nil,sk1) ),
inference(spl,[status(thm),theory(equality)],[202,131]),
[iquote('0:SpL:202.0,131.2')] ).
cnf(3754,plain,
( ~ ssList(sk1)
| ~ ssList(u)
| ~ ssList(sk5)
| ~ frontsegP(sk1,u)
| frontsegP(sk2,u) ),
inference(spr,[status(thm),theory(equality)],[202,150]),
[iquote('0:SpR:202.0,150.4')] ).
cnf(4420,plain,
( ~ ssList(u)
| ~ frontsegP(sk1,u)
| frontsegP(sk2,u) ),
inference(ssi,[status(thm)],[3754,9,199,1]),
[iquote('0:SSi:3754.2,3754.0,9.0,199.0,1.0')] ).
cnf(4421,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(sk1,u) ),
inference(mrr,[status(thm)],[8,4420]),
[iquote('0:MRR:8.3,4420.2')] ).
cnf(4487,plain,
( ~ ssList(sk1)
| ~ ssList(sk1)
| ~ neq(sk1,nil) ),
inference(res,[status(thm),theory(equality)],[74,4421]),
[iquote('0:Res:74.1,4421.2')] ).
cnf(4489,plain,
( ~ ssList(sk1)
| ~ neq(sk1,nil) ),
inference(obv,[status(thm),theory(equality)],[4487]),
[iquote('0:Obv:4487.0')] ).
cnf(4490,plain,
~ neq(sk1,nil),
inference(ssi,[status(thm)],[4489,199,1]),
[iquote('0:SSi:4489.0,199.0,1.0')] ).
cnf(4497,plain,
( ~ equal(nil,sk2)
| equal(nil,sk1) ),
inference(ssi,[status(thm)],[2362,9,199,1]),
[iquote('0:SSi:2362.1,2362.0,9.0,199.0,1.0')] ).
cnf(4499,plain,
( ~ equal(nil,sk2)
| frontsegP(sk1,sk2) ),
inference(rew,[status(thm),theory(equality)],[4497,456]),
[iquote('0:Rew:4497.1,456.1')] ).
cnf(4502,plain,
~ equal(nil,sk2),
inference(mrr,[status(thm)],[4499,557]),
[iquote('0:MRR:4499.1,557.0')] ).
cnf(4508,plain,
~ equal(nil,sk1),
inference(mrr,[status(thm)],[203,4502]),
[iquote('0:MRR:203.1,4502.0')] ).
cnf(7019,plain,
( ~ ssList(sk1)
| ~ ssList(nil)
| equal(nil,sk1) ),
inference(res,[status(thm),theory(equality)],[113,4490]),
[iquote('0:Res:113.3,4490.0')] ).
cnf(7020,plain,
equal(nil,sk1),
inference(ssi,[status(thm)],[7019,21,20,19,18,17,16,15,14,199,1]),
[iquote('0:SSi:7019.1,7019.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,199.0,1.0')] ).
cnf(7021,plain,
$false,
inference(mrr,[status(thm)],[7020,4508]),
[iquote('0:MRR:7020.0,4508.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC024-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n007.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 15:38:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.73/2.98
% 2.73/2.98 SPASS V 3.9
% 2.73/2.98 SPASS beiseite: Proof found.
% 2.73/2.98 % SZS status Theorem
% 2.73/2.98 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/2.98 SPASS derived 4874 clauses, backtracked 3487 clauses, performed 102 splits and kept 6505 clauses.
% 2.73/2.98 SPASS allocated 80525 KBytes.
% 2.73/2.98 SPASS spent 0:00:02.53 on the problem.
% 2.73/2.98 0:00:00.04 for the input.
% 2.73/2.98 0:00:00.00 for the FLOTTER CNF translation.
% 2.73/2.98 0:00:00.03 for inferences.
% 2.73/2.98 0:00:00.06 for the backtracking.
% 2.73/2.98 0:00:02.20 for the reduction.
% 2.73/2.98
% 2.73/2.98
% 2.73/2.98 Here is a proof with depth 2, length 44 :
% 2.73/2.98 % SZS output start Refutation
% See solution above
% 2.73/2.98 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_13 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause61 clause83 clause100 clause118 clause137
% 2.73/2.98
%------------------------------------------------------------------------------