TSTP Solution File: SWC028-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC028-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:12 EDT 2022
% Result : Unsatisfiable 0.69s 0.87s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 42 ( 22 unt; 11 nHn; 42 RR)
% Number of literals : 66 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC028-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC028-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC028-1.p',unknown),
[] ).
cnf(7,axiom,
( equal(nil,sk2)
| equal(nil,sk1) ),
file('SWC028-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ equal(nil,sk1)
| ~ equal(nil,sk2) ),
file('SWC028-1.p',unknown),
[] ).
cnf(11,axiom,
( equal(nil,sk4)
| neq(sk3,nil) ),
file('SWC028-1.p',unknown),
[] ).
cnf(12,axiom,
( equal(nil,sk4)
| rearsegP(sk4,sk3) ),
file('SWC028-1.p',unknown),
[] ).
cnf(14,axiom,
( equal(nil,sk3)
| rearsegP(sk4,sk3) ),
file('SWC028-1.p',unknown),
[] ).
cnf(15,axiom,
equalelemsP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(16,axiom,
duplicatefreeP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(17,axiom,
strictorderedP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(18,axiom,
totalorderedP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(19,axiom,
strictorderP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(20,axiom,
totalorderP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(21,axiom,
cyclefreeP(nil),
file('SWC028-1.p',unknown),
[] ).
cnf(96,axiom,
( ~ ssList(u)
| ~ rearsegP(nil,u)
| equal(nil,u) ),
file('SWC028-1.p',unknown),
[] ).
cnf(129,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ neq(u,v)
| ~ equal(u,v) ),
file('SWC028-1.p',unknown),
[] ).
cnf(202,plain,
( equal(nil,sk1)
| rearsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,14,6]),
[iquote('0:Rew:5.0,14.1,6.0,14.1,6.0,14.0')] ).
cnf(204,plain,
( equal(nil,sk2)
| rearsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,12,6]),
[iquote('0:Rew:5.0,12.1,6.0,12.1,5.0,12.0')] ).
cnf(205,plain,
( equal(sk2,sk1)
| rearsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[204,202]),
[iquote('0:Rew:204.0,202.0')] ).
cnf(206,plain,
( equal(nil,sk2)
| neq(sk1,nil) ),
inference(rew,[status(thm),theory(equality)],[6,11,5]),
[iquote('0:Rew:6.0,11.1,5.0,11.0')] ).
cnf(208,plain,
( equal(nil,sk2)
| neq(sk1,sk1) ),
inference(rew,[status(thm),theory(equality)],[7,206]),
[iquote('0:Rew:7.1,206.1')] ).
cnf(209,plain,
( equal(nil,sk1)
| rearsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[205,204]),
[iquote('0:Rew:205.0,204.0')] ).
cnf(441,plain,
( ~ ssList(u)
| ~ neq(u,sk1)
| ~ equal(u,sk1) ),
inference(res,[status(thm),theory(equality)],[1,129]),
[iquote('0:Res:1.0,129.0')] ).
cnf(456,plain,
( ~ rearsegP(nil,sk1)
| equal(nil,sk1) ),
inference(res,[status(thm),theory(equality)],[1,96]),
[iquote('0:Res:1.0,96.0')] ).
cnf(560,plain,
( ~ rearsegP(sk2,sk1)
| equal(nil,sk1) ),
inference(rew,[status(thm),theory(equality)],[7,456]),
[iquote('0:Rew:7.0,456.0')] ).
cnf(561,plain,
equal(nil,sk1),
inference(mrr,[status(thm)],[560,209]),
[iquote('0:MRR:560.0,209.1')] ).
cnf(563,plain,
cyclefreeP(sk1),
inference(rew,[status(thm),theory(equality)],[561,21]),
[iquote('0:Rew:561.0,21.0')] ).
cnf(564,plain,
totalorderP(sk1),
inference(rew,[status(thm),theory(equality)],[561,20]),
[iquote('0:Rew:561.0,20.0')] ).
cnf(565,plain,
strictorderP(sk1),
inference(rew,[status(thm),theory(equality)],[561,19]),
[iquote('0:Rew:561.0,19.0')] ).
cnf(566,plain,
totalorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[561,18]),
[iquote('0:Rew:561.0,18.0')] ).
cnf(567,plain,
strictorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[561,17]),
[iquote('0:Rew:561.0,17.0')] ).
cnf(568,plain,
duplicatefreeP(sk1),
inference(rew,[status(thm),theory(equality)],[561,16]),
[iquote('0:Rew:561.0,16.0')] ).
cnf(569,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[561,15]),
[iquote('0:Rew:561.0,15.0')] ).
cnf(582,plain,
( ~ equal(nil,sk1)
| ~ equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[561,10]),
[iquote('0:Rew:561.0,10.1')] ).
cnf(583,plain,
( equal(sk2,sk1)
| neq(sk1,sk1) ),
inference(rew,[status(thm),theory(equality)],[561,208]),
[iquote('0:Rew:561.0,208.0')] ).
cnf(642,plain,
( ~ equal(sk1,sk1)
| ~ equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[561,582]),
[iquote('0:Rew:561.0,582.0')] ).
cnf(643,plain,
~ equal(sk2,sk1),
inference(obv,[status(thm),theory(equality)],[642]),
[iquote('0:Obv:642.0')] ).
cnf(646,plain,
neq(sk1,sk1),
inference(mrr,[status(thm)],[583,643]),
[iquote('0:MRR:583.0,643.0')] ).
cnf(1271,plain,
( ~ ssList(sk1)
| ~ equal(sk1,sk1) ),
inference(res,[status(thm),theory(equality)],[646,441]),
[iquote('0:Res:646.0,441.1')] ).
cnf(1275,plain,
~ ssList(sk1),
inference(obv,[status(thm),theory(equality)],[1271]),
[iquote('0:Obv:1271.1')] ).
cnf(1276,plain,
$false,
inference(ssi,[status(thm)],[1275,569,568,565,564,563,567,566,1]),
[iquote('0:SSi:1275.0,569.0,568.0,565.0,564.0,563.0,567.0,566.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC028-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n016.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 07:04:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/0.87
% 0.69/0.87 SPASS V 3.9
% 0.69/0.87 SPASS beiseite: Proof found.
% 0.69/0.87 % SZS status Theorem
% 0.69/0.87 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.87 SPASS derived 937 clauses, backtracked 431 clauses, performed 17 splits and kept 1337 clauses.
% 0.69/0.87 SPASS allocated 76988 KBytes.
% 0.69/0.87 SPASS spent 0:00:00.52 on the problem.
% 0.69/0.87 0:00:00.04 for the input.
% 0.69/0.87 0:00:00.00 for the FLOTTER CNF translation.
% 0.69/0.87 0:00:00.00 for inferences.
% 0.69/0.87 0:00:00.01 for the backtracking.
% 0.69/0.87 0:00:00.31 for the reduction.
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87 Here is a proof with depth 2, length 42 :
% 0.69/0.87 % SZS output start Refutation
% See solution above
% 0.69/0.87 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_10 co1_11 co1_12 co1_14 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause82 clause115
% 0.69/0.87
%------------------------------------------------------------------------------