TSTP Solution File: LCL268-3 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n023.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 13:53:30 EDT 2022

% Result   : Unsatisfiable 22.56s 22.77s
% Output   : Refutation 22.56s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ theorem(equivalent(p,p)),
    input ).

cnf(c6,plain,
    ( X19 != X18
    | ~ theorem(X19)
    | theorem(X18) ),
    eq_axiom ).

cnf(symmetry,axiom,
    ( X5 != X4
    | X4 = X5 ),
    eq_axiom ).

cnf(equivalent_defn,axiom,
    equivalent(X66,X65) = and(implies(X66,X65),implies(X65,X66)),
    input ).

cnf(c50,plain,
    and(implies(X384,X385),implies(X385,X384)) = equivalent(X384,X385),
    inference(resolution,status(thm),[equivalent_defn,symmetry]) ).

cnf(c389,plain,
    ( ~ theorem(and(implies(X3515,X3514),implies(X3514,X3515)))
    | theorem(equivalent(X3515,X3514)) ),
    inference(resolution,status(thm),[c50,c6]) ).

cnf(and_defn,axiom,
    and(X54,X53) = not(or(not(X54),not(X53))),
    input ).

cnf(c40,plain,
    not(or(not(X300),not(X299))) = and(X300,X299),
    inference(resolution,status(thm),[and_defn,symmetry]) ).

cnf(c264,plain,
    ( ~ theorem(not(or(not(X2055),not(X2056))))
    | theorem(and(X2055,X2056)) ),
    inference(resolution,status(thm),[c40,c6]) ).

cnf(rule_2,axiom,
    ( theorem(X24)
    | ~ theorem(implies(X23,X24))
    | ~ theorem(X23) ),
    input ).

cnf(rule_1,axiom,
    ( theorem(X3)
    | ~ axiom(X3) ),
    input ).

cnf(axiom_1_4,axiom,
    axiom(implies(or(X17,X16),or(X16,X17))),
    input ).

cnf(c11,plain,
    theorem(implies(or(X42,X43),or(X43,X42))),
    inference(resolution,status(thm),[axiom_1_4,rule_1]) ).

cnf(c27,plain,
    ( theorem(or(X57,X56))
    | ~ theorem(or(X56,X57)) ),
    inference(resolution,status(thm),[c11,rule_2]) ).

cnf(axiom_1_2,axiom,
    axiom(implies(or(X7,X7),X7)),
    input ).

cnf(c5,plain,
    ( X14 != X13
    | ~ axiom(X14)
    | axiom(X13) ),
    eq_axiom ).

cnf(implies_definition,axiom,
    implies(X22,X21) = or(not(X22),X21),
    input ).

cnf(c13,plain,
    ( ~ axiom(implies(X75,X76))
    | axiom(or(not(X75),X76)) ),
    inference(resolution,status(thm),[implies_definition,c5]) ).

cnf(c57,plain,
    axiom(or(not(or(X81,X81)),X81)),
    inference(resolution,status(thm),[c13,axiom_1_2]) ).

cnf(c65,plain,
    theorem(or(not(or(X84,X84)),X84)),
    inference(resolution,status(thm),[c57,rule_1]) ).

cnf(c68,plain,
    theorem(or(X87,not(or(X87,X87)))),
    inference(resolution,status(thm),[c65,c27]) ).

cnf(c15,plain,
    or(not(X44),X45) = implies(X44,X45),
    inference(resolution,status(thm),[implies_definition,symmetry]) ).

cnf(c32,plain,
    ( ~ theorem(or(not(X111),X112))
    | theorem(implies(X111,X112)) ),
    inference(resolution,status(thm),[c15,c6]) ).

cnf(c93,plain,
    theorem(implies(X291,not(or(not(X291),not(X291))))),
    inference(resolution,status(thm),[c32,c68]) ).

cnf(c246,plain,
    ( theorem(not(or(not(X358),not(X358))))
    | ~ theorem(X358) ),
    inference(resolution,status(thm),[c93,rule_2]) ).

cnf(c8,plain,
    theorem(implies(or(X10,X10),X10)),
    inference(resolution,status(thm),[axiom_1_2,rule_1]) ).

cnf(c17,plain,
    ( theorem(X30)
    | ~ theorem(or(X30,X30)) ),
    inference(resolution,status(thm),[rule_2,c8]) ).

cnf(axiom_1_3,axiom,
    axiom(implies(X9,or(X8,X9))),
    input ).

cnf(c58,plain,
    axiom(or(not(X82),or(X83,X82))),
    inference(resolution,status(thm),[c13,axiom_1_3]) ).

cnf(c66,plain,
    theorem(or(not(X86),or(X85,X86))),
    inference(resolution,status(thm),[c58,rule_1]) ).

cnf(axiom_1_5,axiom,
    axiom(implies(or(X29,or(X28,X27)),or(X28,or(X29,X27)))),
    input ).

cnf(c20,plain,
    theorem(implies(or(X128,or(X129,X130)),or(X129,or(X128,X130)))),
    inference(resolution,status(thm),[axiom_1_5,rule_1]) ).

cnf(c108,plain,
    ( theorem(or(X801,or(X802,X800)))
    | ~ theorem(or(X802,or(X801,X800))) ),
    inference(resolution,status(thm),[c20,rule_2]) ).

cnf(c772,plain,
    theorem(or(X803,or(not(X804),X804))),
    inference(resolution,status(thm),[c108,c66]) ).

cnf(c814,plain,
    theorem(or(not(X805),X805)),
    inference(resolution,status(thm),[c772,c17]) ).

cnf(c817,plain,
    theorem(implies(X806,X806)),
    inference(resolution,status(thm),[c814,c32]) ).

cnf(c824,plain,
    theorem(not(or(not(implies(X8610,X8610)),not(implies(X8610,X8610))))),
    inference(resolution,status(thm),[c817,c246]) ).

cnf(c25110,plain,
    theorem(and(implies(X8613,X8613),implies(X8613,X8613))),
    inference(resolution,status(thm),[c824,c264]) ).

cnf(c25125,plain,
    theorem(equivalent(X8614,X8614)),
    inference(resolution,status(thm),[c25110,c389]) ).

cnf(c25140,plain,
    $false,
    inference(resolution,status(thm),[c25125,prove_this]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.32  % Computer : n023.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun Jul  3 21:39:58 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 22.56/22.77  # Version:  1.3
% 22.56/22.77  # SZS status Unsatisfiable
% 22.56/22.77  # SZS output start CNFRefutation
% See solution above
% 22.56/22.77  
% 22.56/22.77  # Initial clauses    : 21
% 22.56/22.77  # Processed clauses  : 1031
% 22.56/22.77  # Factors computed   : 0
% 22.56/22.77  # Resolvents computed: 25136
% 22.56/22.77  # Tautologies deleted: 4
% 22.56/22.77  # Forward subsumed   : 2161
% 22.56/22.77  # Backward subsumed  : 0
% 22.56/22.77  # -------- CPU Time ---------
% 22.56/22.77  # User time          : 22.366 s
% 22.56/22.77  # System time        : 0.061 s
% 22.56/22.77  # Total time         : 22.427 s
%------------------------------------------------------------------------------