%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG194+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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 : Thu Jul 14 18:02:53 EDT 2022
% Result : Theorem 0.51s 0.67s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 40 ( 18 unt; 3 nHn; 40 RR)
% Number of literals : 94 ( 0 equ; 49 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(22,axiom,
( ~ skC0
| equal(op(e0,e0),e0) ),
file('ALG194+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ skC0
| equal(op(e1,e1),e1) ),
file('ALG194+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ skC0
| equal(op(e2,e2),e2) ),
file('ALG194+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ skC0
| equal(op(e3,e3),e3) ),
file('ALG194+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ skC0
| equal(op(e4,e4),e4) ),
file('ALG194+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ skC0
| equal(op(e5,e5),e5) ),
file('ALG194+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ skC0
| equal(op(e6,e6),e6) ),
file('ALG194+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ equal(op(e0,e0),e0)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ equal(op(e1,e1),e1)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ equal(op(e2,e2),e2)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ equal(op(e3,e3),e3)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ equal(op(e4,e4),e4)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ equal(op(e5,e5),e5)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ equal(op(e6,e6),e6)
| skC0 ),
file('ALG194+1.p',unknown),
[] ).
cnf(525,axiom,
( equal(op(e0,e0),e0)
| equal(op(e0,e0),e6)
| equal(op(e0,e0),e5)
| equal(op(e0,e0),e4)
| equal(op(e0,e0),e3)
| equal(op(e0,e0),e2)
| equal(op(e0,e0),e1) ),
file('ALG194+1.p',unknown),
[] ).
cnf(526,axiom,
( equal(op(e6,e6),e6)
| equal(op(e5,e5),e5)
| equal(op(e4,e4),e4)
| equal(op(e3,e3),e3)
| equal(op(e2,e2),e2)
| equal(op(e1,e1),e1)
| equal(op(e0,e0),e0) ),
file('ALG194+1.p',unknown),
[] ).
cnf(527,axiom,
( ~ equal(op(e6,e6),e6)
| ~ equal(op(e5,e5),e5)
| ~ equal(op(e4,e4),e4)
| ~ equal(op(e3,e3),e3)
| ~ equal(op(e2,e2),e2)
| ~ equal(op(e1,e1),e1)
| ~ equal(op(e0,e0),e0) ),
file('ALG194+1.p',unknown),
[] ).
cnf(528,plain,
equal(op(e0,e0),e0),
inference(spt,[spt(split,[position(s1)])],[525]),
[iquote('1:Spt:525.0')] ).
cnf(529,plain,
( ~ equal(op(e6,e6),e6)
| ~ equal(op(e5,e5),e5)
| ~ equal(op(e4,e4),e4)
| ~ equal(op(e3,e3),e3)
| ~ equal(op(e2,e2),e2)
| ~ equal(op(e1,e1),e1)
| ~ equal(e0,e0) ),
inference(rew,[status(thm),theory(equality)],[528,527]),
[iquote('1:Rew:528.0,527.6')] ).
cnf(530,plain,
( ~ equal(e0,e0)
| skC0 ),
inference(rew,[status(thm),theory(equality)],[528,29]),
[iquote('1:Rew:528.0,29.0')] ).
cnf(556,plain,
skC0,
inference(obv,[status(thm),theory(equality)],[530]),
[iquote('1:Obv:530.0')] ).
cnf(557,plain,
equal(op(e6,e6),e6),
inference(mrr,[status(thm)],[28,556]),
[iquote('1:MRR:28.0,556.0')] ).
cnf(558,plain,
equal(op(e5,e5),e5),
inference(mrr,[status(thm)],[27,556]),
[iquote('1:MRR:27.0,556.0')] ).
cnf(559,plain,
equal(op(e4,e4),e4),
inference(mrr,[status(thm)],[26,556]),
[iquote('1:MRR:26.0,556.0')] ).
cnf(560,plain,
equal(op(e3,e3),e3),
inference(mrr,[status(thm)],[25,556]),
[iquote('1:MRR:25.0,556.0')] ).
cnf(561,plain,
equal(op(e2,e2),e2),
inference(mrr,[status(thm)],[24,556]),
[iquote('1:MRR:24.0,556.0')] ).
cnf(562,plain,
equal(op(e1,e1),e1),
inference(mrr,[status(thm)],[23,556]),
[iquote('1:MRR:23.0,556.0')] ).
cnf(888,plain,
( ~ equal(op(e6,e6),e6)
| ~ equal(op(e5,e5),e5)
| ~ equal(op(e4,e4),e4)
| ~ equal(op(e3,e3),e3)
| ~ equal(op(e2,e2),e2)
| ~ equal(op(e1,e1),e1) ),
inference(obv,[status(thm),theory(equality)],[529]),
[iquote('1:Obv:529.6')] ).
cnf(889,plain,
( ~ equal(e6,e6)
| ~ equal(e5,e5)
| ~ equal(e4,e4)
| ~ equal(e3,e3)
| ~ equal(e2,e2)
| ~ equal(e1,e1) ),
inference(rew,[status(thm),theory(equality)],[562,888,561,560,559,558,557]),
[iquote('1:Rew:562.0,888.5,561.0,888.4,560.0,888.3,559.0,888.2,558.0,888.1,557.0,888.0')] ).
cnf(890,plain,
$false,
inference(obv,[status(thm),theory(equality)],[889]),
[iquote('1:Obv:889.5')] ).
cnf(891,plain,
~ equal(op(e0,e0),e0),
inference(spt,[spt(split,[position(sa)])],[890,528]),
[iquote('1:Spt:890.0,525.0,528.0')] ).
cnf(892,plain,
( equal(op(e0,e0),e6)
| equal(op(e0,e0),e5)
| equal(op(e0,e0),e4)
| equal(op(e0,e0),e3)
| equal(op(e0,e0),e2)
| equal(op(e0,e0),e1) ),
inference(spt,[spt(split,[position(s2)])],[525]),
[iquote('1:Spt:890.0,525.1,525.2,525.3,525.4,525.5,525.6')] ).
cnf(893,plain,
~ skC0,
inference(mrr,[status(thm)],[22,891]),
[iquote('1:MRR:22.1,891.0')] ).
cnf(894,plain,
~ equal(op(e6,e6),e6),
inference(mrr,[status(thm)],[35,893]),
[iquote('1:MRR:35.1,893.0')] ).
cnf(895,plain,
~ equal(op(e5,e5),e5),
inference(mrr,[status(thm)],[34,893]),
[iquote('1:MRR:34.1,893.0')] ).
cnf(896,plain,
~ equal(op(e4,e4),e4),
inference(mrr,[status(thm)],[33,893]),
[iquote('1:MRR:33.1,893.0')] ).
cnf(897,plain,
~ equal(op(e3,e3),e3),
inference(mrr,[status(thm)],[32,893]),
[iquote('1:MRR:32.1,893.0')] ).
cnf(898,plain,
~ equal(op(e2,e2),e2),
inference(mrr,[status(thm)],[31,893]),
[iquote('1:MRR:31.1,893.0')] ).
cnf(899,plain,
~ equal(op(e1,e1),e1),
inference(mrr,[status(thm)],[30,893]),
[iquote('1:MRR:30.1,893.0')] ).
cnf(920,plain,
$false,
inference(mrr,[status(thm)],[526,894,895,896,897,898,899,891]),
[iquote('1:MRR:526.0,526.1,526.2,526.3,526.4,526.5,526.6,894.0,895.0,896.0,897.0,898.0,899.0,891.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : ALG194+1 : TPTP v8.1.0. Released v2.7.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 8 03:35:34 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.51/0.67
% 0.51/0.67 SPASS V 3.9
% 0.51/0.67 SPASS beiseite: Proof found.
% 0.51/0.67 % SZS status Theorem
% 0.51/0.67 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.67 SPASS derived 226 clauses, backtracked 255 clauses, performed 1 splits and kept 993 clauses.
% 0.51/0.67 SPASS allocated 86734 KBytes.
% 0.51/0.67 SPASS spent 0:00:00.34 on the problem.
% 0.51/0.67 0:00:00.04 for the input.
% 0.51/0.67 0:00:00.08 for the FLOTTER CNF translation.
% 0.51/0.67 0:00:00.00 for inferences.
% 0.51/0.67 0:00:00.00 for the backtracking.
% 0.51/0.67 0:00:00.16 for the reduction.
% 0.51/0.67
% 0.51/0.67
% 0.51/0.67 Here is a proof with depth 1, length 40 :
% 0.51/0.67 % SZS output start Refutation
% See solution above
% 0.51/0.67 Formulae used in the proof : co1 ax1
% 0.51/0.67
%------------------------------------------------------------------------------