TSTP Solution File: LCL204-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL204-1 : TPTP v8.1.0. Released v1.1.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:25 EDT 2022
% Result : Unsatisfiable 5.41s 5.59s
% Output : Refutation 5.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 24 RR)
% Number of literals : 37 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ theorem(or__dfg(not__dfg(not__dfg(or__dfg(not__dfg(p),q))),or__dfg(not__dfg(not__dfg(p)),q))),
file('LCL204-1.p',unknown),
[] ).
cnf(3,axiom,
axiom(or__dfg(not__dfg(u),or__dfg(v,u))),
file('LCL204-1.p',unknown),
[] ).
cnf(4,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
file('LCL204-1.p',unknown),
[] ).
cnf(5,axiom,
axiom(or__dfg(not__dfg(or__dfg(u,or__dfg(v,w))),or__dfg(v,or__dfg(u,w)))),
file('LCL204-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ axiom(u)
| theorem(u) ),
file('LCL204-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ theorem(u)
| ~ axiom(or__dfg(not__dfg(u),v))
| theorem(v) ),
file('LCL204-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('LCL204-1.p',unknown),
[] ).
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(30,plain,
( ~ theorem(or__dfg(u,or__dfg(v,w)))
| theorem(or__dfg(v,or__dfg(u,w))) ),
inference(res,[status(thm),theory(equality)],[5,8]),
[iquote('0:Res:5.0,8.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(50,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(59,plain,
( ~ axiom(or__dfg(not__dfg(u),v))
| ~ theorem(or__dfg(not__dfg(v),w))
| theorem(or__dfg(w,not__dfg(u))) ),
inference(sor,[status(thm)],[23,9]),
[iquote('0:SoR:23.0,9.2')] ).
cnf(285,plain,
( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
| theorem(or__dfg(w,not__dfg(v))) ),
inference(res,[status(thm),theory(equality)],[3,59]),
[iquote('0:Res:3.0,59.0')] ).
cnf(286,plain,
( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
| theorem(or__dfg(w,not__dfg(or__dfg(v,u)))) ),
inference(res,[status(thm),theory(equality)],[4,59]),
[iquote('0:Res:4.0,59.0')] ).
cnf(595,plain,
theorem(or__dfg(or__dfg(u,v),not__dfg(u))),
inference(res,[status(thm),theory(equality)],[50,285]),
[iquote('0:Res:50.0,285.0')] ).
cnf(623,plain,
theorem(or__dfg(not__dfg(u),or__dfg(u,v))),
inference(sor,[status(thm)],[23,595]),
[iquote('0:SoR:23.0,595.0')] ).
cnf(626,plain,
theorem(or__dfg(u,or__dfg(not__dfg(u),v))),
inference(sor,[status(thm)],[30,623]),
[iquote('0:SoR:30.0,623.0')] ).
cnf(779,plain,
( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
| theorem(or__dfg(not__dfg(or__dfg(v,u)),w)) ),
inference(sor,[status(thm)],[23,286]),
[iquote('0:SoR:23.0,286.1')] ).
cnf(4524,plain,
theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(not__dfg(not__dfg(or__dfg(v,u))),w))),
inference(res,[status(thm),theory(equality)],[626,779]),
[iquote('0:Res:626.0,779.0')] ).
cnf(10433,plain,
theorem(or__dfg(or__dfg(not__dfg(not__dfg(or__dfg(u,v))),w),not__dfg(u))),
inference(res,[status(thm),theory(equality)],[4524,285]),
[iquote('0:Res:4524.0,285.0')] ).
cnf(10442,plain,
theorem(or__dfg(not__dfg(u),or__dfg(not__dfg(not__dfg(or__dfg(u,v))),w))),
inference(sor,[status(thm)],[23,10433]),
[iquote('0:SoR:23.0,10433.0')] ).
cnf(10447,plain,
theorem(or__dfg(not__dfg(not__dfg(or__dfg(u,v))),or__dfg(not__dfg(u),w))),
inference(sor,[status(thm)],[30,10442]),
[iquote('0:SoR:30.0,10442.0')] ).
cnf(10473,plain,
$false,
inference(unc,[status(thm)],[10447,1]),
[iquote('0:UnC:10447.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL204-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 2 23:46:37 EDT 2022
% 0.11/0.33 % CPUTime :
% 5.41/5.59
% 5.41/5.59 SPASS V 3.9
% 5.41/5.59 SPASS beiseite: Proof found.
% 5.41/5.59 % SZS status Theorem
% 5.41/5.59 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.41/5.59 SPASS derived 10451 clauses, backtracked 0 clauses, performed 0 splits and kept 5909 clauses.
% 5.41/5.59 SPASS allocated 92012 KBytes.
% 5.41/5.59 SPASS spent 0:00:05.11 on the problem.
% 5.41/5.59 0:00:00.03 for the input.
% 5.41/5.59 0:00:00.00 for the FLOTTER CNF translation.
% 5.41/5.59 0:00:00.23 for inferences.
% 5.41/5.59 0:00:00.00 for the backtracking.
% 5.41/5.59 0:00:04.75 for the reduction.
% 5.41/5.59
% 5.41/5.59
% 5.41/5.59 Here is a proof with depth 11, length 24 :
% 5.41/5.59 % SZS output start Refutation
% See solution above
% 5.41/5.59 Formulae used in the proof : prove_this axiom_1_3 axiom_1_4 axiom_1_5 rule_1 rule_2 rule_3
% 5.41/5.59
%------------------------------------------------------------------------------