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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL110-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n015.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:41 EDT 2022

% Result   : Unsatisfiable 0.20s 0.49s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   24 (  12 unt;   0 nHn;  24 RR)
%            Number of literals    :   38 (   0 equ;  15 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    :    6 (   6 usr;   4 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('LCL110-1.p',unknown),
    [] ).

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

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

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

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

cnf(6,axiom,
    ~ is_a_theorem(implies__dfg(not__dfg(not__dfg(a)),a)),
    file('LCL110-1.p',unknown),
    [] ).

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

cnf(15,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),v))
    | is_a_theorem(implies__dfg(implies__dfg(v,u),u)) ),
    inference(res,[status(thm),theory(equality)],[4,1]),
    [iquote('0:Res:4.0,1.1')] ).

cnf(19,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)],[3,1]),
    [iquote('0:Res:3.0,1.1')] ).

cnf(20,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(implies__dfg(implies__dfg(u,v),v)) ),
    inference(sor,[status(thm)],[15,13]),
    [iquote('0:SoR:15.0,13.1')] ).

cnf(22,plain,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(implies__dfg(u,v))
    | is_a_theorem(v) ),
    inference(res,[status(thm),theory(equality)],[20,1]),
    [iquote('0:Res:20.1,1.1')] ).

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

cnf(34,plain,
    is_a_theorem(implies__dfg(implies__dfg(implies__dfg(u,v),w),implies__dfg(v,w))),
    inference(sor,[status(thm)],[19,2]),
    [iquote('0:SoR:19.0,2.0')] ).

cnf(36,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
    | is_a_theorem(implies__dfg(v,w)) ),
    inference(sor,[status(thm)],[22,34]),
    [iquote('0:SoR:22.1,34.0')] ).

cnf(42,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(implies__dfg(v,v)) ),
    inference(sor,[status(thm)],[36,20]),
    [iquote('0:SoR:36.0,20.1')] ).

cnf(47,plain,
    is_a_theorem(implies__dfg(not__dfg(u),implies__dfg(u,v))),
    inference(sor,[status(thm)],[36,5]),
    [iquote('0:SoR:36.0,5.0')] ).

cnf(51,plain,
    is_a_theorem(implies__dfg(u,u)),
    inference(ems,[status(thm)],[42,34]),
    [iquote('0:EmS:42.0,34.0')] ).

cnf(63,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
    | is_a_theorem(implies__dfg(implies__dfg(not__dfg(v),not__dfg(u)),w)) ),
    inference(sor,[status(thm)],[22,33]),
    [iquote('0:SoR:22.1,33.0')] ).

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

cnf(101,plain,
    ( ~ is_a_theorem(implies__dfg(implies__dfg(u,v),w))
    | is_a_theorem(implies__dfg(not__dfg(u),w)) ),
    inference(sor,[status(thm)],[22,66]),
    [iquote('0:SoR:22.1,66.0')] ).

cnf(355,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(implies__dfg(implies__dfg(not__dfg(v),not__dfg(u)),v)) ),
    inference(sor,[status(thm)],[63,20]),
    [iquote('0:SoR:63.0,20.1')] ).

cnf(389,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(implies__dfg(not__dfg(not__dfg(v)),v)) ),
    inference(sor,[status(thm)],[101,355]),
    [iquote('0:SoR:101.0,355.1')] ).

cnf(394,plain,
    is_a_theorem(implies__dfg(not__dfg(not__dfg(u)),u)),
    inference(ems,[status(thm)],[389,51]),
    [iquote('0:EmS:389.0,51.0')] ).

cnf(436,plain,
    $false,
    inference(unc,[status(thm)],[394,6]),
    [iquote('0:UnC:394.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL110-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n015.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 : Sun Jul  3 18:38:15 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.49  
% 0.20/0.49  SPASS V 3.9 
% 0.20/0.49  SPASS beiseite: Proof found.
% 0.20/0.49  % SZS status Theorem
% 0.20/0.49  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.49  SPASS derived 409 clauses, backtracked 0 clauses, performed 0 splits and kept 250 clauses.
% 0.20/0.49  SPASS allocated 76200 KBytes.
% 0.20/0.49  SPASS spent	0:00:00.13 on the problem.
% 0.20/0.49  		0:00:00.03 for the input.
% 0.20/0.49  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.49  		0:00:00.02 for inferences.
% 0.20/0.49  		0:00:00.00 for the backtracking.
% 0.20/0.49  		0:00:00.05 for the reduction.
% 0.20/0.49  
% 0.20/0.49  
% 0.20/0.49  Here is a proof with depth 9, length 24 :
% 0.20/0.49  % SZS output start Refutation
% See solution above
% 0.20/0.49  Formulae used in the proof : condensed_detachment mv_1 mv_2 mv_3 mv_5 prove_mv_24
% 0.20/0.49  
%------------------------------------------------------------------------------