TSTP Solution File: LCL538+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n028.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:07 EDT 2022
% Result : Theorem 1.35s 1.52s
% Output : Refutation 1.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n028.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 20:57:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.35/1.52 # Version: 1.3
% 1.35/1.52 # SZS status Theorem
% 1.35/1.52 # SZS output start CNFRefutation
% 1.35/1.52 fof(s1_0_modus_ponens_strict_implies,conjecture,modus_ponens_strict_implies,input).
% 1.35/1.52 fof(c10,negated_conjecture,(~modus_ponens_strict_implies),inference(assume_negation,status(cth),[s1_0_modus_ponens_strict_implies])).
% 1.35/1.52 fof(c11,negated_conjecture,~modus_ponens_strict_implies,inference(fof_simplification,status(thm),[c10])).
% 1.35/1.52 cnf(c12,negated_conjecture,~modus_ponens_strict_implies,inference(split_conjunct,status(thm),[c11])).
% 1.35/1.52 fof(modus_ponens_strict_implies,axiom,(modus_ponens_strict_implies<=>(![X]:(![Y]:((is_a_theorem(X)&is_a_theorem(strict_implies(X,Y)))=>is_a_theorem(Y))))),input).
% 1.35/1.52 fof(c172,axiom,((~modus_ponens_strict_implies|(![X]:(![Y]:((~is_a_theorem(X)|~is_a_theorem(strict_implies(X,Y)))|is_a_theorem(Y)))))&((?[X]:(?[Y]:((is_a_theorem(X)&is_a_theorem(strict_implies(X,Y)))&~is_a_theorem(Y))))|modus_ponens_strict_implies)),inference(fof_nnf,status(thm),[modus_ponens_strict_implies])).
% 1.35/1.52 fof(c173,axiom,((~modus_ponens_strict_implies|(![X80]:(![X81]:((~is_a_theorem(X80)|~is_a_theorem(strict_implies(X80,X81)))|is_a_theorem(X81)))))&((?[X82]:(?[X83]:((is_a_theorem(X82)&is_a_theorem(strict_implies(X82,X83)))&~is_a_theorem(X83))))|modus_ponens_strict_implies)),inference(variable_rename,status(thm),[c172])).
% 1.35/1.52 fof(c175,axiom,(![X80]:(![X81]:((~modus_ponens_strict_implies|((~is_a_theorem(X80)|~is_a_theorem(strict_implies(X80,X81)))|is_a_theorem(X81)))&(((is_a_theorem(skolem0037)&is_a_theorem(strict_implies(skolem0037,skolem0038)))&~is_a_theorem(skolem0038))|modus_ponens_strict_implies)))),inference(shift_quantors,status(thm),[fof(c174,axiom,((~modus_ponens_strict_implies|(![X80]:(![X81]:((~is_a_theorem(X80)|~is_a_theorem(strict_implies(X80,X81)))|is_a_theorem(X81)))))&(((is_a_theorem(skolem0037)&is_a_theorem(strict_implies(skolem0037,skolem0038)))&~is_a_theorem(skolem0038))|modus_ponens_strict_implies)),inference(skolemize,status(esa),[c173])).])).
% 1.35/1.52 fof(c176,axiom,(![X80]:(![X81]:((~modus_ponens_strict_implies|((~is_a_theorem(X80)|~is_a_theorem(strict_implies(X80,X81)))|is_a_theorem(X81)))&(((is_a_theorem(skolem0037)|modus_ponens_strict_implies)&(is_a_theorem(strict_implies(skolem0037,skolem0038))|modus_ponens_strict_implies))&(~is_a_theorem(skolem0038)|modus_ponens_strict_implies))))),inference(distribute,status(thm),[c175])).
% 1.35/1.52 cnf(c180,axiom,~is_a_theorem(skolem0038)|modus_ponens_strict_implies,inference(split_conjunct,status(thm),[c176])).
% 1.35/1.52 fof(hilbert_modus_ponens,axiom,modus_ponens,input).
% 1.35/1.52 cnf(c203,axiom,modus_ponens,inference(split_conjunct,status(thm),[hilbert_modus_ponens])).
% 1.35/1.52 cnf(c178,axiom,is_a_theorem(skolem0037)|modus_ponens_strict_implies,inference(split_conjunct,status(thm),[c176])).
% 1.35/1.52 cnf(c393,plain,is_a_theorem(skolem0037),inference(resolution,status(thm),[c178, c12])).
% 1.35/1.52 fof(modus_ponens,axiom,(modus_ponens<=>(![X]:(![Y]:((is_a_theorem(X)&is_a_theorem(implies(X,Y)))=>is_a_theorem(Y))))),input).
% 1.35/1.52 fof(c379,axiom,((~modus_ponens|(![X]:(![Y]:((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))))&((?[X]:(?[Y]:((is_a_theorem(X)&is_a_theorem(implies(X,Y)))&~is_a_theorem(Y))))|modus_ponens)),inference(fof_nnf,status(thm),[modus_ponens])).
% 1.35/1.52 fof(c380,axiom,((~modus_ponens|(![X202]:(![X203]:((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))))&((?[X204]:(?[X205]:((is_a_theorem(X204)&is_a_theorem(implies(X204,X205)))&~is_a_theorem(X205))))|modus_ponens)),inference(variable_rename,status(thm),[c379])).
% 1.35/1.52 fof(c382,axiom,(![X202]:(![X203]:((~modus_ponens|((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))&(((is_a_theorem(skolem0093)&is_a_theorem(implies(skolem0093,skolem0094)))&~is_a_theorem(skolem0094))|modus_ponens)))),inference(shift_quantors,status(thm),[fof(c381,axiom,((~modus_ponens|(![X202]:(![X203]:((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))))&(((is_a_theorem(skolem0093)&is_a_theorem(implies(skolem0093,skolem0094)))&~is_a_theorem(skolem0094))|modus_ponens)),inference(skolemize,status(esa),[c380])).])).
% 1.35/1.52 fof(c383,axiom,(![X202]:(![X203]:((~modus_ponens|((~is_a_theorem(X202)|~is_a_theorem(implies(X202,X203)))|is_a_theorem(X203)))&(((is_a_theorem(skolem0093)|modus_ponens)&(is_a_theorem(implies(skolem0093,skolem0094))|modus_ponens))&(~is_a_theorem(skolem0094)|modus_ponens))))),inference(distribute,status(thm),[c382])).
% 1.35/1.52 cnf(c384,axiom,~modus_ponens|~is_a_theorem(X371)|~is_a_theorem(implies(X371,X372))|is_a_theorem(X372),inference(split_conjunct,status(thm),[c383])).
% 1.35/1.52 fof(km4b_axiom_M,axiom,axiom_M,input).
% 1.35/1.52 cnf(c21,axiom,axiom_M,inference(split_conjunct,status(thm),[km4b_axiom_M])).
% 1.35/1.52 fof(axiom_M,axiom,(axiom_M<=>(![X]:is_a_theorem(implies(necessarily(X),X)))),input).
% 1.35/1.52 fof(c143,axiom,((~axiom_M|(![X]:is_a_theorem(implies(necessarily(X),X))))&((?[X]:~is_a_theorem(implies(necessarily(X),X)))|axiom_M)),inference(fof_nnf,status(thm),[axiom_M])).
% 1.35/1.52 fof(c144,axiom,((~axiom_M|(![X66]:is_a_theorem(implies(necessarily(X66),X66))))&((?[X67]:~is_a_theorem(implies(necessarily(X67),X67)))|axiom_M)),inference(variable_rename,status(thm),[c143])).
% 1.35/1.52 fof(c146,axiom,(![X66]:((~axiom_M|is_a_theorem(implies(necessarily(X66),X66)))&(~is_a_theorem(implies(necessarily(skolem0030),skolem0030))|axiom_M))),inference(shift_quantors,status(thm),[fof(c145,axiom,((~axiom_M|(![X66]:is_a_theorem(implies(necessarily(X66),X66))))&(~is_a_theorem(implies(necessarily(skolem0030),skolem0030))|axiom_M)),inference(skolemize,status(esa),[c144])).])).
% 1.35/1.52 cnf(c147,axiom,~axiom_M|is_a_theorem(implies(necessarily(X241),X241)),inference(split_conjunct,status(thm),[c146])).
% 1.35/1.52 cnf(c398,plain,is_a_theorem(implies(necessarily(X246),X246)),inference(resolution,status(thm),[c147, c21])).
% 1.35/1.52 cnf(c603,plain,~modus_ponens|~is_a_theorem(necessarily(X373))|is_a_theorem(X373),inference(resolution,status(thm),[c384, c398])).
% 1.35/1.52 cnf(c179,axiom,is_a_theorem(strict_implies(skolem0037,skolem0038))|modus_ponens_strict_implies,inference(split_conjunct,status(thm),[c176])).
% 1.35/1.52 cnf(c400,plain,is_a_theorem(strict_implies(skolem0037,skolem0038)),inference(resolution,status(thm),[c179, c12])).
% 1.35/1.52 cnf(c9,plain,X237!=X238|~is_a_theorem(X237)|is_a_theorem(X238),eq_axiom).
% 1.35/1.52 fof(s1_0_op_strict_implies,axiom,op_strict_implies,input).
% 1.35/1.52 cnf(c15,axiom,op_strict_implies,inference(split_conjunct,status(thm),[s1_0_op_strict_implies])).
% 1.35/1.52 fof(op_strict_implies,axiom,(op_strict_implies=>(![X]:(![Y]:strict_implies(X,Y)=necessarily(implies(X,Y))))),input).
% 1.35/1.52 fof(c29,axiom,(~op_strict_implies|(![X]:(![Y]:strict_implies(X,Y)=necessarily(implies(X,Y))))),inference(fof_nnf,status(thm),[op_strict_implies])).
% 1.35/1.52 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])).])).
% 1.35/1.52 cnf(c32,axiom,~op_strict_implies|strict_implies(X262,X263)=necessarily(implies(X262,X263)),inference(split_conjunct,status(thm),[c31])).
% 1.35/1.52 cnf(c418,plain,strict_implies(X301,X300)=necessarily(implies(X301,X300)),inference(resolution,status(thm),[c32, c15])).
% 1.35/1.52 cnf(c453,plain,~is_a_theorem(strict_implies(X713,X714))|is_a_theorem(necessarily(implies(X713,X714))),inference(resolution,status(thm),[c418, c9])).
% 1.35/1.52 cnf(c1880,plain,is_a_theorem(necessarily(implies(skolem0037,skolem0038))),inference(resolution,status(thm),[c453, c400])).
% 1.35/1.52 cnf(c1888,plain,~modus_ponens|is_a_theorem(implies(skolem0037,skolem0038)),inference(resolution,status(thm),[c1880, c603])).
% 1.35/1.52 cnf(c1910,plain,is_a_theorem(implies(skolem0037,skolem0038)),inference(resolution,status(thm),[c1888, c203])).
% 1.35/1.52 cnf(c1911,plain,~modus_ponens|~is_a_theorem(skolem0037)|is_a_theorem(skolem0038),inference(resolution,status(thm),[c1910, c384])).
% 1.35/1.52 cnf(c1919,plain,~modus_ponens|is_a_theorem(skolem0038),inference(resolution,status(thm),[c1911, c393])).
% 1.35/1.52 cnf(c1920,plain,is_a_theorem(skolem0038),inference(resolution,status(thm),[c1919, c203])).
% 1.35/1.52 cnf(c1921,plain,modus_ponens_strict_implies,inference(resolution,status(thm),[c1920, c180])).
% 1.35/1.52 cnf(c1937,plain,$false,inference(resolution,status(thm),[c1921, c12])).
% 1.35/1.52 # SZS output end CNFRefutation
% 1.35/1.52
% 1.35/1.52 # Initial clauses : 160
% 1.35/1.52 # Processed clauses : 408
% 1.35/1.52 # Factors computed : 0
% 1.35/1.52 # Resolvents computed: 1550
% 1.35/1.52 # Tautologies deleted: 5
% 1.35/1.52 # Forward subsumed : 110
% 1.35/1.52 # Backward subsumed : 134
% 1.35/1.52 # -------- CPU Time ---------
% 1.35/1.52 # User time : 1.164 s
% 1.35/1.52 # System time : 0.012 s
% 1.35/1.52 # Total time : 1.176 s
%------------------------------------------------------------------------------