TSTP Solution File: LCL043-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:34:13 EDT 2022
% Result : Unsatisfiable 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(u)
| ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(v) ),
file('LCL043-1.p',unknown),
[] ).
cnf(2,axiom,
is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(u),v))),
file('LCL043-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies__dfg(u,implies__dfg(v,u))),
file('LCL043-1.p',unknown),
[] ).
cnf(6,axiom,
is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(not__dfg(u),v),v))),
file('LCL043-1.p',unknown),
[] ).
cnf(7,axiom,
~ is_a_theorem(implies__dfg(not__dfg(not__dfg(a)),a)),
file('LCL043-1.p',unknown),
[] ).
cnf(17,plain,
( ~ is_a_theorem(implies__dfg(u,v))
| is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),v),v)) ),
inference(res,[status(thm),theory(equality)],[6,1]),
[iquote('0:Res:6.0,1.1')] ).
cnf(28,plain,
is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),implies__dfg(v,u)),implies__dfg(v,u))),
inference(sor,[status(thm)],[17,3]),
[iquote('0:SoR:17.0,3.0')] ).
cnf(32,plain,
( ~ is_a_theorem(implies__dfg(not__dfg(u),implies__dfg(v,u)))
| is_a_theorem(implies__dfg(v,u)) ),
inference(res,[status(thm),theory(equality)],[28,1]),
[iquote('0:Res:28.0,1.1')] ).
cnf(615,plain,
is_a_theorem(implies__dfg(not__dfg(not__dfg(u)),u)),
inference(sor,[status(thm)],[32,2]),
[iquote('0:SoR:32.0,2.0')] ).
cnf(619,plain,
$false,
inference(unc,[status(thm)],[615,7]),
[iquote('0:UnC:615.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 23:58:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49
% 0.19/0.49 SPASS V 3.9
% 0.19/0.49 SPASS beiseite: Proof found.
% 0.19/0.49 % SZS status Theorem
% 0.19/0.49 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 SPASS derived 583 clauses, backtracked 0 clauses, performed 0 splits and kept 248 clauses.
% 0.19/0.49 SPASS allocated 76431 KBytes.
% 0.19/0.49 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.49 0:00:00.04 for the input.
% 0.19/0.49 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.49 0:00:00.02 for inferences.
% 0.19/0.49 0:00:00.00 for the backtracking.
% 0.19/0.49 0:00:00.05 for the reduction.
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Here is a proof with depth 4, length 10 :
% 0.19/0.49 % SZS output start Refutation
% See solution above
% 0.19/0.49 Formulae used in the proof : condensed_detachment cn_3 cn_18 cn_54 prove_cn_39
% 0.19/0.49
%------------------------------------------------------------------------------