TSTP Solution File: LCL173-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL173-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:05 EDT 2022
% Result : Unsatisfiable 0.18s 0.41s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 9 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(implies__dfg(implies__dfg(q,r),implies__dfg(implies__dfg(p,q),implies__dfg(p,r)))),
file('LCL173-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies__dfg(implies__dfg(u,v),implies__dfg(or__dfg(w,u),or__dfg(w,v)))),
file('LCL173-3.p',unknown),
[] ).
cnf(7,axiom,
equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
file('LCL173-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL173-3.p',unknown),
[] ).
cnf(10,plain,
~ axiom(implies__dfg(implies__dfg(q,r),implies__dfg(implies__dfg(p,q),implies__dfg(p,r)))),
inference(res,[status(thm),theory(equality)],[8,1]),
[iquote('0:Res:8.1,1.0')] ).
cnf(44,plain,
axiom(implies__dfg(implies__dfg(u,v),implies__dfg(or__dfg(not__dfg(w),u),implies__dfg(w,v)))),
inference(spr,[status(thm),theory(equality)],[7,6]),
[iquote('0:SpR:7.0,6.0')] ).
cnf(46,plain,
axiom(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(w,u),implies__dfg(w,v)))),
inference(rew,[status(thm),theory(equality)],[7,44]),
[iquote('0:Rew:7.0,44.0')] ).
cnf(47,plain,
$false,
inference(unc,[status(thm)],[46,10]),
[iquote('0:UnC:46.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL173-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 16:31:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.41
% 0.18/0.41 SPASS V 3.9
% 0.18/0.41 SPASS beiseite: Proof found.
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.41 SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 32 clauses.
% 0.18/0.41 SPASS allocated 75671 KBytes.
% 0.18/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.41 0:00:00.04 for the input.
% 0.18/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.41 0:00:00.00 for inferences.
% 0.18/0.41 0:00:00.00 for the backtracking.
% 0.18/0.41 0:00:00.00 for the reduction.
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Here is a proof with depth 1, length 8 :
% 0.18/0.41 % SZS output start Refutation
% See solution above
% 0.18/0.41 Formulae used in the proof : prove_this axiom_1_6 implies_definition rule_1
% 0.18/0.41
%------------------------------------------------------------------------------