TSTP Solution File: LCL397-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n020.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:36:40 EDT 2022

% Result   : Unsatisfiable 0.22s 0.49s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   24 (  16 unt;   0 nHn;  24 RR)
%            Number of literals    :   34 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 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,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(implies__dfg(u,v))
    | is_a_theorem(v) ),
    file('LCL397-1.p',unknown),
    [] ).

cnf(2,axiom,
    is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
    file('LCL397-1.p',unknown),
    [] ).

cnf(3,axiom,
    is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),u),u)),
    file('LCL397-1.p',unknown),
    [] ).

cnf(4,axiom,
    is_a_theorem(implies__dfg(u,implies__dfg(not__dfg(u),v))),
    file('LCL397-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ is_a_theorem(implies__dfg(x__dfg,implies__dfg(y__dfg,y__dfg))),
    file('LCL397-1.p',unknown),
    [] ).

cnf(13,plain,
    ( ~ is_a_theorem(implies__dfg(u,v))
    | is_a_theorem(implies__dfg(implies__dfg(v,w),implies__dfg(u,w))) ),
    inference(res,[status(thm),theory(equality)],[2,1]),
    [iquote('0:Res:2.0,1.1')] ).

cnf(17,plain,
    is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(implies__dfg(not__dfg(u),u),v))),
    inference(sor,[status(thm)],[13,3]),
    [iquote('0:SoR:13.0,3.0')] ).

cnf(18,plain,
    is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),x),implies__dfg(implies__dfg(w,u),x))),
    inference(sor,[status(thm)],[13,2]),
    [iquote('0:SoR:13.0,2.0')] ).

cnf(19,plain,
    is_a_theorem(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),v),w),implies__dfg(u,w))),
    inference(sor,[status(thm)],[13,4]),
    [iquote('0:SoR:13.0,4.0')] ).

cnf(20,plain,
    is_a_theorem(implies__dfg(implies__dfg(implies__dfg(implies__dfg(not__dfg(u),u),v),w),implies__dfg(implies__dfg(u,v),w))),
    inference(sor,[status(thm)],[13,17]),
    [iquote('0:SoR:13.0,17.0')] ).

cnf(23,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(not__dfg(u),v),w))
    | is_a_theorem(implies__dfg(u,w)) ),
    inference(res,[status(thm),theory(equality)],[19,1]),
    [iquote('0:Res:19.0,1.1')] ).

cnf(38,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),implies__dfg(w,v)),x))
    | is_a_theorem(implies__dfg(implies__dfg(w,u),x)) ),
    inference(res,[status(thm),theory(equality)],[18,1]),
    [iquote('0:Res:18.0,1.1')] ).

cnf(44,plain,
    is_a_theorem(implies__dfg(u,u)),
    inference(sor,[status(thm)],[23,3]),
    [iquote('0:SoR:23.0,3.0')] ).

cnf(92,plain,
    is_a_theorem(implies__dfg(implies__dfg(u,not__dfg(v)),implies__dfg(v,implies__dfg(u,w)))),
    inference(sor,[status(thm)],[38,19]),
    [iquote('0:SoR:38.0,19.0')] ).

cnf(94,plain,
    is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),v)),implies__dfg(implies__dfg(v,w),implies__dfg(u,w)))),
    inference(sor,[status(thm)],[38,20]),
    [iquote('0:SoR:38.0,20.0')] ).

cnf(103,plain,
    is_a_theorem(implies__dfg(u,implies__dfg(v,implies__dfg(not__dfg(u),w)))),
    inference(sor,[status(thm)],[23,92]),
    [iquote('0:SoR:23.0,92.0')] ).

cnf(106,plain,
    is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),w)),x),implies__dfg(v,x))),
    inference(sor,[status(thm)],[13,103]),
    [iquote('0:SoR:13.0,103.0')] ).

cnf(158,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(u,implies__dfg(not__dfg(v),w)),x))
    | is_a_theorem(implies__dfg(v,x)) ),
    inference(res,[status(thm),theory(equality)],[106,1]),
    [iquote('0:Res:106.0,1.1')] ).

cnf(240,plain,
    is_a_theorem(implies__dfg(u,implies__dfg(implies__dfg(u,v),implies__dfg(w,v)))),
    inference(sor,[status(thm)],[158,94]),
    [iquote('0:SoR:158.0,94.0')] ).

cnf(258,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(implies__dfg(implies__dfg(u,v),implies__dfg(w,v))) ),
    inference(res,[status(thm),theory(equality)],[240,1]),
    [iquote('0:Res:240.0,1.1')] ).

cnf(274,plain,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(implies__dfg(u,v))
    | is_a_theorem(implies__dfg(w,v)) ),
    inference(res,[status(thm),theory(equality)],[258,1]),
    [iquote('0:Res:258.1,1.1')] ).

cnf(320,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(implies__dfg(v,u)) ),
    inference(sor,[status(thm)],[274,44]),
    [iquote('0:SoR:274.1,44.0')] ).

cnf(373,plain,
    ~ is_a_theorem(implies__dfg(y__dfg,y__dfg)),
    inference(res,[status(thm),theory(equality)],[320,5]),
    [iquote('0:Res:320.1,5.0')] ).

cnf(375,plain,
    $false,
    inference(ssi,[status(thm)],[373,44]),
    [iquote('0:SSi:373.0,44.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.15/0.36  % Computer : n020.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Mon Jul  4 01:49:46 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.49  
% 0.22/0.49  SPASS V 3.9 
% 0.22/0.49  SPASS beiseite: Proof found.
% 0.22/0.49  % SZS status Theorem
% 0.22/0.49  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.49  SPASS derived 358 clauses, backtracked 0 clauses, performed 0 splits and kept 225 clauses.
% 0.22/0.49  SPASS allocated 76315 KBytes.
% 0.22/0.49  SPASS spent	0:00:00.11 on the problem.
% 0.22/0.49  		0:00:00.03 for the input.
% 0.22/0.49  		0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.49  		0:00:00.01 for inferences.
% 0.22/0.49  		0:00:00.00 for the backtracking.
% 0.22/0.49  		0:00:00.04 for the reduction.
% 0.22/0.49  
% 0.22/0.49  
% 0.22/0.49  Here is a proof with depth 12, length 24 :
% 0.22/0.49  % SZS output start Refutation
% See solution above
% 0.22/0.49  Formulae used in the proof : condensed_detachment cn_1 cn_2 cn_3 prove_cn_63
% 0.22/0.49  
%------------------------------------------------------------------------------