TSTP Solution File: ALG175+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG175+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:48 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 9 RR)
% Number of literals : 9 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ equal(e1,e0),
file('ALG175+1.p',unknown),
[] ).
cnf(11,axiom,
equal(op(e3,e1),e4),
file('ALG175+1.p',unknown),
[] ).
cnf(33,axiom,
equal(op(e4,op(e4,e1)),e1),
file('ALG175+1.p',unknown),
[] ).
cnf(53,axiom,
equal(op(op(e3,e1),e1),e3),
file('ALG175+1.p',unknown),
[] ).
cnf(62,axiom,
equal(op(op(e3,e1),e3),e0),
file('ALG175+1.p',unknown),
[] ).
cnf(264,plain,
equal(op(e4,e3),e0),
inference(rew,[status(thm),theory(equality)],[11,62]),
[iquote('0:Rew:11.0,62.0')] ).
cnf(266,plain,
equal(op(e4,e1),e3),
inference(rew,[status(thm),theory(equality)],[11,53]),
[iquote('0:Rew:11.0,53.0')] ).
cnf(272,plain,
equal(e1,e0),
inference(rew,[status(thm),theory(equality)],[264,33,266]),
[iquote('0:Rew:264.0,33.0,266.0,33.0')] ).
cnf(273,plain,
$false,
inference(mrr,[status(thm)],[272,1]),
[iquote('0:MRR:272.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ALG175+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 20:51:01 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.52
% 0.19/0.52 SPASS V 3.9
% 0.19/0.52 SPASS beiseite: Proof found.
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.52 SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 41 clauses.
% 0.19/0.52 SPASS allocated 85763 KBytes.
% 0.19/0.52 SPASS spent 0:00:00.17 on the problem.
% 0.19/0.52 0:00:00.04 for the input.
% 0.19/0.52 0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.52 0:00:00.00 for inferences.
% 0.19/0.52 0:00:00.00 for the backtracking.
% 0.19/0.52 0:00:00.01 for the reduction.
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Here is a proof with depth 0, length 9 :
% 0.19/0.52 % SZS output start Refutation
% See solution above
% 0.19/0.52 Formulae used in the proof : ax5 ax6 co1
% 0.19/0.52
%------------------------------------------------------------------------------