TSTP Solution File: LCL190-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL190-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:16 EDT 2022
% Result : Unsatisfiable 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 17 RR)
% Number of literals : 26 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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(or__dfg(p,or__dfg(q,r)),or__dfg(p,or__dfg(r,q)))),
file('LCL190-3.p',unknown),
[] ).
cnf(4,axiom,
axiom(implies__dfg(or__dfg(u,v),or__dfg(v,u))),
file('LCL190-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies__dfg(implies__dfg(u,v),implies__dfg(or__dfg(w,u),or__dfg(w,v)))),
file('LCL190-3.p',unknown),
[] ).
cnf(7,axiom,
equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
file('LCL190-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL190-3.p',unknown),
[] ).
cnf(9,axiom,
( ~ theorem(u)
| ~ theorem(implies__dfg(u,v))
| theorem(v) ),
file('LCL190-3.p',unknown),
[] ).
cnf(15,plain,
axiom(implies__dfg(or__dfg(u,not__dfg(v)),implies__dfg(v,u))),
inference(spr,[status(thm),theory(equality)],[7,4]),
[iquote('0:SpR:7.0,4.0')] ).
cnf(16,plain,
axiom(implies__dfg(implies__dfg(u,v),or__dfg(v,not__dfg(u)))),
inference(spr,[status(thm),theory(equality)],[7,4]),
[iquote('0:SpR:7.0,4.0')] ).
cnf(19,plain,
( ~ axiom(implies__dfg(u,v))
| ~ theorem(u)
| theorem(v) ),
inference(res,[status(thm),theory(equality)],[8,9]),
[iquote('0:Res:8.1,9.1')] ).
cnf(20,plain,
( ~ theorem(implies__dfg(u,v))
| theorem(or__dfg(v,not__dfg(u))) ),
inference(sor,[status(thm)],[19,16]),
[iquote('0:SoR:19.0,16.0')] ).
cnf(23,plain,
( ~ theorem(or__dfg(u,not__dfg(v)))
| theorem(implies__dfg(v,u)) ),
inference(sor,[status(thm)],[19,15]),
[iquote('0:SoR:19.0,15.0')] ).
cnf(43,plain,
( ~ theorem(implies__dfg(u,v))
| theorem(implies__dfg(or__dfg(w,u),or__dfg(w,v))) ),
inference(sor,[status(thm)],[19,6]),
[iquote('0:SoR:19.0,6.0')] ).
cnf(76,plain,
( ~ axiom(implies__dfg(u,v))
| theorem(or__dfg(v,not__dfg(u))) ),
inference(sor,[status(thm)],[20,8]),
[iquote('0:SoR:20.0,8.1')] ).
cnf(91,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(or__dfg(v,u)))),
inference(sor,[status(thm)],[76,4]),
[iquote('0:SoR:76.0,4.0')] ).
cnf(127,plain,
theorem(implies__dfg(or__dfg(u,v),or__dfg(v,u))),
inference(sor,[status(thm)],[23,91]),
[iquote('0:SoR:23.0,91.0')] ).
cnf(153,plain,
theorem(implies__dfg(or__dfg(u,or__dfg(v,w)),or__dfg(u,or__dfg(w,v)))),
inference(sor,[status(thm)],[43,127]),
[iquote('0:SoR:43.0,127.0')] ).
cnf(160,plain,
$false,
inference(unc,[status(thm)],[153,1]),
[iquote('0:UnC:153.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL190-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n029.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 : Sun Jul 3 18:45:11 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 130 clauses, backtracked 0 clauses, performed 0 splits and kept 92 clauses.
% 0.21/0.44 SPASS allocated 75823 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.07 on the problem.
% 0.21/0.44 0:00:00.03 for the input.
% 0.21/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.01 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 6, length 17 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : prove_this axiom_1_4 axiom_1_6 implies_definition rule_1 rule_2
% 0.21/0.44
%------------------------------------------------------------------------------