TSTP Solution File: LCL186-10 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.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 : Sun Jul 17 14:35:13 EDT 2022
% Result : Unsatisfiable 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 13 RR)
% Number of literals : 13 ( 0 equ; 1 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 : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(ifeq(u,u,v,w),v),
file('LCL186-10.p',unknown),
[] ).
cnf(3,axiom,
equal(axiom(or__dfg(not__dfg(u),or__dfg(v,u))),true__dfg),
file('LCL186-10.p',unknown),
[] ).
cnf(4,axiom,
equal(axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),true__dfg),
file('LCL186-10.p',unknown),
[] ).
cnf(7,axiom,
equal(ifeq(axiom(u),true__dfg,theorem(u),true__dfg),true__dfg),
file('LCL186-10.p',unknown),
[] ).
cnf(9,axiom,
equal(ifeq(theorem(or__dfg(not__dfg(u),v)),true__dfg,ifeq(axiom(or__dfg(not__dfg(w),u)),true__dfg,theorem(or__dfg(not__dfg(w),v)),true__dfg),true__dfg),true__dfg),
file('LCL186-10.p',unknown),
[] ).
cnf(10,axiom,
~ equal(theorem(or__dfg(not__dfg(not__dfg(p)),or__dfg(not__dfg(p),q))),true__dfg),
file('LCL186-10.p',unknown),
[] ).
cnf(19,plain,
equal(ifeq(true__dfg,true__dfg,theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),true__dfg),true__dfg),
inference(spr,[status(thm),theory(equality)],[4,7]),
[iquote('0:SpR:4.0,7.0')] ).
cnf(21,plain,
equal(theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),true__dfg),
inference(rew,[status(thm),theory(equality)],[1,19]),
[iquote('0:Rew:1.0,19.0')] ).
cnf(148,plain,
equal(ifeq(theorem(or__dfg(not__dfg(or__dfg(u,v)),w)),true__dfg,ifeq(true__dfg,true__dfg,theorem(or__dfg(not__dfg(v),w)),true__dfg),true__dfg),true__dfg),
inference(spr,[status(thm),theory(equality)],[3,9]),
[iquote('0:SpR:3.0,9.0')] ).
cnf(161,plain,
equal(ifeq(theorem(or__dfg(not__dfg(or__dfg(u,v)),w)),true__dfg,theorem(or__dfg(not__dfg(v),w)),true__dfg),true__dfg),
inference(rew,[status(thm),theory(equality)],[1,148]),
[iquote('0:Rew:1.0,148.0')] ).
cnf(242,plain,
equal(ifeq(true__dfg,true__dfg,theorem(or__dfg(not__dfg(u),or__dfg(u,v))),true__dfg),true__dfg),
inference(spr,[status(thm),theory(equality)],[21,161]),
[iquote('0:SpR:21.0,161.0')] ).
cnf(248,plain,
equal(theorem(or__dfg(not__dfg(u),or__dfg(u,v))),true__dfg),
inference(rew,[status(thm),theory(equality)],[1,242]),
[iquote('0:Rew:1.0,242.0')] ).
cnf(249,plain,
$false,
inference(unc,[status(thm)],[248,10]),
[iquote('0:UnC:248.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 4 03:43:31 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46
% 0.21/0.46 SPASS V 3.9
% 0.21/0.46 SPASS beiseite: Proof found.
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46 SPASS derived 174 clauses, backtracked 0 clauses, performed 0 splits and kept 79 clauses.
% 0.21/0.46 SPASS allocated 63577 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.46 0:00:00.04 for the input.
% 0.21/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.46 0:00:00.00 for inferences.
% 0.21/0.46 0:00:00.00 for the backtracking.
% 0.21/0.46 0:00:00.02 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 2, length 13 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : ifeq_axiom axiom_1_3 axiom_1_4 rule_1 rule_3 prove_this
% 0.21/0.46
%------------------------------------------------------------------------------