TSTP Solution File: NUM926+5 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM926+5 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 00:34:37 EST 2011
% Result : Theorem 1.33s
% Output : Solution 1.33s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP13635/NUM926+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13635/NUM926+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13635/NUM926+5.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.4/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 13749
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 17 unused term cells.
% # Garbage collection reclaimed 590 unused term cells.
% # Garbage collection reclaimed 478 unused term cells.
% # Garbage collection reclaimed 437 unused term cells.
% # Garbage collection reclaimed 392 unused term cells.
% # Garbage collection reclaimed 339 unused term cells.
% # Garbage collection reclaimed 337 unused term cells.
% # Garbage collection reclaimed 220 unused term cells.
% # Garbage collection reclaimed 183 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFLM31MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFLM31MD
% # Auto-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 142
% # Removed by relevancy pruning : 0
% # Initial clauses : 185
% # Removed in clause preprocessing : 5
% # Initial clauses in saturation : 180
% # Processed clauses : 276
% # ...of these trivial : 6
% # ...subsumed : 91
% # ...remaining for further processing: 178
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 14
% # Generated clauses : 1599
% # ...of the previous two non-trivial : 1350
% # Contextual simplify-reflections : 2
% # Paramodulations : 1592
% # Factorizations : 4
% # Equation resolutions : 3
% # Current number of processed clauses: 163
% # Positive orientable unit clauses: 38
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 19
% # Non-unit-clauses : 99
% # Current number of unprocessed clauses: 1190
% # ...number of literals in the above : 2072
% # Clause-clause subsumption calls (NU) : 173
% # Rec. Clause-clause subsumption calls : 163
% # Unit Clause-clause subsumption calls : 46
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 65
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index : 136 leaves, 1.91+/-1.976 terms/leaf
% # Paramod-from index : 75 leaves, 1.49+/-0.870 terms/leaf
% # Paramod-into index : 123 leaves, 1.70+/-1.551 terms/leaf
% # SZS output start CNFRefutation.
% fof(14, axiom,![X5]:![X11]:times_times(int,X5,X11)=times_times(int,X11,X5),file('/tmp/SRASS.s.p', fact_85_zmult__commute)).
% fof(15, axiom,![X12]:number_number_of(int,X12)=X12,file('/tmp/SRASS.s.p', fact_86_number__of__is__id)).
% fof(18, axiom,![X5]:![X11]:plus_plus(int,X5,X11)=plus_plus(int,X11,X5),file('/tmp/SRASS.s.p', fact_89_zadd__commute)).
% fof(26, axiom,(t=one_one(int)=>?[X16]:?[X17]:plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),file('/tmp/SRASS.s.p', fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)).
% fof(35, axiom,(ord_less(int,one_one(int),t)=>?[X16]:?[X17]:plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),file('/tmp/SRASS.s.p', fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)).
% fof(124, axiom,ord_less_eq(int,one_one(int),t),file('/tmp/SRASS.s.p', fact_0_tpos)).
% fof(128, axiom,![X39]:![X29]:(ord_less(int,X39,X29)<=>(ord_less_eq(int,X39,X29)&~(X39=X29))),file('/tmp/SRASS.s.p', fact_22_zless__le)).
% fof(142, conjecture,?[X16]:?[X17]:plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),file('/tmp/SRASS.s.p', conj_0)).
% fof(143, negated_conjecture,~(?[X16]:?[X17]:plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(assume_negation,[status(cth)],[142])).
% fof(174, plain,![X12]:![X13]:times_times(int,X12,X13)=times_times(int,X13,X12),inference(variable_rename,[status(thm)],[14])).
% cnf(175,plain,(times_times(int,X1,X2)=times_times(int,X2,X1)),inference(split_conjunct,[status(thm)],[174])).
% fof(176, plain,![X13]:number_number_of(int,X13)=X13,inference(variable_rename,[status(thm)],[15])).
% cnf(177,plain,(number_number_of(int,X1)=X1),inference(split_conjunct,[status(thm)],[176])).
% fof(182, plain,![X12]:![X13]:plus_plus(int,X12,X13)=plus_plus(int,X13,X12),inference(variable_rename,[status(thm)],[18])).
% cnf(183,plain,(plus_plus(int,X1,X2)=plus_plus(int,X2,X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(196, plain,(~(t=one_one(int))|?[X16]:?[X17]:plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(fof_nnf,[status(thm)],[26])).
% fof(197, plain,(~(t=one_one(int))|?[X18]:?[X19]:plus_plus(int,power_power(int,X18,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X19,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(variable_rename,[status(thm)],[196])).
% fof(198, plain,(~(t=one_one(int))|plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(skolemize,[status(esa)],[197])).
% cnf(199,plain,(plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))|t!=one_one(int)),inference(split_conjunct,[status(thm)],[198])).
% fof(227, plain,(~(ord_less(int,one_one(int),t))|?[X16]:?[X17]:plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(fof_nnf,[status(thm)],[35])).
% fof(228, plain,(~(ord_less(int,one_one(int),t))|?[X18]:?[X19]:plus_plus(int,power_power(int,X18,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X19,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(variable_rename,[status(thm)],[227])).
% fof(229, plain,(~(ord_less(int,one_one(int),t))|plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(skolemize,[status(esa)],[228])).
% cnf(230,plain,(plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))|~ord_less(int,one_one(int),t)),inference(split_conjunct,[status(thm)],[229])).
% cnf(513,plain,(ord_less_eq(int,one_one(int),t)),inference(split_conjunct,[status(thm)],[124])).
% fof(519, plain,![X39]:![X29]:((~(ord_less(int,X39,X29))|(ord_less_eq(int,X39,X29)&~(X39=X29)))&((~(ord_less_eq(int,X39,X29))|X39=X29)|ord_less(int,X39,X29))),inference(fof_nnf,[status(thm)],[128])).
% fof(520, plain,![X40]:![X41]:((~(ord_less(int,X40,X41))|(ord_less_eq(int,X40,X41)&~(X40=X41)))&((~(ord_less_eq(int,X40,X41))|X40=X41)|ord_less(int,X40,X41))),inference(variable_rename,[status(thm)],[519])).
% fof(521, plain,![X40]:![X41]:(((ord_less_eq(int,X40,X41)|~(ord_less(int,X40,X41)))&(~(X40=X41)|~(ord_less(int,X40,X41))))&((~(ord_less_eq(int,X40,X41))|X40=X41)|ord_less(int,X40,X41))),inference(distribute,[status(thm)],[520])).
% cnf(522,plain,(ord_less(int,X1,X2)|X1=X2|~ord_less_eq(int,X1,X2)),inference(split_conjunct,[status(thm)],[521])).
% fof(574, negated_conjecture,![X16]:![X17]:~(plus_plus(int,power_power(int,X16,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X17,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(fof_nnf,[status(thm)],[143])).
% fof(575, negated_conjecture,![X18]:![X19]:~(plus_plus(int,power_power(int,X18,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X19,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(variable_rename,[status(thm)],[574])).
% cnf(576,negated_conjecture,(plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(split_conjunct,[status(thm)],[575])).
% cnf(714,plain,(one_one(int)=t|ord_less(int,one_one(int),t)),inference(spm,[status(thm)],[522,513,theory(equality)])).
% cnf(3101,negated_conjecture,(plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[576,177,theory(equality)]),175,theory(equality)]),183,theory(equality)])).
% cnf(3164,plain,(plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))|one_one(int)!=t),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[199,177,theory(equality)]),175,theory(equality)]),183,theory(equality)])).
% cnf(3165,plain,(one_one(int)!=t),inference(sr,[status(thm)],[3164,3101,theory(equality)])).
% cnf(3251,plain,(plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))|~ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[230,177,theory(equality)]),175,theory(equality)]),183,theory(equality)])).
% cnf(3252,plain,(~ord_less(int,one_one(int),t)),inference(sr,[status(thm)],[3251,3101,theory(equality)])).
% cnf(4313,plain,(ord_less(int,one_one(int),t)),inference(sr,[status(thm)],[714,3165,theory(equality)])).
% cnf(4314,plain,($false),inference(sr,[status(thm)],[4313,3252,theory(equality)])).
% cnf(4315,plain,($false),4314,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.18 CPU 0.29 WC
% FINAL PrfWatch: 0.18 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP13635/NUM926+5.tptp
%
%------------------------------------------------------------------------------