TSTP Solution File: SWV861-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV861-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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.50s 0.70s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 13 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(600,axiom,
hBOOL(hAPP(hAPP(v_P,v_Z),v_s)),
file('SWV861-1.p',unknown),
[] ).
cnf(601,axiom,
c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
file('SWV861-1.p',unknown),
[] ).
cnf(602,axiom,
c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
file('SWV861-1.p',unknown),
[] ).
cnf(603,axiom,
~ hBOOL(hAPP(hAPP(v_R,v_Z),v_s_H)),
file('SWV861-1.p',unknown),
[] ).
cnf(605,axiom,
( ~ hBOOL(hAPP(hAPP(v_P,u),v))
| ~ c_Natural_Oevaln(v_c,v,v_n,w)
| hBOOL(hAPP(hAPP(v_Q,u),w)) ),
file('SWV861-1.p',unknown),
[] ).
cnf(606,axiom,
( ~ hBOOL(hAPP(hAPP(v_Q,u),v))
| ~ c_Natural_Oevaln(v_d,v,v_n,w)
| hBOOL(hAPP(hAPP(v_R,u),w)) ),
file('SWV861-1.p',unknown),
[] ).
cnf(713,plain,
( ~ c_Natural_Oevaln(v_c,v_s,v_n,u)
| hBOOL(hAPP(hAPP(v_Q,v_Z),u)) ),
inference(res,[status(thm),theory(equality)],[600,605]),
[iquote('0:Res:600.0,605.1')] ).
cnf(765,plain,
( ~ hBOOL(hAPP(hAPP(v_Q,v_Z),u))
| ~ c_Natural_Oevaln(v_d,u,v_n,v_s_H) ),
inference(res,[status(thm),theory(equality)],[606,603]),
[iquote('0:Res:606.2,603.0')] ).
cnf(797,plain,
hBOOL(hAPP(hAPP(v_Q,v_Z),v_s1)),
inference(res,[status(thm),theory(equality)],[601,713]),
[iquote('0:Res:601.0,713.0')] ).
cnf(812,plain,
~ hBOOL(hAPP(hAPP(v_Q,v_Z),v_s1)),
inference(res,[status(thm),theory(equality)],[602,765]),
[iquote('0:Res:602.0,765.0')] ).
cnf(841,plain,
$false,
inference(mrr,[status(thm)],[812,797]),
[iquote('0:MRR:812.0,797.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV861-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n017.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 17:49:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.50/0.70
% 0.50/0.70 SPASS V 3.9
% 0.50/0.70 SPASS beiseite: Proof found.
% 0.50/0.70 % SZS status Theorem
% 0.50/0.70 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.50/0.70 SPASS derived 148 clauses, backtracked 0 clauses, performed 0 splits and kept 591 clauses.
% 0.50/0.70 SPASS allocated 77062 KBytes.
% 0.50/0.70 SPASS spent 0:00:00.32 on the problem.
% 0.50/0.70 0:00:00.06 for the input.
% 0.50/0.70 0:00:00.00 for the FLOTTER CNF translation.
% 0.50/0.70 0:00:00.00 for inferences.
% 0.50/0.70 0:00:00.00 for the backtracking.
% 0.50/0.70 0:00:00.14 for the reduction.
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Here is a proof with depth 2, length 11 :
% 0.50/0.70 % SZS output start Refutation
% See solution above
% 0.50/0.70 Formulae used in the proof : cls_conjecture_0 cls_conjecture_1 cls_conjecture_2 cls_conjecture_3 cls_conjecture_5 cls_conjecture_6
% 0.50/0.70
%------------------------------------------------------------------------------