TSTP Solution File: SWV860-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV860-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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 : Wed Jul 20 21:45:25 EDT 2022
% Result : Unsatisfiable 0.39s 0.56s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(484,axiom,
( ~ c_Natural_Oevaln(c_Com_Ocom_OSKIP,u,v,w)
| equal(w,u) ),
file('SWV860-1.p',unknown),
[] ).
cnf(516,axiom,
hBOOL(hAPP(hAPP(v_P,v_x),v_xa)),
file('SWV860-1.p',unknown),
[] ).
cnf(517,axiom,
c_Natural_Oevaln(c_Com_Ocom_OSKIP,v_xa,v_n,v_xb),
file('SWV860-1.p',unknown),
[] ).
cnf(518,axiom,
~ hBOOL(hAPP(hAPP(v_P,v_x),v_xb)),
file('SWV860-1.p',unknown),
[] ).
cnf(569,plain,
equal(v_xb,v_xa),
inference(res,[status(thm),theory(equality)],[517,484]),
[iquote('0:Res:517.0,484.0')] ).
cnf(648,plain,
~ hBOOL(hAPP(hAPP(v_P,v_x),v_xa)),
inference(rew,[status(thm),theory(equality)],[569,518]),
[iquote('0:Rew:569.0,518.0')] ).
cnf(651,plain,
$false,
inference(mrr,[status(thm)],[648,516]),
[iquote('0:MRR:648.0,516.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV860-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n011.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 16 00:49:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.39/0.56
% 0.39/0.56 SPASS V 3.9
% 0.39/0.56 SPASS beiseite: Proof found.
% 0.39/0.56 % SZS status Theorem
% 0.39/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.56 SPASS derived 74 clauses, backtracked 0 clauses, performed 0 splits and kept 437 clauses.
% 0.39/0.56 SPASS allocated 76774 KBytes.
% 0.39/0.56 SPASS spent 0:00:00.19 on the problem.
% 0.39/0.56 0:00:00.05 for the input.
% 0.39/0.56 0:00:00.00 for the FLOTTER CNF translation.
% 0.39/0.56 0:00:00.00 for inferences.
% 0.39/0.56 0:00:00.00 for the backtracking.
% 0.39/0.56 0:00:00.09 for the reduction.
% 0.39/0.56
% 0.39/0.56
% 0.39/0.56 Here is a proof with depth 1, length 7 :
% 0.39/0.56 % SZS output start Refutation
% See solution above
% 0.39/0.56 Formulae used in the proof : cls_evaln__elim__cases_I1_J_0 cls_conjecture_0 cls_conjecture_1 cls_conjecture_2
% 0.39/0.56
%------------------------------------------------------------------------------