TSTP Solution File: LCL542+1 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n021.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:55:08 EDT 2022

% Result   : Theorem 0.84s 1.04s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL542+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  2 16:35:00 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.84/1.04  # Version:  1.3
% 0.84/1.04  # SZS status Theorem
% 0.84/1.04  # SZS output start CNFRefutation
% 0.84/1.04  fof(s1_0_axiom_m2,conjecture,axiom_m2,input).
% 0.84/1.04  fof(c10,negated_conjecture,(~axiom_m2),inference(assume_negation,status(cth),[s1_0_axiom_m2])).
% 0.84/1.04  fof(c11,negated_conjecture,~axiom_m2,inference(fof_simplification,status(thm),[c10])).
% 0.84/1.04  cnf(c12,negated_conjecture,~axiom_m2,inference(split_conjunct,status(thm),[c11])).
% 0.84/1.04  fof(axiom_m2,axiom,(axiom_m2<=>(![X]:(![Y]:is_a_theorem(strict_implies(and(X,Y),X))))),input).
% 0.84/1.04  fof(c89,axiom,((~axiom_m2|(![X]:(![Y]:is_a_theorem(strict_implies(and(X,Y),X)))))&((?[X]:(?[Y]:~is_a_theorem(strict_implies(and(X,Y),X))))|axiom_m2)),inference(fof_nnf,status(thm),[axiom_m2])).
% 0.84/1.04  fof(c90,axiom,((~axiom_m2|(![X36]:(![X37]:is_a_theorem(strict_implies(and(X36,X37),X36)))))&((?[X38]:(?[X39]:~is_a_theorem(strict_implies(and(X38,X39),X38))))|axiom_m2)),inference(variable_rename,status(thm),[c89])).
% 0.84/1.04  fof(c92,axiom,(![X36]:(![X37]:((~axiom_m2|is_a_theorem(strict_implies(and(X36,X37),X36)))&(~is_a_theorem(strict_implies(and(skolem0015,skolem0016),skolem0015))|axiom_m2)))),inference(shift_quantors,status(thm),[fof(c91,axiom,((~axiom_m2|(![X36]:(![X37]:is_a_theorem(strict_implies(and(X36,X37),X36)))))&(~is_a_theorem(strict_implies(and(skolem0015,skolem0016),skolem0015))|axiom_m2)),inference(skolemize,status(esa),[c90])).])).
% 0.84/1.04  cnf(c94,axiom,~is_a_theorem(strict_implies(and(skolem0015,skolem0016),skolem0015))|axiom_m2,inference(split_conjunct,status(thm),[c92])).
% 0.84/1.04  fof(km4b_necessitation,axiom,necessitation,input).
% 0.84/1.04  cnf(c23,axiom,necessitation,inference(split_conjunct,status(thm),[km4b_necessitation])).
% 0.84/1.04  fof(necessitation,axiom,(necessitation<=>(![X]:(is_a_theorem(X)=>is_a_theorem(necessarily(X))))),input).
% 0.84/1.04  fof(c181,axiom,((~necessitation|(![X]:(~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&((?[X]:(is_a_theorem(X)&~is_a_theorem(necessarily(X))))|necessitation)),inference(fof_nnf,status(thm),[necessitation])).
% 0.84/1.04  fof(c182,axiom,((~necessitation|(![X84]:(~is_a_theorem(X84)|is_a_theorem(necessarily(X84)))))&((?[X85]:(is_a_theorem(X85)&~is_a_theorem(necessarily(X85))))|necessitation)),inference(variable_rename,status(thm),[c181])).
% 0.84/1.04  fof(c184,axiom,(![X84]:((~necessitation|(~is_a_theorem(X84)|is_a_theorem(necessarily(X84))))&((is_a_theorem(skolem0039)&~is_a_theorem(necessarily(skolem0039)))|necessitation))),inference(shift_quantors,status(thm),[fof(c183,axiom,((~necessitation|(![X84]:(~is_a_theorem(X84)|is_a_theorem(necessarily(X84)))))&((is_a_theorem(skolem0039)&~is_a_theorem(necessarily(skolem0039)))|necessitation)),inference(skolemize,status(esa),[c182])).])).
% 0.84/1.04  fof(c185,axiom,(![X84]:((~necessitation|(~is_a_theorem(X84)|is_a_theorem(necessarily(X84))))&((is_a_theorem(skolem0039)|necessitation)&(~is_a_theorem(necessarily(skolem0039))|necessitation)))),inference(distribute,status(thm),[c184])).
% 0.84/1.04  cnf(c186,axiom,~necessitation|~is_a_theorem(X247)|is_a_theorem(necessarily(X247)),inference(split_conjunct,status(thm),[c185])).
% 0.84/1.04  fof(hilbert_and_1,axiom,and_1,input).
% 0.84/1.04  cnf(c198,axiom,and_1,inference(split_conjunct,status(thm),[hilbert_and_1])).
% 0.84/1.04  fof(and_1,axiom,(and_1<=>(![X]:(![Y]:is_a_theorem(implies(and(X,Y),X))))),input).
% 0.84/1.04  fof(c341,axiom,((~and_1|(![X]:(![Y]:is_a_theorem(implies(and(X,Y),X)))))&((?[X]:(?[Y]:~is_a_theorem(implies(and(X,Y),X))))|and_1)),inference(fof_nnf,status(thm),[and_1])).
% 0.84/1.04  fof(c342,axiom,((~and_1|(![X176]:(![X177]:is_a_theorem(implies(and(X176,X177),X176)))))&((?[X178]:(?[X179]:~is_a_theorem(implies(and(X178,X179),X178))))|and_1)),inference(variable_rename,status(thm),[c341])).
% 0.84/1.04  fof(c344,axiom,(![X176]:(![X177]:((~and_1|is_a_theorem(implies(and(X176,X177),X176)))&(~is_a_theorem(implies(and(skolem0080,skolem0081),skolem0080))|and_1)))),inference(shift_quantors,status(thm),[fof(c343,axiom,((~and_1|(![X176]:(![X177]:is_a_theorem(implies(and(X176,X177),X176)))))&(~is_a_theorem(implies(and(skolem0080,skolem0081),skolem0080))|and_1)),inference(skolemize,status(esa),[c342])).])).
% 0.84/1.04  cnf(c345,axiom,~and_1|is_a_theorem(implies(and(X282,X281),X282)),inference(split_conjunct,status(thm),[c344])).
% 0.84/1.04  cnf(c421,plain,is_a_theorem(implies(and(X284,X283),X284)),inference(resolution,status(thm),[c345, c198])).
% 0.84/1.04  cnf(c422,plain,~necessitation|is_a_theorem(necessarily(implies(and(X329,X328),X329))),inference(resolution,status(thm),[c421, c186])).
% 0.84/1.04  cnf(c491,plain,is_a_theorem(necessarily(implies(and(X330,X331),X330))),inference(resolution,status(thm),[c422, c23])).
% 0.84/1.04  cnf(c9,plain,X235!=X234|~is_a_theorem(X235)|is_a_theorem(X234),eq_axiom).
% 0.84/1.04  cnf(symmetry,axiom,X208!=X207|X207=X208,eq_axiom).
% 0.84/1.04  fof(s1_0_op_strict_implies,axiom,op_strict_implies,input).
% 0.84/1.04  cnf(c15,axiom,op_strict_implies,inference(split_conjunct,status(thm),[s1_0_op_strict_implies])).
% 0.84/1.04  fof(op_strict_implies,axiom,(op_strict_implies=>(![X]:(![Y]:strict_implies(X,Y)=necessarily(implies(X,Y))))),input).
% 0.84/1.04  fof(c29,axiom,(~op_strict_implies|(![X]:(![Y]:strict_implies(X,Y)=necessarily(implies(X,Y))))),inference(fof_nnf,status(thm),[op_strict_implies])).
% 0.84/1.04  fof(c31,axiom,(![X4]:(![X5]:(~op_strict_implies|strict_implies(X4,X5)=necessarily(implies(X4,X5))))),inference(shift_quantors,status(thm),[fof(c30,axiom,(~op_strict_implies|(![X4]:(![X5]:strict_implies(X4,X5)=necessarily(implies(X4,X5))))),inference(variable_rename,status(thm),[c29])).])).
% 0.84/1.04  cnf(c32,axiom,~op_strict_implies|strict_implies(X269,X268)=necessarily(implies(X269,X268)),inference(split_conjunct,status(thm),[c31])).
% 0.84/1.04  cnf(c415,plain,strict_implies(X299,X300)=necessarily(implies(X299,X300)),inference(resolution,status(thm),[c32, c15])).
% 0.84/1.04  cnf(c448,plain,necessarily(implies(X304,X303))=strict_implies(X304,X303),inference(resolution,status(thm),[c415, symmetry])).
% 0.84/1.04  cnf(c465,plain,~is_a_theorem(necessarily(implies(X578,X579)))|is_a_theorem(strict_implies(X578,X579)),inference(resolution,status(thm),[c448, c9])).
% 0.84/1.04  cnf(c1143,plain,is_a_theorem(strict_implies(and(X587,X586),X587)),inference(resolution,status(thm),[c465, c491])).
% 0.84/1.04  cnf(c1187,plain,axiom_m2,inference(resolution,status(thm),[c1143, c94])).
% 0.84/1.04  cnf(c1190,plain,$false,inference(resolution,status(thm),[c1187, c12])).
% 0.84/1.04  # SZS output end CNFRefutation
% 0.84/1.04  
% 0.84/1.04  # Initial clauses    : 160
% 0.84/1.04  # Processed clauses  : 308
% 0.84/1.04  # Factors computed   : 0
% 0.84/1.04  # Resolvents computed: 803
% 0.84/1.04  # Tautologies deleted: 4
% 0.84/1.04  # Forward subsumed   : 85
% 0.84/1.04  # Backward subsumed  : 109
% 0.84/1.04  # -------- CPU Time ---------
% 0.84/1.04  # User time          : 0.688 s
% 0.84/1.04  # System time        : 0.016 s
% 0.84/1.04  # Total time         : 0.704 s
%------------------------------------------------------------------------------