TSTP Solution File: LCL459+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n026.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:42 EDT 2022
% Result : Theorem 1.04s 1.26s
% Output : Refutation 1.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 16:54:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.04/1.26 # Version: 1.3
% 1.04/1.26 # SZS status Theorem
% 1.04/1.26 # SZS output start CNFRefutation
% 1.04/1.26 fof(rosser_kn1,conjecture,kn1,input).
% 1.04/1.26 fof(c6,negated_conjecture,(~kn1),inference(assume_negation,status(cth),[rosser_kn1])).
% 1.04/1.26 fof(c7,negated_conjecture,~kn1,inference(fof_simplification,status(thm),[c6])).
% 1.04/1.26 cnf(c8,negated_conjecture,~kn1,inference(split_conjunct,status(thm),[c7])).
% 1.04/1.26 fof(kn1,axiom,(kn1<=>(![P]:is_a_theorem(implies(P,and(P,P))))),input).
% 1.04/1.26 fof(c110,axiom,((~kn1|(![P]:is_a_theorem(implies(P,and(P,P)))))&((?[P]:~is_a_theorem(implies(P,and(P,P))))|kn1)),inference(fof_nnf,status(thm),[kn1])).
% 1.04/1.26 fof(c111,axiom,((~kn1|(![X56]:is_a_theorem(implies(X56,and(X56,X56)))))&((?[X57]:~is_a_theorem(implies(X57,and(X57,X57))))|kn1)),inference(variable_rename,status(thm),[c110])).
% 1.04/1.26 fof(c113,axiom,(![X56]:((~kn1|is_a_theorem(implies(X56,and(X56,X56))))&(~is_a_theorem(implies(skolem0023,and(skolem0023,skolem0023)))|kn1))),inference(shift_quantors,status(thm),[fof(c112,axiom,((~kn1|(![X56]:is_a_theorem(implies(X56,and(X56,X56)))))&(~is_a_theorem(implies(skolem0023,and(skolem0023,skolem0023)))|kn1)),inference(skolemize,status(esa),[c111])).])).
% 1.04/1.26 cnf(c115,axiom,~is_a_theorem(implies(skolem0023,and(skolem0023,skolem0023)))|kn1,inference(split_conjunct,status(thm),[c113])).
% 1.04/1.26 fof(hilbert_modus_ponens,axiom,modus_ponens,input).
% 1.04/1.26 cnf(c26,axiom,modus_ponens,inference(split_conjunct,status(thm),[hilbert_modus_ponens])).
% 1.04/1.26 fof(hilbert_and_3,axiom,and_3,input).
% 1.04/1.26 cnf(c19,axiom,and_3,inference(split_conjunct,status(thm),[hilbert_and_3])).
% 1.04/1.26 fof(and_3,axiom,(and_3<=>(![X]:(![Y]:is_a_theorem(implies(X,implies(Y,and(X,Y))))))),input).
% 1.04/1.26 fof(c152,axiom,((~and_3|(![X]:(![Y]:is_a_theorem(implies(X,implies(Y,and(X,Y)))))))&((?[X]:(?[Y]:~is_a_theorem(implies(X,implies(Y,and(X,Y))))))|and_3)),inference(fof_nnf,status(thm),[and_3])).
% 1.04/1.26 fof(c153,axiom,((~and_3|(![X84]:(![X85]:is_a_theorem(implies(X84,implies(X85,and(X84,X85)))))))&((?[X86]:(?[X87]:~is_a_theorem(implies(X86,implies(X87,and(X86,X87))))))|and_3)),inference(variable_rename,status(thm),[c152])).
% 1.04/1.26 fof(c155,axiom,(![X84]:(![X85]:((~and_3|is_a_theorem(implies(X84,implies(X85,and(X84,X85)))))&(~is_a_theorem(implies(skolem0037,implies(skolem0038,and(skolem0037,skolem0038))))|and_3)))),inference(shift_quantors,status(thm),[fof(c154,axiom,((~and_3|(![X84]:(![X85]:is_a_theorem(implies(X84,implies(X85,and(X84,X85)))))))&(~is_a_theorem(implies(skolem0037,implies(skolem0038,and(skolem0037,skolem0038))))|and_3)),inference(skolemize,status(esa),[c153])).])).
% 1.04/1.26 cnf(c156,axiom,~and_3|is_a_theorem(implies(X204,implies(X205,and(X204,X205)))),inference(split_conjunct,status(thm),[c155])).
% 1.04/1.26 cnf(c231,plain,is_a_theorem(implies(X207,implies(X206,and(X207,X206)))),inference(resolution,status(thm),[c156, c19])).
% 1.04/1.26 fof(modus_ponens,axiom,(modus_ponens<=>(![X]:(![Y]:((is_a_theorem(X)&is_a_theorem(implies(X,Y)))=>is_a_theorem(Y))))),input).
% 1.04/1.26 fof(c202,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.04/1.26 fof(c203,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),[c202])).
% 1.04/1.26 fof(c205,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(c204,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),[c203])).])).
% 1.04/1.26 fof(c206,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),[c205])).
% 1.04/1.26 cnf(c207,axiom,~modus_ponens|~is_a_theorem(X211)|~is_a_theorem(implies(X211,X212))|is_a_theorem(X212),inference(split_conjunct,status(thm),[c206])).
% 1.04/1.26 fof(hilbert_implies_2,axiom,implies_2,input).
% 1.04/1.26 cnf(c23,axiom,implies_2,inference(split_conjunct,status(thm),[hilbert_implies_2])).
% 1.04/1.26 fof(implies_2,axiom,(implies_2<=>(![X]:(![Y]:is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))),input).
% 1.04/1.26 fof(c176,axiom,((~implies_2|(![X]:(![Y]:is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))))))&((?[X]:(?[Y]:~is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))|implies_2)),inference(fof_nnf,status(thm),[implies_2])).
% 1.04/1.26 fof(c177,axiom,((~implies_2|(![X102]:(![X103]:is_a_theorem(implies(implies(X102,implies(X102,X103)),implies(X102,X103))))))&((?[X104]:(?[X105]:~is_a_theorem(implies(implies(X104,implies(X104,X105)),implies(X104,X105)))))|implies_2)),inference(variable_rename,status(thm),[c176])).
% 1.04/1.26 fof(c179,axiom,(![X102]:(![X103]:((~implies_2|is_a_theorem(implies(implies(X102,implies(X102,X103)),implies(X102,X103))))&(~is_a_theorem(implies(implies(skolem0046,implies(skolem0046,skolem0047)),implies(skolem0046,skolem0047)))|implies_2)))),inference(shift_quantors,status(thm),[fof(c178,axiom,((~implies_2|(![X102]:(![X103]:is_a_theorem(implies(implies(X102,implies(X102,X103)),implies(X102,X103))))))&(~is_a_theorem(implies(implies(skolem0046,implies(skolem0046,skolem0047)),implies(skolem0046,skolem0047)))|implies_2)),inference(skolemize,status(esa),[c177])).])).
% 1.04/1.26 cnf(c180,axiom,~implies_2|is_a_theorem(implies(implies(X455,implies(X455,X456)),implies(X455,X456))),inference(split_conjunct,status(thm),[c179])).
% 1.04/1.26 cnf(c509,plain,is_a_theorem(implies(implies(X458,implies(X458,X457)),implies(X458,X457))),inference(resolution,status(thm),[c180, c23])).
% 1.04/1.26 cnf(c512,plain,~modus_ponens|~is_a_theorem(implies(X979,implies(X979,X980)))|is_a_theorem(implies(X979,X980)),inference(resolution,status(thm),[c509, c207])).
% 1.04/1.26 cnf(c985,plain,~modus_ponens|is_a_theorem(implies(X994,and(X994,X994))),inference(resolution,status(thm),[c512, c231])).
% 1.04/1.26 cnf(c1014,plain,is_a_theorem(implies(X995,and(X995,X995))),inference(resolution,status(thm),[c985, c26])).
% 1.04/1.26 cnf(c1017,plain,kn1,inference(resolution,status(thm),[c1014, c115])).
% 1.04/1.26 cnf(c1022,plain,$false,inference(resolution,status(thm),[c1017, c8])).
% 1.04/1.26 # SZS output end CNFRefutation
% 1.04/1.26
% 1.04/1.26 # Initial clauses : 91
% 1.04/1.26 # Processed clauses : 291
% 1.04/1.26 # Factors computed : 0
% 1.04/1.26 # Resolvents computed: 812
% 1.04/1.26 # Tautologies deleted: 3
% 1.04/1.26 # Forward subsumed : 51
% 1.04/1.26 # Backward subsumed : 94
% 1.04/1.26 # -------- CPU Time ---------
% 1.04/1.26 # User time : 0.867 s
% 1.04/1.26 # System time : 0.019 s
% 1.04/1.26 # Total time : 0.886 s
%------------------------------------------------------------------------------