TSTP Solution File: SWC037-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC037-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:16 EDT 2022
% Result : Unsatisfiable 0.69s 0.88s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 39 ( 27 unt; 6 nHn; 39 RR)
% Number of literals : 56 ( 0 equ; 17 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 : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
ssList(sk2),
file('SWC037-1.p',unknown),
[] ).
cnf(5,axiom,
equal(nil,sk2),
file('SWC037-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk4,sk2),
file('SWC037-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk3,sk1),
file('SWC037-1.p',unknown),
[] ).
cnf(8,axiom,
~ equal(nil,sk1),
file('SWC037-1.p',unknown),
[] ).
cnf(10,axiom,
( ssList(sk5)
| equal(nil,sk3) ),
file('SWC037-1.p',unknown),
[] ).
cnf(14,axiom,
( neq(sk5,nil)
| equal(nil,sk3) ),
file('SWC037-1.p',unknown),
[] ).
cnf(15,axiom,
( segmentP(sk4,sk5)
| equal(nil,sk3) ),
file('SWC037-1.p',unknown),
[] ).
cnf(17,axiom,
equalelemsP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(18,axiom,
duplicatefreeP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(19,axiom,
strictorderedP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(20,axiom,
totalorderedP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(21,axiom,
strictorderP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(22,axiom,
totalorderP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(23,axiom,
cyclefreeP(nil),
file('SWC037-1.p',unknown),
[] ).
cnf(96,axiom,
( ~ ssList(u)
| ~ segmentP(nil,u)
| equal(nil,u) ),
file('SWC037-1.p',unknown),
[] ).
cnf(131,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ neq(u,v)
| ~ equal(u,v) ),
file('SWC037-1.p',unknown),
[] ).
cnf(205,plain,
cyclefreeP(sk2),
inference(rew,[status(thm),theory(equality)],[5,23]),
[iquote('0:Rew:5.0,23.0')] ).
cnf(206,plain,
totalorderP(sk2),
inference(rew,[status(thm),theory(equality)],[5,22]),
[iquote('0:Rew:5.0,22.0')] ).
cnf(207,plain,
strictorderP(sk2),
inference(rew,[status(thm),theory(equality)],[5,21]),
[iquote('0:Rew:5.0,21.0')] ).
cnf(208,plain,
totalorderedP(sk2),
inference(rew,[status(thm),theory(equality)],[5,20]),
[iquote('0:Rew:5.0,20.0')] ).
cnf(209,plain,
strictorderedP(sk2),
inference(rew,[status(thm),theory(equality)],[5,19]),
[iquote('0:Rew:5.0,19.0')] ).
cnf(210,plain,
duplicatefreeP(sk2),
inference(rew,[status(thm),theory(equality)],[5,18]),
[iquote('0:Rew:5.0,18.0')] ).
cnf(211,plain,
equalelemsP(sk2),
inference(rew,[status(thm),theory(equality)],[5,17]),
[iquote('0:Rew:5.0,17.0')] ).
cnf(213,plain,
~ equal(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[5,8]),
[iquote('0:Rew:5.0,8.0')] ).
cnf(214,plain,
( ssList(sk5)
| equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,10,7]),
[iquote('0:Rew:5.0,10.1,7.0,10.1')] ).
cnf(215,plain,
ssList(sk5),
inference(mrr,[status(thm)],[214,213]),
[iquote('0:MRR:214.1,213.0')] ).
cnf(221,plain,
( segmentP(sk2,sk5)
| equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,15,7,6]),
[iquote('0:Rew:5.0,15.1,7.0,15.1,6.0,15.0')] ).
cnf(222,plain,
segmentP(sk2,sk5),
inference(mrr,[status(thm)],[221,213]),
[iquote('0:MRR:221.1,213.0')] ).
cnf(223,plain,
( neq(sk5,sk2)
| equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,14,7]),
[iquote('0:Rew:5.0,14.1,7.0,14.1,5.0,14.0')] ).
cnf(224,plain,
neq(sk5,sk2),
inference(mrr,[status(thm)],[223,213]),
[iquote('0:MRR:223.1,213.0')] ).
cnf(246,plain,
( ~ ssList(u)
| ~ segmentP(sk2,u)
| equal(sk2,u) ),
inference(rew,[status(thm),theory(equality)],[5,96]),
[iquote('0:Rew:5.0,96.2,5.0,96.1')] ).
cnf(401,plain,
( ~ ssList(u)
| ~ neq(sk2,u)
| ~ equal(sk2,u) ),
inference(res,[status(thm),theory(equality)],[2,131]),
[iquote('0:Res:2.0,131.1')] ).
cnf(993,plain,
( ~ ssList(sk5)
| equal(sk5,sk2) ),
inference(res,[status(thm),theory(equality)],[222,246]),
[iquote('0:Res:222.0,246.1')] ).
cnf(997,plain,
equal(sk5,sk2),
inference(ssi,[status(thm)],[993,215]),
[iquote('0:SSi:993.0,215.0')] ).
cnf(1001,plain,
neq(sk2,sk2),
inference(rew,[status(thm),theory(equality)],[997,224]),
[iquote('0:Rew:997.0,224.0')] ).
cnf(1296,plain,
( ~ ssList(sk2)
| ~ equal(sk2,sk2) ),
inference(res,[status(thm),theory(equality)],[1001,401]),
[iquote('0:Res:1001.0,401.1')] ).
cnf(1300,plain,
~ ssList(sk2),
inference(obv,[status(thm),theory(equality)],[1296]),
[iquote('0:Obv:1296.1')] ).
cnf(1301,plain,
$false,
inference(ssi,[status(thm)],[1300,211,210,205,206,207,208,209,2]),
[iquote('0:SSi:1300.0,211.0,210.0,205.0,206.0,207.0,208.0,209.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC037-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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 23:56:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.88
% 0.69/0.88 SPASS V 3.9
% 0.69/0.88 SPASS beiseite: Proof found.
% 0.69/0.88 % SZS status Theorem
% 0.69/0.88 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.88 SPASS derived 946 clauses, backtracked 438 clauses, performed 17 splits and kept 1292 clauses.
% 0.69/0.88 SPASS allocated 76997 KBytes.
% 0.69/0.88 SPASS spent 0:00:00.53 on the problem.
% 0.69/0.88 0:00:00.04 for the input.
% 0.69/0.88 0:00:00.00 for the FLOTTER CNF translation.
% 0.69/0.88 0:00:00.00 for inferences.
% 0.69/0.88 0:00:00.01 for the backtracking.
% 0.69/0.88 0:00:00.33 for the reduction.
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88 Here is a proof with depth 2, length 39 :
% 0.69/0.88 % SZS output start Refutation
% See solution above
% 0.69/0.88 Formulae used in the proof : co1_2 co1_5 co1_6 co1_7 co1_8 co1_10 co1_14 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause80 clause115
% 0.69/0.88
%------------------------------------------------------------------------------