%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG391-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:03:33 EDT 2022
% Result : Unsatisfiable 0.75s 0.96s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 2 unt; 0 nHn; 4 RR)
% Number of literals : 7 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1280,axiom,
~ equal(c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a)),v_cs____),
file('ALG391-1.p',unknown),
[] ).
cnf(1282,axiom,
( ~ equal(c_Polynomial_Odegree(u,t_a),c_Polynomial_Odegree(v_cs____,t_a))
| ~ equal(c_Polynomial_Opoly(v_cs____,hAPP(v_x,u),t_a),c_Polynomial_Opoly(u,hAPP(v_x,u),t_a))
| equal(u,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) ),
file('ALG391-1.p',unknown),
[] ).
cnf(2860,plain,
( ~ equal(c_Polynomial_Opoly(v_cs____,hAPP(v_x,v_cs____),t_a),c_Polynomial_Opoly(v_cs____,hAPP(v_x,v_cs____),t_a))
| ~ equal(c_Polynomial_Odegree(v_cs____,t_a),c_Polynomial_Odegree(v_cs____,t_a)) ),
inference(res,[status(thm),theory(equality)],[1282,1280]),
[iquote('0:Res:1282.2,1280.0')] ).
cnf(2915,plain,
$false,
inference(obv,[status(thm),theory(equality)],[2860]),
[iquote('0:Obv:2860.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ALG391-1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 22:50:26 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.75/0.96
% 0.75/0.96 SPASS V 3.9
% 0.75/0.96 SPASS beiseite: Proof found.
% 0.75/0.96 % SZS status Theorem
% 0.75/0.96 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.75/0.96 SPASS derived 485 clauses, backtracked 0 clauses, performed 0 splits and kept 1446 clauses.
% 0.75/0.96 SPASS allocated 78109 KBytes.
% 0.75/0.96 SPASS spent 0:00:00.60 on the problem.
% 0.75/0.96 0:00:00.10 for the input.
% 0.75/0.96 0:00:00.00 for the FLOTTER CNF translation.
% 0.75/0.96 0:00:00.00 for inferences.
% 0.75/0.96 0:00:00.00 for the backtracking.
% 0.75/0.96 0:00:00.24 for the reduction.
% 0.75/0.96
% 0.75/0.96
% 0.75/0.96 Here is a proof with depth 1, length 4 :
% 0.75/0.96 % SZS output start Refutation
% See solution above
% 0.75/0.96 Formulae used in the proof : cls_conjecture_0 cls_conjecture_2
% 0.75/0.96
%------------------------------------------------------------------------------