TSTP Solution File: LCL469+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : LCL469+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n014.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:54:47 EDT 2022
% Result : Theorem 1.08s 1.29s
% Output : Refutation 1.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL469+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n014.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 : Mon Jul 4 02:08:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.08/1.29 # Version: 1.3
% 1.08/1.29 # SZS status Theorem
% 1.08/1.29 # SZS output start CNFRefutation
% 1.08/1.29 fof(hilbert_or_1,conjecture,or_1,input).
% 1.08/1.29 fof(c6,negated_conjecture,(~or_1),inference(assume_negation,status(cth),[hilbert_or_1])).
% 1.08/1.29 fof(c7,negated_conjecture,~or_1,inference(fof_simplification,status(thm),[c6])).
% 1.08/1.29 cnf(c8,negated_conjecture,~or_1,inference(split_conjunct,status(thm),[c7])).
% 1.08/1.29 fof(or_1,axiom,(or_1<=>(![X]:(![Y]:is_a_theorem(implies(X,or(X,Y)))))),input).
% 1.08/1.29 fof(c136,axiom,((~or_1|(![X]:(![Y]:is_a_theorem(implies(X,or(X,Y))))))&((?[X]:(?[Y]:~is_a_theorem(implies(X,or(X,Y)))))|or_1)),inference(fof_nnf,status(thm),[or_1])).
% 1.08/1.29 fof(c137,axiom,((~or_1|(![X80]:(![X81]:is_a_theorem(implies(X80,or(X80,X81))))))&((?[X82]:(?[X83]:~is_a_theorem(implies(X82,or(X82,X83)))))|or_1)),inference(variable_rename,status(thm),[c136])).
% 1.08/1.29 fof(c139,axiom,(![X80]:(![X81]:((~or_1|is_a_theorem(implies(X80,or(X80,X81))))&(~is_a_theorem(implies(skolem0035,or(skolem0035,skolem0036)))|or_1)))),inference(shift_quantors,status(thm),[fof(c138,axiom,((~or_1|(![X80]:(![X81]:is_a_theorem(implies(X80,or(X80,X81))))))&(~is_a_theorem(implies(skolem0035,or(skolem0035,skolem0036)))|or_1)),inference(skolemize,status(esa),[c137])).])).
% 1.08/1.29 cnf(c141,axiom,~is_a_theorem(implies(skolem0035,or(skolem0035,skolem0036)))|or_1,inference(split_conjunct,status(thm),[c139])).
% 1.08/1.29 fof(luka_modus_ponens,axiom,modus_ponens,input).
% 1.08/1.29 cnf(c16,axiom,modus_ponens,inference(split_conjunct,status(thm),[luka_modus_ponens])).
% 1.08/1.29 fof(modus_ponens,axiom,(modus_ponens<=>(![X]:(![Y]:((is_a_theorem(X)&is_a_theorem(implies(X,Y)))=>is_a_theorem(Y))))),input).
% 1.08/1.29 fof(c192,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.08/1.29 fof(c193,axiom,((~modus_ponens|(![X118]:(![X119]:((~is_a_theorem(X118)|~is_a_theorem(implies(X118,X119)))|is_a_theorem(X119)))))&((?[X120]:(?[X121]:((is_a_theorem(X120)&is_a_theorem(implies(X120,X121)))&~is_a_theorem(X121))))|modus_ponens)),inference(variable_rename,status(thm),[c192])).
% 1.08/1.29 fof(c195,axiom,(![X118]:(![X119]:((~modus_ponens|((~is_a_theorem(X118)|~is_a_theorem(implies(X118,X119)))|is_a_theorem(X119)))&(((is_a_theorem(skolem0054)&is_a_theorem(implies(skolem0054,skolem0055)))&~is_a_theorem(skolem0055))|modus_ponens)))),inference(shift_quantors,status(thm),[fof(c194,axiom,((~modus_ponens|(![X118]:(![X119]:((~is_a_theorem(X118)|~is_a_theorem(implies(X118,X119)))|is_a_theorem(X119)))))&(((is_a_theorem(skolem0054)&is_a_theorem(implies(skolem0054,skolem0055)))&~is_a_theorem(skolem0055))|modus_ponens)),inference(skolemize,status(esa),[c193])).])).
% 1.08/1.29 fof(c196,axiom,(![X118]:(![X119]:((~modus_ponens|((~is_a_theorem(X118)|~is_a_theorem(implies(X118,X119)))|is_a_theorem(X119)))&(((is_a_theorem(skolem0054)|modus_ponens)&(is_a_theorem(implies(skolem0054,skolem0055))|modus_ponens))&(~is_a_theorem(skolem0055)|modus_ponens))))),inference(distribute,status(thm),[c195])).
% 1.08/1.29 cnf(c197,axiom,~modus_ponens|~is_a_theorem(X192)|~is_a_theorem(implies(X192,X191))|is_a_theorem(X191),inference(split_conjunct,status(thm),[c196])).
% 1.08/1.29 fof(luka_cn2,axiom,cn2,input).
% 1.08/1.29 cnf(c14,axiom,cn2,inference(split_conjunct,status(thm),[luka_cn2])).
% 1.08/1.29 fof(cn2,axiom,(cn2<=>(![P]:(![Q]:is_a_theorem(implies(P,implies(not(P),Q)))))),input).
% 1.08/1.29 fof(c76,axiom,((~cn2|(![P]:(![Q]:is_a_theorem(implies(P,implies(not(P),Q))))))&((?[P]:(?[Q]:~is_a_theorem(implies(P,implies(not(P),Q)))))|cn2)),inference(fof_nnf,status(thm),[cn2])).
% 1.08/1.29 fof(c77,axiom,((~cn2|(![X36]:(![X37]:is_a_theorem(implies(X36,implies(not(X36),X37))))))&((?[X38]:(?[X39]:~is_a_theorem(implies(X38,implies(not(X38),X39)))))|cn2)),inference(variable_rename,status(thm),[c76])).
% 1.08/1.29 fof(c79,axiom,(![X36]:(![X37]:((~cn2|is_a_theorem(implies(X36,implies(not(X36),X37))))&(~is_a_theorem(implies(skolem0013,implies(not(skolem0013),skolem0014)))|cn2)))),inference(shift_quantors,status(thm),[fof(c78,axiom,((~cn2|(![X36]:(![X37]:is_a_theorem(implies(X36,implies(not(X36),X37))))))&(~is_a_theorem(implies(skolem0013,implies(not(skolem0013),skolem0014)))|cn2)),inference(skolemize,status(esa),[c77])).])).
% 1.08/1.29 cnf(c80,axiom,~cn2|is_a_theorem(implies(X165,implies(not(X165),X166))),inference(split_conjunct,status(thm),[c79])).
% 1.08/1.29 cnf(c208,plain,is_a_theorem(implies(X171,implies(not(X171),X172))),inference(resolution,status(thm),[c80, c14])).
% 1.08/1.29 fof(luka_cn1,axiom,cn1,input).
% 1.08/1.29 cnf(c15,axiom,cn1,inference(split_conjunct,status(thm),[luka_cn1])).
% 1.08/1.29 fof(cn1,axiom,(cn1<=>(![P]:(![Q]:(![R]:is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))))))),input).
% 1.08/1.29 fof(c82,axiom,((~cn1|(![P]:(![Q]:(![R]:is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))))))&((?[P]:(?[Q]:(?[R]:~is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))))))|cn1)),inference(fof_nnf,status(thm),[cn1])).
% 1.08/1.29 fof(c83,axiom,((~cn1|(![X40]:(![X41]:(![X42]:is_a_theorem(implies(implies(X40,X41),implies(implies(X41,X42),implies(X40,X42))))))))&((?[X43]:(?[X44]:(?[X45]:~is_a_theorem(implies(implies(X43,X44),implies(implies(X44,X45),implies(X43,X45)))))))|cn1)),inference(variable_rename,status(thm),[c82])).
% 1.08/1.29 fof(c85,axiom,(![X40]:(![X41]:(![X42]:((~cn1|is_a_theorem(implies(implies(X40,X41),implies(implies(X41,X42),implies(X40,X42)))))&(~is_a_theorem(implies(implies(skolem0015,skolem0016),implies(implies(skolem0016,skolem0017),implies(skolem0015,skolem0017))))|cn1))))),inference(shift_quantors,status(thm),[fof(c84,axiom,((~cn1|(![X40]:(![X41]:(![X42]:is_a_theorem(implies(implies(X40,X41),implies(implies(X41,X42),implies(X40,X42))))))))&(~is_a_theorem(implies(implies(skolem0015,skolem0016),implies(implies(skolem0016,skolem0017),implies(skolem0015,skolem0017))))|cn1)),inference(skolemize,status(esa),[c83])).])).
% 1.08/1.29 cnf(c86,axiom,~cn1|is_a_theorem(implies(implies(X260,X262),implies(implies(X262,X261),implies(X260,X261)))),inference(split_conjunct,status(thm),[c85])).
% 1.08/1.29 cnf(c301,plain,is_a_theorem(implies(implies(X362,X363),implies(implies(X363,X361),implies(X362,X361)))),inference(resolution,status(thm),[c86, c15])).
% 1.08/1.29 cnf(c409,plain,~modus_ponens|~is_a_theorem(implies(X600,X601))|is_a_theorem(implies(implies(X601,X599),implies(X600,X599))),inference(resolution,status(thm),[c301, c197])).
% 1.08/1.29 cnf(c1151,plain,~modus_ponens|is_a_theorem(implies(implies(implies(not(X606),X608),X607),implies(X606,X607))),inference(resolution,status(thm),[c409, c208])).
% 1.08/1.29 cnf(c1157,plain,is_a_theorem(implies(implies(implies(not(X615),X614),X613),implies(X615,X613))),inference(resolution,status(thm),[c1151, c16])).
% 1.08/1.29 cnf(c1198,plain,~modus_ponens|~is_a_theorem(implies(implies(not(X632),X633),X634))|is_a_theorem(implies(X632,X634)),inference(resolution,status(thm),[c1157, c197])).
% 1.08/1.29 fof(luka_cn3,axiom,cn3,input).
% 1.08/1.29 cnf(c13,axiom,cn3,inference(split_conjunct,status(thm),[luka_cn3])).
% 1.08/1.29 fof(cn3,axiom,(cn3<=>(![P]:is_a_theorem(implies(implies(not(P),P),P)))),input).
% 1.08/1.29 fof(c70,axiom,((~cn3|(![P]:is_a_theorem(implies(implies(not(P),P),P))))&((?[P]:~is_a_theorem(implies(implies(not(P),P),P)))|cn3)),inference(fof_nnf,status(thm),[cn3])).
% 1.08/1.29 fof(c71,axiom,((~cn3|(![X34]:is_a_theorem(implies(implies(not(X34),X34),X34))))&((?[X35]:~is_a_theorem(implies(implies(not(X35),X35),X35)))|cn3)),inference(variable_rename,status(thm),[c70])).
% 1.08/1.29 fof(c73,axiom,(![X34]:((~cn3|is_a_theorem(implies(implies(not(X34),X34),X34)))&(~is_a_theorem(implies(implies(not(skolem0012),skolem0012),skolem0012))|cn3))),inference(shift_quantors,status(thm),[fof(c72,axiom,((~cn3|(![X34]:is_a_theorem(implies(implies(not(X34),X34),X34))))&(~is_a_theorem(implies(implies(not(skolem0012),skolem0012),skolem0012))|cn3)),inference(skolemize,status(esa),[c71])).])).
% 1.08/1.29 cnf(c74,axiom,~cn3|is_a_theorem(implies(implies(not(X163),X163),X163)),inference(split_conjunct,status(thm),[c73])).
% 1.08/1.29 cnf(c207,plain,is_a_theorem(implies(implies(not(X164),X164),X164)),inference(resolution,status(thm),[c74, c13])).
% 1.08/1.29 cnf(c1241,plain,~modus_ponens|is_a_theorem(implies(X635,X635)),inference(resolution,status(thm),[c1198, c207])).
% 1.08/1.29 cnf(c1246,plain,is_a_theorem(implies(X636,X636)),inference(resolution,status(thm),[c1241, c16])).
% 1.08/1.29 cnf(c5,plain,X132!=X131|~is_a_theorem(X132)|is_a_theorem(X131),eq_axiom).
% 1.08/1.29 cnf(reflexivity,axiom,X122=X122,eq_axiom).
% 1.08/1.29 cnf(c0,plain,X137!=X135|X136!=X134|implies(X137,X136)=implies(X135,X134),eq_axiom).
% 1.08/1.29 cnf(c204,plain,X197!=X198|implies(X197,X196)=implies(X198,X196),inference(resolution,status(thm),[c0, reflexivity])).
% 1.08/1.29 fof(hilbert_op_or,axiom,op_or,input).
% 1.08/1.29 cnf(c11,axiom,op_or,inference(split_conjunct,status(thm),[hilbert_op_or])).
% 1.08/1.29 fof(op_or,axiom,(op_or=>(![X]:(![Y]:or(X,Y)=not(and(not(X),not(Y)))))),input).
% 1.08/1.29 fof(c36,axiom,(~op_or|(![X]:(![Y]:or(X,Y)=not(and(not(X),not(Y)))))),inference(fof_nnf,status(thm),[op_or])).
% 1.08/1.29 fof(c38,axiom,(![X10]:(![X11]:(~op_or|or(X10,X11)=not(and(not(X10),not(X11)))))),inference(shift_quantors,status(thm),[fof(c37,axiom,(~op_or|(![X10]:(![X11]:or(X10,X11)=not(and(not(X10),not(X11)))))),inference(variable_rename,status(thm),[c36])).])).
% 1.08/1.29 cnf(c39,axiom,~op_or|or(X216,X217)=not(and(not(X216),not(X217))),inference(split_conjunct,status(thm),[c38])).
% 1.08/1.29 cnf(c221,plain,or(X232,X231)=not(and(not(X232),not(X231))),inference(resolution,status(thm),[c39, c11])).
% 1.08/1.29 cnf(transitivity,axiom,X128!=X127|X127!=X126|X128=X126,eq_axiom).
% 1.08/1.29 cnf(symmetry,axiom,X124!=X123|X123=X124,eq_axiom).
% 1.08/1.29 fof(hilbert_op_implies_and,axiom,op_implies_and,input).
% 1.08/1.29 cnf(c10,axiom,op_implies_and,inference(split_conjunct,status(thm),[hilbert_op_implies_and])).
% 1.08/1.29 fof(op_implies_and,axiom,(op_implies_and=>(![X]:(![Y]:implies(X,Y)=not(and(X,not(Y)))))),input).
% 1.08/1.29 fof(c28,axiom,(~op_implies_and|(![X]:(![Y]:implies(X,Y)=not(and(X,not(Y)))))),inference(fof_nnf,status(thm),[op_implies_and])).
% 1.08/1.29 fof(c30,axiom,(![X6]:(![X7]:(~op_implies_and|implies(X6,X7)=not(and(X6,not(X7)))))),inference(shift_quantors,status(thm),[fof(c29,axiom,(~op_implies_and|(![X6]:(![X7]:implies(X6,X7)=not(and(X6,not(X7)))))),inference(variable_rename,status(thm),[c28])).])).
% 1.08/1.29 cnf(c31,axiom,~op_implies_and|implies(X189,X190)=not(and(X189,not(X190))),inference(split_conjunct,status(thm),[c30])).
% 1.08/1.29 cnf(c212,plain,implies(X221,X220)=not(and(X221,not(X220))),inference(resolution,status(thm),[c31, c10])).
% 1.08/1.29 cnf(c232,plain,not(and(X223,not(X222)))=implies(X223,X222),inference(resolution,status(thm),[c212, symmetry])).
% 1.08/1.29 cnf(c241,plain,X283!=not(and(X285,not(X284)))|X283=implies(X285,X284),inference(resolution,status(thm),[c232, transitivity])).
% 1.08/1.29 cnf(c337,plain,or(X292,X291)=implies(not(X292),X291),inference(resolution,status(thm),[c241, c221])).
% 1.08/1.29 cnf(c345,plain,implies(or(X378,X379),X380)=implies(implies(not(X378),X379),X380),inference(resolution,status(thm),[c337, c204])).
% 1.08/1.29 cnf(c432,plain,~is_a_theorem(implies(or(X958,X960),X959))|is_a_theorem(implies(implies(not(X958),X960),X959)),inference(resolution,status(thm),[c345, c5])).
% 1.08/1.29 cnf(c2176,plain,is_a_theorem(implies(implies(not(X961),X962),or(X961,X962))),inference(resolution,status(thm),[c432, c1246])).
% 1.08/1.29 cnf(c2186,plain,~modus_ponens|is_a_theorem(implies(X964,or(X964,X963))),inference(resolution,status(thm),[c2176, c1198])).
% 1.08/1.29 cnf(c2189,plain,is_a_theorem(implies(X965,or(X965,X966))),inference(resolution,status(thm),[c2186, c16])).
% 1.08/1.29 cnf(c2195,plain,or_1,inference(resolution,status(thm),[c2189, c141])).
% 1.08/1.29 cnf(c2250,plain,$false,inference(resolution,status(thm),[c2195, c8])).
% 1.08/1.29 # SZS output end CNFRefutation
% 1.08/1.29
% 1.08/1.29 # Initial clauses : 81
% 1.08/1.29 # Processed clauses : 255
% 1.08/1.29 # Factors computed : 0
% 1.08/1.29 # Resolvents computed: 2050
% 1.08/1.29 # Tautologies deleted: 3
% 1.08/1.29 # Forward subsumed : 127
% 1.08/1.29 # Backward subsumed : 29
% 1.08/1.29 # -------- CPU Time ---------
% 1.08/1.29 # User time : 0.937 s
% 1.08/1.29 # System time : 0.022 s
% 1.08/1.29 # Total time : 0.959 s
%------------------------------------------------------------------------------