TSTP Solution File: LCL434-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL434-1 : TPTP v8.1.0. Released v3.2.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 : Sun Jul 17 14:36:56 EDT 2022
% Result : Unsatisfiable 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 11 unt; 2 nHn; 15 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(u,u,v),c_PropLog_Othms(w,v),tc_PropLog_Opl(v)),
file('LCL434-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ c_in(u,c_PropLog_Othms(v,w),tc_PropLog_Opl(w))
| c_in(c_PropLog_Opl_Oop_A_N_62(x,u,w),c_PropLog_Othms(v,w),tc_PropLog_Opl(w)) ),
file('LCL434-1.p',unknown),
[] ).
cnf(7,axiom,
c_in(v_pa,c_insert(v,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
file('LCL434-1.p',unknown),
[] ).
cnf(8,axiom,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('LCL434-1.p',unknown),
[] ).
cnf(18,axiom,
( ~ c_in(u,v,tc_PropLog_Opl(w))
| c_in(u,c_PropLog_Othms(v,w),tc_PropLog_Opl(w)) ),
file('LCL434-1.p',unknown),
[] ).
cnf(195,axiom,
( ~ c_in(u,c_insert(v,w,x),x)
| equal(u,v)
| c_in(u,w,x) ),
file('LCL434-1.p',unknown),
[] ).
cnf(1392,plain,
( equal(v,v_pa)
| c_in(v_pa,v_H,tc_PropLog_Opl(t_a)) ),
inference(res,[status(thm),theory(equality)],[7,195]),
[iquote('0:Res:7.0,195.0')] ).
cnf(1406,plain,
~ c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(res,[status(thm),theory(equality)],[6,8]),
[iquote('0:Res:6.1,8.0')] ).
cnf(1412,plain,
equal(v,v_pa),
inference(spt,[spt(split,[position(s1)])],[1392]),
[iquote('1:Spt:1392.0')] ).
cnf(1418,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(rew,[status(thm),theory(equality)],[1412,8]),
[iquote('1:Rew:1412.0,8.0')] ).
cnf(1419,plain,
$false,
inference(mrr,[status(thm)],[1418,5]),
[iquote('1:MRR:1418.0,5.0')] ).
cnf(1421,plain,
~ equal(v,v_pa),
inference(spt,[spt(split,[position(sa)])],[1419,1412]),
[iquote('1:Spt:1419.0,1392.0,1412.0')] ).
cnf(1422,plain,
c_in(v_pa,v_H,tc_PropLog_Opl(t_a)),
inference(spt,[spt(split,[position(s2)])],[1392]),
[iquote('1:Spt:1419.0,1392.1')] ).
cnf(1668,plain,
~ c_in(v_pa,v_H,tc_PropLog_Opl(t_a)),
inference(res,[status(thm),theory(equality)],[18,1406]),
[iquote('0:Res:18.1,1406.0')] ).
cnf(1670,plain,
$false,
inference(mrr,[status(thm)],[1668,1422]),
[iquote('1:MRR:1668.0,1422.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL434-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 2 12:59:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.60/0.79
% 0.60/0.79 SPASS V 3.9
% 0.60/0.79 SPASS beiseite: Proof found.
% 0.60/0.79 % SZS status Theorem
% 0.60/0.79 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.79 SPASS derived 226 clauses, backtracked 8 clauses, performed 1 splits and kept 1403 clauses.
% 0.60/0.79 SPASS allocated 78031 KBytes.
% 0.60/0.79 SPASS spent 0:00:00.42 on the problem.
% 0.60/0.79 0:00:00.08 for the input.
% 0.60/0.79 0:00:00.00 for the FLOTTER CNF translation.
% 0.60/0.79 0:00:00.03 for inferences.
% 0.60/0.79 0:00:00.00 for the backtracking.
% 0.60/0.79 0:00:00.10 for the reduction.
% 0.60/0.79
% 0.60/0.79
% 0.60/0.79 Here is a proof with depth 2, length 15 :
% 0.60/0.79 % SZS output start Refutation
% See solution above
% 0.60/0.79 Formulae used in the proof : cls_PropLog_Othms__I_0 cls_PropLog_Oweaken__right_0 cls_conjecture_0 cls_conjecture_1 cls_PropLog_Othms_OH_0 cls_Set_OinsertE_0
% 0.60/0.79
%------------------------------------------------------------------------------