TSTP Solution File: SWC254-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC254-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:02:51 EDT 2022
% Result : Unsatisfiable 1.15s 1.37s
% Output : Refutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 9 unt; 2 nHn; 21 RR)
% Number of literals : 36 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC254-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC254-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC254-1.p',unknown),
[] ).
cnf(7,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('SWC254-1.p',unknown),
[] ).
cnf(9,axiom,
( ssItem(sk5)
| neq(sk2,nil) ),
file('SWC254-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('SWC254-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ neq(sk4,nil)
| equal(cons(sk5,nil),sk3) ),
file('SWC254-1.p',unknown),
[] ).
cnf(18,axiom,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
file('SWC254-1.p',unknown),
[] ).
cnf(134,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ~ equal(cons(v,nil),u)
| singletonP(u) ),
file('SWC254-1.p',unknown),
[] ).
cnf(208,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(rew,[status(thm),theory(equality)],[5,14]),
[iquote('0:Rew:5.0,14.0')] ).
cnf(209,plain,
ssItem(sk5),
inference(mrr,[status(thm)],[208,9]),
[iquote('0:MRR:208.0,9.1')] ).
cnf(210,plain,
neq(sk2,nil),
inference(obv,[status(thm),theory(equality)],[7]),
[iquote('0:Obv:7.0')] ).
cnf(211,plain,
( ~ singletonP(sk1)
| ~ neq(sk2,nil) ),
inference(rew,[status(thm),theory(equality)],[5,18]),
[iquote('0:Rew:5.0,18.1')] ).
cnf(212,plain,
~ singletonP(sk1),
inference(mrr,[status(thm)],[211,210]),
[iquote('0:MRR:211.1,210.0')] ).
cnf(213,plain,
( ~ neq(sk2,nil)
| equal(cons(sk5,nil),sk1) ),
inference(rew,[status(thm),theory(equality)],[6,16,5]),
[iquote('0:Rew:6.0,16.1,5.0,16.0')] ).
cnf(214,plain,
equal(cons(sk5,nil),sk1),
inference(mrr,[status(thm)],[213,210]),
[iquote('0:MRR:213.0,210.0')] ).
cnf(522,plain,
( ~ ssItem(u)
| ~ equal(cons(u,nil),sk1)
| singletonP(sk1) ),
inference(res,[status(thm),theory(equality)],[1,134]),
[iquote('0:Res:1.0,134.1')] ).
cnf(563,plain,
( ~ ssItem(u)
| ~ equal(cons(u,nil),sk1) ),
inference(mrr,[status(thm)],[522,212]),
[iquote('0:MRR:522.2,212.0')] ).
cnf(2070,plain,
( ~ ssItem(sk5)
| ~ equal(sk1,sk1) ),
inference(spl,[status(thm),theory(equality)],[214,563]),
[iquote('0:SpL:214.0,563.1')] ).
cnf(2071,plain,
~ ssItem(sk5),
inference(obv,[status(thm),theory(equality)],[2070]),
[iquote('0:Obv:2070.1')] ).
cnf(2072,plain,
$false,
inference(ssi,[status(thm)],[2071,209]),
[iquote('0:SSi:2071.0,209.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWC254-1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Sun Jun 12 15:10:51 EDT 2022
% 0.13/0.36 % CPUTime :
% 1.15/1.37
% 1.15/1.37 SPASS V 3.9
% 1.15/1.37 SPASS beiseite: Proof found.
% 1.15/1.37 % SZS status Theorem
% 1.15/1.37 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.15/1.37 SPASS derived 1645 clauses, backtracked 1331 clauses, performed 30 splits and kept 2785 clauses.
% 1.15/1.37 SPASS allocated 77406 KBytes.
% 1.15/1.37 SPASS spent 0:00:00.99 on the problem.
% 1.15/1.37 0:00:00.04 for the input.
% 1.15/1.37 0:00:00.00 for the FLOTTER CNF translation.
% 1.15/1.37 0:00:00.00 for inferences.
% 1.15/1.37 0:00:00.01 for the backtracking.
% 1.15/1.37 0:00:00.76 for the reduction.
% 1.15/1.37
% 1.15/1.37
% 1.15/1.37 Here is a proof with depth 2, length 21 :
% 1.15/1.37 % SZS output start Refutation
% See solution above
% 1.15/1.37 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_9 co1_14 co1_16 co1_18 clause116
% 1.15/1.37
%------------------------------------------------------------------------------