TSTP Solution File: NUM298+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n016.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 : Mon Jul 18 13:35:35 EDT 2022
% Result : Theorem 1.53s 1.69s
% Output : Refutation 1.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n016.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 : Fri Jul 8 02:04:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.53/1.69 # Version: 1.3
% 1.53/1.69 # SZS status Theorem
% 1.53/1.69 # SZS output start CNFRefutation
% 1.53/1.69 fof(n2_not_less_nn2,conjecture,(~less(n2,nn2)),input).
% 1.53/1.69 fof(c14,negated_conjecture,(~(~less(n2,nn2))),inference(assume_negation,status(cth),[n2_not_less_nn2])).
% 1.53/1.69 fof(c15,negated_conjecture,less(n2,nn2),inference(fof_simplification,status(thm),[c14])).
% 1.53/1.69 cnf(c16,negated_conjecture,less(n2,nn2),inference(split_conjunct,status(thm),[c15])).
% 1.53/1.69 fof(less_property,axiom,(![X]:(![Y]:(less(X,Y)<=>((~less(Y,X))&Y!=X)))),input).
% 1.53/1.69 fof(c200,axiom,(![X]:(![Y]:(less(X,Y)<=>(~less(Y,X)&Y!=X)))),inference(fof_simplification,status(thm),[less_property])).
% 1.53/1.69 fof(c201,axiom,(![X]:(![Y]:((~less(X,Y)|(~less(Y,X)&Y!=X))&((less(Y,X)|Y=X)|less(X,Y))))),inference(fof_nnf,status(thm),[c200])).
% 1.53/1.69 fof(c202,axiom,((![X]:(![Y]:(~less(X,Y)|(~less(Y,X)&Y!=X))))&(![X]:(![Y]:((less(Y,X)|Y=X)|less(X,Y))))),inference(shift_quantors,status(thm),[c201])).
% 1.53/1.69 fof(c204,axiom,(![X98]:(![X99]:(![X100]:(![X101]:((~less(X98,X99)|(~less(X99,X98)&X99!=X98))&((less(X101,X100)|X101=X100)|less(X100,X101))))))),inference(shift_quantors,status(thm),[fof(c203,axiom,((![X98]:(![X99]:(~less(X98,X99)|(~less(X99,X98)&X99!=X98))))&(![X100]:(![X101]:((less(X101,X100)|X101=X100)|less(X100,X101))))),inference(variable_rename,status(thm),[c202])).])).
% 1.53/1.69 fof(c205,axiom,(![X98]:(![X99]:(![X100]:(![X101]:(((~less(X98,X99)|~less(X99,X98))&(~less(X98,X99)|X99!=X98))&((less(X101,X100)|X101=X100)|less(X100,X101))))))),inference(distribute,status(thm),[c204])).
% 1.53/1.69 cnf(c206,axiom,~less(X144,X145)|~less(X145,X144),inference(split_conjunct,status(thm),[c205])).
% 1.53/1.69 cnf(c521,plain,~less(nn2,n2),inference(resolution,status(thm),[c206, c16])).
% 1.53/1.69 fof(rdnn2,axiom,rdn_translate(nn2,rdn_neg(rdnn(n2))),input).
% 1.53/1.69 cnf(c386,axiom,rdn_translate(nn2,rdn_neg(rdnn(n2))),inference(split_conjunct,status(thm),[rdnn2])).
% 1.53/1.69 fof(rdn2,axiom,rdn_translate(n2,rdn_pos(rdnn(n2))),input).
% 1.53/1.69 cnf(c513,axiom,rdn_translate(n2,rdn_pos(rdnn(n2))),inference(split_conjunct,status(thm),[rdn2])).
% 1.53/1.69 fof(less_entry_point_neg_pos,axiom,(![X]:(![Y]:(![RDN_X]:(![RDN_Y]:((rdn_translate(X,rdn_neg(RDN_X))&rdn_translate(Y,rdn_pos(RDN_Y)))=>less(X,Y)))))),input).
% 1.53/1.69 fof(c214,axiom,(![X]:(![Y]:(![RDN_X]:(![RDN_Y]:((~rdn_translate(X,rdn_neg(RDN_X))|~rdn_translate(Y,rdn_pos(RDN_Y)))|less(X,Y)))))),inference(fof_nnf,status(thm),[less_entry_point_neg_pos])).
% 1.53/1.69 fof(c215,axiom,(![X]:(![Y]:(((![RDN_X]:~rdn_translate(X,rdn_neg(RDN_X)))|(![RDN_Y]:~rdn_translate(Y,rdn_pos(RDN_Y))))|less(X,Y)))),inference(shift_quantors,status(thm),[c214])).
% 1.53/1.69 fof(c217,axiom,(![X106]:(![X107]:(![X108]:(![X109]:((~rdn_translate(X106,rdn_neg(X108))|~rdn_translate(X107,rdn_pos(X109)))|less(X106,X107)))))),inference(shift_quantors,status(thm),[fof(c216,axiom,(![X106]:(![X107]:(((![X108]:~rdn_translate(X106,rdn_neg(X108)))|(![X109]:~rdn_translate(X107,rdn_pos(X109))))|less(X106,X107)))),inference(variable_rename,status(thm),[c215])).])).
% 1.53/1.69 cnf(c218,axiom,~rdn_translate(X357,rdn_neg(X356))|~rdn_translate(X355,rdn_pos(X358))|less(X357,X355),inference(split_conjunct,status(thm),[c217])).
% 1.53/1.69 cnf(c766,plain,~rdn_translate(X375,rdn_neg(X376))|less(X375,n2),inference(resolution,status(thm),[c218, c513])).
% 1.53/1.69 cnf(c1500,plain,less(nn2,n2),inference(resolution,status(thm),[c766, c386])).
% 1.53/1.69 cnf(c1531,plain,$false,inference(resolution,status(thm),[c1500, c521])).
% 1.53/1.69 # SZS output end CNFRefutation
% 1.53/1.69
% 1.53/1.69 # Initial clauses : 424
% 1.53/1.69 # Processed clauses : 431
% 1.53/1.69 # Factors computed : 4
% 1.53/1.69 # Resolvents computed: 1012
% 1.53/1.69 # Tautologies deleted: 11
% 1.53/1.69 # Forward subsumed : 123
% 1.53/1.69 # Backward subsumed : 1
% 1.53/1.69 # -------- CPU Time ---------
% 1.53/1.69 # User time : 1.336 s
% 1.53/1.69 # System time : 0.017 s
% 1.53/1.69 # Total time : 1.353 s
%------------------------------------------------------------------------------