TSTP Solution File: LCL193-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL193-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:18 EDT 2022
% Result : Unsatisfiable 21.69s 21.85s
% Output : Refutation 21.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 15 RR)
% Number of literals : 24 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(or__dfg(not__dfg(or__dfg(not__dfg(q),r)),or__dfg(not__dfg(or__dfg(p,q)),or__dfg(r,p)))),
file('LCL193-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL193-1.p',unknown),
[] ).
cnf(6,axiom,
axiom(or__dfg(not__dfg(or__dfg(not__dfg(u),v)),or__dfg(not__dfg(or__dfg(w,u)),or__dfg(w,v)))),
file('LCL193-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL193-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL193-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ theorem(or__dfg(not__dfg(u),v))
| ~ axiom(or__dfg(not__dfg(w),u))
| theorem(or__dfg(not__dfg(w),v)) ),
file('LCL193-1.p',unknown),
[] ).
cnf(12,plain,
( ~ theorem(or__dfg(not__dfg(u),or__dfg(not__dfg(or__dfg(p,q)),or__dfg(r,p))))
| ~ axiom(or__dfg(not__dfg(or__dfg(not__dfg(q),r)),u)) ),
inference(res,[status(thm),theory(equality)],[9,1]),
[iquote('0:Res:9.2,1.0')] ).
cnf(23,plain,
( ~ theorem(or__dfg(u,v))
| theorem(or__dfg(v,u)) ),
inference(res,[status(thm),theory(equality)],[4,8]),
[iquote('0:Res:4.0,8.1')] ).
cnf(27,plain,
( ~ axiom(or__dfg(u,v))
| theorem(or__dfg(v,u)) ),
inference(sor,[status(thm)],[23,7]),
[iquote('0:SoR:23.0,7.1')] ).
cnf(32,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(or__dfg(v,u)))),
inference(sor,[status(thm)],[27,4]),
[iquote('0:SoR:27.0,4.0')] ).
cnf(39,plain,
( ~ theorem(or__dfg(not__dfg(u),v))
| theorem(or__dfg(not__dfg(or__dfg(w,u)),or__dfg(w,v))) ),
inference(res,[status(thm),theory(equality)],[6,8]),
[iquote('0:Res:6.0,8.1')] ).
cnf(41,plain,
theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
inference(sor,[status(thm)],[23,32]),
[iquote('0:SoR:23.0,32.0')] ).
cnf(87,plain,
theorem(or__dfg(not__dfg(or__dfg(u,or__dfg(v,w))),or__dfg(u,or__dfg(w,v)))),
inference(sor,[status(thm)],[39,41]),
[iquote('0:SoR:39.0,41.0')] ).
cnf(21013,plain,
~ axiom(or__dfg(not__dfg(or__dfg(not__dfg(q),r)),or__dfg(not__dfg(or__dfg(p,q)),or__dfg(p,r)))),
inference(res,[status(thm),theory(equality)],[87,12]),
[iquote('0:Res:87.0,12.0')] ).
cnf(21033,plain,
$false,
inference(mrr,[status(thm)],[21013,6]),
[iquote('0:MRR:21013.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL193-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 10:45:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 21.69/21.85
% 21.69/21.85 SPASS V 3.9
% 21.69/21.85 SPASS beiseite: Proof found.
% 21.69/21.85 % SZS status Theorem
% 21.69/21.85 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.69/21.85 SPASS derived 21008 clauses, backtracked 0 clauses, performed 0 splits and kept 12606 clauses.
% 21.69/21.85 SPASS allocated 108810 KBytes.
% 21.69/21.85 SPASS spent 0:0:20.93 on the problem.
% 21.69/21.85 0:00:00.04 for the input.
% 21.69/21.85 0:00:00.00 for the FLOTTER CNF translation.
% 21.69/21.85 0:00:00.50 for inferences.
% 21.69/21.85 0:00:00.00 for the backtracking.
% 21.69/21.85 0:0:20.14 for the reduction.
% 21.69/21.85
% 21.69/21.85
% 21.69/21.85 Here is a proof with depth 6, length 15 :
% 21.69/21.85 % SZS output start Refutation
% See solution above
% 21.69/21.85 Formulae used in the proof : prove_this axiom_1_4 axiom_1_6 rule_1 rule_2 rule_3
% 21.69/21.85
%------------------------------------------------------------------------------