TSTP Solution File: ALG036+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG036+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:04 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 9 ( 8 unt; 1 nHn; 9 RR)
% Number of literals : 12 ( 0 equ; 5 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ skC0,
file('ALG036+1.p',unknown),
[] ).
cnf(2,axiom,
~ skC1,
file('ALG036+1.p',unknown),
[] ).
cnf(3,axiom,
~ skC2,
file('ALG036+1.p',unknown),
[] ).
cnf(4,axiom,
equal(e0,unit),
file('ALG036+1.p',unknown),
[] ).
cnf(18,axiom,
equal(op(e3,unit),e3),
file('ALG036+1.p',unknown),
[] ).
cnf(22,axiom,
( equal(op(e3,e3),e3)
| skC0
| skC1
| skC2 ),
file('ALG036+1.p',unknown),
[] ).
cnf(67,axiom,
~ equal(op(e3,e3),op(e3,e0)),
file('ALG036+1.p',unknown),
[] ).
cnf(129,plain,
~ equal(op(e3,e3),e3),
inference(rew,[status(thm),theory(equality)],[18,67,4]),
[iquote('0:Rew:18.0,67.0,4.0,67.0')] ).
cnf(159,plain,
$false,
inference(mrr,[status(thm)],[22,129,1,2,3]),
[iquote('0:MRR:22.0,22.1,22.2,22.3,129.0,1.0,2.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ALG036+1 : TPTP v8.1.0. Released v2.7.0.
% 0.08/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 04:23:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 51 clauses.
% 0.20/0.46 SPASS allocated 85415 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 0, length 9 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : co1 ax4 ax2 ax5
% 0.20/0.46
%------------------------------------------------------------------------------