TSTP Solution File: LCL172-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL172-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:04 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 9 unt; 0 nHn; 10 RR)
% Number of literals : 11 ( 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(p,implies__dfg(q,r)),implies__dfg(q,implies__dfg(p,r)))),
file('LCL172-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies__dfg(or__dfg(u,or__dfg(v,w)),or__dfg(v,or__dfg(u,w)))),
file('LCL172-3.p',unknown),
[] ).
cnf(7,axiom,
equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
file('LCL172-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL172-3.p',unknown),
[] ).
cnf(10,plain,
~ axiom(implies__dfg(implies__dfg(p,implies__dfg(q,r)),implies__dfg(q,implies__dfg(p,r)))),
inference(res,[status(thm),theory(equality)],[8,1]),
[iquote('0:Res:8.1,1.0')] ).
cnf(31,plain,
axiom(implies__dfg(or__dfg(not__dfg(u),or__dfg(v,w)),or__dfg(v,implies__dfg(u,w)))),
inference(spr,[status(thm),theory(equality)],[7,5]),
[iquote('0:SpR:7.0,5.0')] ).
cnf(35,plain,
axiom(implies__dfg(implies__dfg(u,or__dfg(v,w)),or__dfg(v,implies__dfg(u,w)))),
inference(rew,[status(thm),theory(equality)],[7,31]),
[iquote('0:Rew:7.0,31.0')] ).
cnf(62,plain,
axiom(implies__dfg(implies__dfg(u,or__dfg(not__dfg(v),w)),implies__dfg(v,implies__dfg(u,w)))),
inference(spr,[status(thm),theory(equality)],[7,35]),
[iquote('0:SpR:7.0,35.0')] ).
cnf(64,plain,
axiom(implies__dfg(implies__dfg(u,implies__dfg(v,w)),implies__dfg(v,implies__dfg(u,w)))),
inference(rew,[status(thm),theory(equality)],[7,62]),
[iquote('0:Rew:7.0,62.0')] ).
cnf(65,plain,
$false,
inference(unc,[status(thm)],[64,10]),
[iquote('0:UnC:64.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL172-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n006.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 : Sun Jul 3 00:15:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41
% 0.19/0.41 SPASS V 3.9
% 0.19/0.41 SPASS beiseite: Proof found.
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 SPASS derived 47 clauses, backtracked 0 clauses, performed 0 splits and kept 44 clauses.
% 0.19/0.41 SPASS allocated 75699 KBytes.
% 0.19/0.41 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.41 0:00:00.04 for the input.
% 0.19/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41 0:00:00.00 for inferences.
% 0.19/0.41 0:00:00.00 for the backtracking.
% 0.19/0.41 0:00:00.00 for the reduction.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Here is a proof with depth 2, length 10 :
% 0.19/0.41 % SZS output start Refutation
% See solution above
% 0.19/0.41 Formulae used in the proof : prove_this axiom_1_5 implies_definition rule_1
% 0.19/0.41
%------------------------------------------------------------------------------