TSTP Solution File: LCL447-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL447-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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 : Sun Jul 17 14:37:04 EDT 2022
% Result : Unsatisfiable 0.77s 0.98s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(u,c_PropLog_Opl_Oop_A_N_62(v,u,w),w),c_PropLog_Othms(x,w),tc_PropLog_Opl(w)),
file('LCL447-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(u,c_PropLog_Othms(v,w),tc_PropLog_Opl(w))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(u,x,w),c_PropLog_Othms(v,w),tc_PropLog_Opl(w))
| c_in(x,c_PropLog_Othms(v,w),tc_PropLog_Opl(w)) ),
file('LCL447-1.p',unknown),
[] ).
cnf(3,axiom,
c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('LCL447-1.p',unknown),
[] ).
cnf(4,axiom,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('LCL447-1.p',unknown),
[] ).
cnf(1389,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_q,u,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
| c_in(u,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
inference(res,[status(thm),theory(equality)],[3,2]),
[iquote('0:Res:3.0,2.0')] ).
cnf(2697,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(u,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(res,[status(thm),theory(equality)],[1,1389]),
[iquote('0:Res:1.0,1389.0')] ).
cnf(2698,plain,
$false,
inference(unc,[status(thm)],[2697,4]),
[iquote('0:UnC:2697.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL447-1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 20:20:22 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.77/0.98
% 0.77/0.98 SPASS V 3.9
% 0.77/0.98 SPASS beiseite: Proof found.
% 0.77/0.98 % SZS status Theorem
% 0.77/0.98 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.77/0.98 SPASS derived 1122 clauses, backtracked 0 clauses, performed 0 splits and kept 1776 clauses.
% 0.77/0.98 SPASS allocated 79086 KBytes.
% 0.77/0.98 SPASS spent 0:00:00.63 on the problem.
% 0.77/0.98 0:00:00.09 for the input.
% 0.77/0.98 0:00:00.00 for the FLOTTER CNF translation.
% 0.77/0.98 0:00:00.05 for inferences.
% 0.77/0.98 0:00:00.00 for the backtracking.
% 0.77/0.98 0:00:00.26 for the reduction.
% 0.77/0.98
% 0.77/0.98
% 0.77/0.98 Here is a proof with depth 2, length 7 :
% 0.77/0.98 % SZS output start Refutation
% See solution above
% 0.77/0.98 Formulae used in the proof : cls_PropLog_Othms_OK_0 cls_PropLog_Othms_OMP_0 cls_conjecture_0 cls_conjecture_1
% 0.77/0.98
%------------------------------------------------------------------------------