TSTP Solution File: SWC101-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC101-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:43 EDT 2022
% Result : Unsatisfiable 9.28s 9.48s
% Output : Refutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 34 ( 20 unt; 1 nHn; 34 RR)
% Number of literals : 59 ( 0 equ; 32 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('SWC101-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC101-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC101-1.p',unknown),
[] ).
cnf(7,axiom,
ssList(sk5),
file('SWC101-1.p',unknown),
[] ).
cnf(8,axiom,
equal(app(sk3,sk5),sk4),
file('SWC101-1.p',unknown),
[] ).
cnf(9,axiom,
equalelemsP(sk3),
file('SWC101-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ equal(nil,sk3)
| equal(sk4,nil) ),
file('SWC101-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ equal(nil,sk2)
| ~ equal(nil,sk1) ),
file('SWC101-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('SWC101-1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(15,axiom,
duplicatefreeP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(16,axiom,
strictorderedP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(17,axiom,
totalorderedP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(18,axiom,
strictorderP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(19,axiom,
totalorderP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(20,axiom,
cyclefreeP(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(21,axiom,
ssList(nil),
file('SWC101-1.p',unknown),
[] ).
cnf(74,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC101-1.p',unknown),
[] ).
cnf(113,axiom,
( ~ ssList(u)
| ~ ssList(v)
| equal(u,v)
| neq(u,v) ),
file('SWC101-1.p',unknown),
[] ).
cnf(150,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(u,v)
| frontsegP(app(u,w),v) ),
file('SWC101-1.p',unknown),
[] ).
cnf(199,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[6,9]),
[iquote('0:Rew:6.0,9.0')] ).
cnf(202,plain,
equal(app(sk1,sk5),sk2),
inference(rew,[status(thm),theory(equality)],[6,8,5]),
[iquote('0:Rew:6.0,8.0,5.0,8.0')] ).
cnf(203,plain,
( ~ equal(nil,sk1)
| equal(nil,sk2) ),
inference(rew,[status(thm),theory(equality)],[5,11,6]),
[iquote('0:Rew:5.0,11.1,6.0,11.0')] ).
cnf(204,plain,
( ~ equal(sk2,sk2)
| ~ equal(nil,sk1) ),
inference(rew,[status(thm),theory(equality)],[203,12]),
[iquote('0:Rew:203.1,12.0')] ).
cnf(205,plain,
~ equal(nil,sk1),
inference(obv,[status(thm),theory(equality)],[204]),
[iquote('0:Obv:204.0')] ).
cnf(4926,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(10399,plain,
( ~ ssList(u)
| ~ frontsegP(sk1,u)
| frontsegP(sk2,u) ),
inference(ssi,[status(thm)],[4926,7,199,1]),
[iquote('0:SSi:4926.2,4926.0,7.0,199.0,1.0')] ).
cnf(11092,plain,
( ~ ssList(sk1)
| ~ frontsegP(sk1,sk1)
| ~ neq(sk1,nil) ),
inference(res,[status(thm),theory(equality)],[10399,13]),
[iquote('0:Res:10399.2,13.0')] ).
cnf(11093,plain,
( ~ frontsegP(sk1,sk1)
| ~ neq(sk1,nil) ),
inference(ssi,[status(thm)],[11092,199,1]),
[iquote('0:SSi:11092.0,199.0,1.0')] ).
cnf(11098,plain,
( ~ ssList(sk1)
| ~ neq(sk1,nil) ),
inference(res,[status(thm),theory(equality)],[74,11093]),
[iquote('0:Res:74.1,11093.0')] ).
cnf(11099,plain,
~ neq(sk1,nil),
inference(ssi,[status(thm)],[11098,199,1]),
[iquote('0:SSi:11098.0,199.0,1.0')] ).
cnf(14599,plain,
( ~ ssList(sk1)
| ~ ssList(nil)
| equal(nil,sk1) ),
inference(res,[status(thm),theory(equality)],[113,11099]),
[iquote('0:Res:113.3,11099.0')] ).
cnf(14600,plain,
equal(nil,sk1),
inference(ssi,[status(thm)],[14599,14,15,16,17,18,19,20,21,199,1]),
[iquote('0:SSi:14599.1,14599.0,14.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,199.0,1.0')] ).
cnf(14601,plain,
$false,
inference(mrr,[status(thm)],[14600,205]),
[iquote('0:MRR:14600.0,205.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC101-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jun 12 09:52:41 EDT 2022
% 0.15/0.35 % CPUTime :
% 9.28/9.48
% 9.28/9.48 SPASS V 3.9
% 9.28/9.48 SPASS beiseite: Proof found.
% 9.28/9.48 % SZS status Theorem
% 9.28/9.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.28/9.48 SPASS derived 9737 clauses, backtracked 5052 clauses, performed 116 splits and kept 9733 clauses.
% 9.28/9.48 SPASS allocated 86665 KBytes.
% 9.28/9.48 SPASS spent 0:00:08.28 on the problem.
% 9.28/9.48 0:00:00.04 for the input.
% 9.28/9.48 0:00:00.00 for the FLOTTER CNF translation.
% 9.28/9.48 0:00:00.10 for inferences.
% 9.28/9.48 0:00:00.27 for the backtracking.
% 9.28/9.48 0:00:07.63 for the reduction.
% 9.28/9.48
% 9.28/9.48
% 9.28/9.48 Here is a proof with depth 4, length 34 :
% 9.28/9.48 % SZS output start Refutation
% See solution above
% 9.28/9.48 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_11 co1_12 co1_13 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause61 clause100 clause137
% 9.28/9.48
%------------------------------------------------------------------------------