TSTP Solution File: SWC096-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC096-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:41 EDT 2022
% Result : Unsatisfiable 4.92s 5.10s
% Output : Refutation 4.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 9 unt; 3 nHn; 28 RR)
% Number of literals : 60 ( 0 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
equal(sk4,sk2),
file('SWC096-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC096-1.p',unknown),
[] ).
cnf(7,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('SWC096-1.p',unknown),
[] ).
cnf(10,axiom,
( ssItem(sk5)
| neq(sk2,nil) ),
file('SWC096-1.p',unknown),
[] ).
cnf(11,axiom,
( ssList(sk6)
| neq(sk2,nil) ),
file('SWC096-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ~ equal(cons(u,nil),sk1)
| ~ equal(app(v,cons(u,nil)),sk2)
| ~ neq(sk4,nil) ),
file('SWC096-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('SWC096-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('SWC096-1.p',unknown),
[] ).
cnf(17,axiom,
( ~ neq(sk4,nil)
| equal(cons(sk5,nil),sk3) ),
file('SWC096-1.p',unknown),
[] ).
cnf(18,axiom,
( ~ neq(sk4,nil)
| equal(app(sk6,cons(sk5,nil)),sk4) ),
file('SWC096-1.p',unknown),
[] ).
cnf(206,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(rew,[status(thm),theory(equality)],[5,16]),
[iquote('0:Rew:5.0,16.0')] ).
cnf(207,plain,
ssList(sk6),
inference(mrr,[status(thm)],[206,11]),
[iquote('0:MRR:206.0,11.1')] ).
cnf(208,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(rew,[status(thm),theory(equality)],[5,15]),
[iquote('0:Rew:5.0,15.0')] ).
cnf(209,plain,
ssItem(sk5),
inference(mrr,[status(thm)],[208,10]),
[iquote('0:MRR:208.0,10.1')] ).
cnf(210,plain,
neq(sk2,nil),
inference(obv,[status(thm),theory(equality)],[7]),
[iquote('0:Obv:7.0')] ).
cnf(211,plain,
( ~ neq(sk2,nil)
| equal(cons(sk5,nil),sk1) ),
inference(rew,[status(thm),theory(equality)],[6,17,5]),
[iquote('0:Rew:6.0,17.1,5.0,17.0')] ).
cnf(212,plain,
equal(cons(sk5,nil),sk1),
inference(mrr,[status(thm)],[211,210]),
[iquote('0:MRR:211.0,210.0')] ).
cnf(213,plain,
( ~ neq(sk2,nil)
| equal(app(sk6,sk1),sk2) ),
inference(rew,[status(thm),theory(equality)],[212,18,5]),
[iquote('0:Rew:212.0,18.1,5.0,18.1,5.0,18.0')] ).
cnf(214,plain,
equal(app(sk6,sk1),sk2),
inference(mrr,[status(thm)],[213,210]),
[iquote('0:MRR:213.0,210.0')] ).
cnf(219,plain,
( ~ ssItem(u)
| ~ ssList(v)
| ~ equal(cons(u,nil),sk1)
| ~ equal(app(v,cons(u,nil)),sk2)
| ~ neq(sk2,nil) ),
inference(rew,[status(thm),theory(equality)],[5,14]),
[iquote('0:Rew:5.0,14.4')] ).
cnf(220,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ equal(cons(v,nil),sk1)
| ~ equal(app(u,cons(v,nil)),sk2) ),
inference(mrr,[status(thm)],[219,210]),
[iquote('0:MRR:219.4,210.0')] ).
cnf(15835,plain,
( ~ ssList(u)
| ~ ssItem(sk5)
| ~ equal(cons(sk5,nil),sk1)
| ~ equal(app(u,sk1),sk2) ),
inference(spl,[status(thm),theory(equality)],[212,220]),
[iquote('0:SpL:212.0,220.3')] ).
cnf(15844,plain,
( ~ ssList(u)
| ~ ssItem(sk5)
| ~ equal(sk1,sk1)
| ~ equal(app(u,sk1),sk2) ),
inference(rew,[status(thm),theory(equality)],[212,15835]),
[iquote('0:Rew:212.0,15835.2')] ).
cnf(15845,plain,
( ~ ssList(u)
| ~ ssItem(sk5)
| ~ equal(app(u,sk1),sk2) ),
inference(obv,[status(thm),theory(equality)],[15844]),
[iquote('0:Obv:15844.2')] ).
cnf(15846,plain,
( ~ ssList(u)
| ~ equal(app(u,sk1),sk2) ),
inference(ssi,[status(thm)],[15845,209]),
[iquote('0:SSi:15845.1,209.0')] ).
cnf(16742,plain,
( ~ ssList(sk6)
| ~ equal(sk2,sk2) ),
inference(spl,[status(thm),theory(equality)],[214,15846]),
[iquote('0:SpL:214.0,15846.1')] ).
cnf(16746,plain,
~ ssList(sk6),
inference(obv,[status(thm),theory(equality)],[16742]),
[iquote('0:Obv:16742.1')] ).
cnf(16747,plain,
$false,
inference(ssi,[status(thm)],[16746,207]),
[iquote('0:SSi:16746.0,207.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC096-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n016.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 05:51:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.92/5.10
% 4.92/5.10 SPASS V 3.9
% 4.92/5.10 SPASS beiseite: Proof found.
% 4.92/5.10 % SZS status Theorem
% 4.92/5.10 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.92/5.10 SPASS derived 11161 clauses, backtracked 4506 clauses, performed 81 splits and kept 9426 clauses.
% 4.92/5.10 SPASS allocated 86594 KBytes.
% 4.92/5.10 SPASS spent 0:00:04.12 on the problem.
% 4.92/5.10 0:00:00.04 for the input.
% 4.92/5.10 0:00:00.00 for the FLOTTER CNF translation.
% 4.92/5.10 0:00:00.08 for inferences.
% 4.92/5.10 0:00:00.09 for the backtracking.
% 4.92/5.10 0:00:03.69 for the reduction.
% 4.92/5.10
% 4.92/5.10
% 4.92/5.10 Here is a proof with depth 2, length 28 :
% 4.92/5.10 % SZS output start Refutation
% See solution above
% 4.92/5.10 Formulae used in the proof : co1_5 co1_6 co1_7 co1_10 co1_11 co1_14 co1_15 co1_16 co1_17 co1_18
% 4.92/5.10
%------------------------------------------------------------------------------