TSTP Solution File: SCT139+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SCT139+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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 : Mon Jul 18 22:13:40 EDT 2022
% Result : Theorem 5.92s 6.07s
% Output : Refutation 5.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(63,axiom,
~ equal(hAPP(hAPP(c_List_Olist_OCons(u),v),w),w),
file('SCT139+1.p',unknown),
[] ).
cnf(271,axiom,
equal(hAPP(hAPP(hAPP(c_COMBC(u,v,w),x),y),z),hAPP(hAPP(x,z),y)),
file('SCT139+1.p',unknown),
[] ).
cnf(324,axiom,
equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),x),y),z),hAPP(hAPP(x,z),hAPP(y,z))),
file('SCT139+1.p',unknown),
[] ).
cnf(6048,plain,
equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),hAPP(c_COMBC(x,y,z),x1)),x2),x3),hAPP(hAPP(x1,hAPP(x2,x3)),x3)),
inference(spr,[status(thm),theory(equality)],[324,271]),
[iquote('0:SpR:324.0,271.0')] ).
cnf(6115,plain,
~ equal(hAPP(hAPP(hAPP(c_COMBS(u,v,w),c_List_Olist_OCons(x)),y),z),hAPP(y,z)),
inference(spl,[status(thm),theory(equality)],[324,63]),
[iquote('0:SpL:324.0,63.0')] ).
cnf(6149,plain,
$false,
inference(unc,[status(thm)],[6048,6115]),
[iquote('0:UnC:6048.0,6115.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SCT139+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n021.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 : Sat Jul 2 03:25:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 5.92/6.07
% 5.92/6.07 SPASS V 3.9
% 5.92/6.07 SPASS beiseite: Proof found.
% 5.92/6.07 % SZS status Theorem
% 5.92/6.07 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.92/6.07 SPASS derived 4710 clauses, backtracked 0 clauses, performed 1 splits and kept 2462 clauses.
% 5.92/6.07 SPASS allocated 124779 KBytes.
% 5.92/6.07 SPASS spent 0:00:05.62 on the problem.
% 5.92/6.07 0:00:00.05 for the input.
% 5.92/6.07 0:00:03.49 for the FLOTTER CNF translation.
% 5.92/6.07 0:00:00.11 for inferences.
% 5.92/6.07 0:00:00.00 for the backtracking.
% 5.92/6.07 0:00:01.76 for the reduction.
% 5.92/6.07
% 5.92/6.07
% 5.92/6.07 Here is a proof with depth 1, length 6 :
% 5.92/6.07 % SZS output start Refutation
% See solution above
% 5.92/6.07 Formulae used in the proof : fact_not__Cons__self help_c__COMBC__1 help_c__COMBS__1
% 5.92/6.07
%------------------------------------------------------------------------------