TSTP Solution File: NUM924+5 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM924+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 : art05.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:28:36 EST 2011
% Result : Theorem 1.46s
% Output : Solution 1.46s
% 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/SystemOnTPTP2099/NUM924+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2099/NUM924+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2099/NUM924+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 2213
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Garbage collection reclaimed 30 unused term cells.
% # Garbage collection reclaimed 603 unused term cells.
% # Garbage collection reclaimed 496 unused term cells.
% # Garbage collection reclaimed 466 unused term cells.
% # Garbage collection reclaimed 396 unused term cells.
% # Garbage collection reclaimed 348 unused term cells.
% # Garbage collection reclaimed 329 unused term cells.
% # Garbage collection reclaimed 290 unused term cells.
% # Garbage collection reclaimed 233 unused term cells.
% # Garbage collection reclaimed 234 unused term cells.
% # Garbage collection reclaimed 66 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFSLM31MD
% # 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 GHSMNFSLM31MD
% # Auto-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 155
% # Removed by relevancy pruning : 0
% # Initial clauses : 215
% # Removed in clause preprocessing : 6
% # Initial clauses in saturation : 209
% # Processed clauses : 219
% # ...of these trivial : 8
% # ...subsumed : 14
% # ...remaining for further processing: 197
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 12
% # Generated clauses : 1
% # ...of the previous two non-trivial : 10
% # Contextual simplify-reflections : 1
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 183
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 129
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 177
% # Rec. Clause-clause subsumption calls : 139
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 64
% # Indexed BW rewrite successes : 29
% # Backwards rewriting index : 147 leaves, 1.71+/-1.634 terms/leaf
% # Paramod-from index : 91 leaves, 1.33+/-0.727 terms/leaf
% # Paramod-into index : 129 leaves, 1.59+/-1.280 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:number_number_of(int,X1)=X1,file('/tmp/SRASS.s.p', fact_22_number__of__is__id)).
% fof(17, axiom,![X14]:![X6]:plus_plus(int,X14,X6)=plus_plus(int,X6,X14),file('/tmp/SRASS.s.p', fact_96_zadd__commute)).
% fof(18, axiom,zero_zero(int)=number_number_of(int,pls),file('/tmp/SRASS.s.p', fact_97_zero__is__num__zero)).
% fof(54, axiom,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int))=times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),file('/tmp/SRASS.s.p', fact_3_t)).
% fof(62, axiom,ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),file('/tmp/SRASS.s.p', fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096)).
% fof(80, axiom,![X6]:times_times(int,pls,X6)=pls,file('/tmp/SRASS.s.p', fact_62_mult__Pls)).
% fof(111, axiom,![X14]:![X6]:times_times(int,X14,X6)=times_times(int,X6,X14),file('/tmp/SRASS.s.p', fact_23_zmult__commute)).
% fof(155, conjecture,ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),file('/tmp/SRASS.s.p', conj_0)).
% fof(156, negated_conjecture,~(ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int))),inference(assume_negation,[status(cth)],[155])).
% fof(162, negated_conjecture,~(ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int))),inference(fof_simplification,[status(thm)],[156,theory(equality)])).
% fof(163, plain,![X2]:number_number_of(int,X2)=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(164,plain,(number_number_of(int,X1)=X1),inference(split_conjunct,[status(thm)],[163])).
% fof(207, plain,![X15]:![X16]:plus_plus(int,X15,X16)=plus_plus(int,X16,X15),inference(variable_rename,[status(thm)],[17])).
% cnf(208,plain,(plus_plus(int,X1,X2)=plus_plus(int,X2,X1)),inference(split_conjunct,[status(thm)],[207])).
% cnf(209,plain,(zero_zero(int)=number_number_of(int,pls)),inference(split_conjunct,[status(thm)],[18])).
% cnf(332,plain,(plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int))=times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),inference(split_conjunct,[status(thm)],[54])).
% cnf(359,plain,(ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)))),inference(split_conjunct,[status(thm)],[62])).
% fof(408, plain,![X7]:times_times(int,pls,X7)=pls,inference(variable_rename,[status(thm)],[80])).
% cnf(409,plain,(times_times(int,pls,X1)=pls),inference(split_conjunct,[status(thm)],[408])).
% fof(517, plain,![X15]:![X16]:times_times(int,X15,X16)=times_times(int,X16,X15),inference(variable_rename,[status(thm)],[111])).
% cnf(518,plain,(times_times(int,X1,X2)=times_times(int,X2,X1)),inference(split_conjunct,[status(thm)],[517])).
% cnf(640,negated_conjecture,(~ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int))),inference(split_conjunct,[status(thm)],[162])).
% cnf(644,negated_conjecture,(~ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),number_number_of(int,pls))),inference(rw,[status(thm)],[640,209,theory(equality)])).
% cnf(648,negated_conjecture,(~ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls)),inference(rw,[status(thm)],[644,164,theory(equality)])).
% cnf(680,plain,(times_times(int,plus_plus(int,one_one(int),times_times(int,bit0(bit0(bit1(pls))),m)),t)=plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[332,164,theory(equality)]),208,theory(equality)])).
% cnf(681,plain,(times_times(int,plus_plus(int,one_one(int),times_times(int,bit0(bit0(bit1(pls))),m)),t)=plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls)))))),inference(rw,[status(thm)],[680,208,theory(equality)])).
% cnf(685,plain,(times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))=plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[681,518,theory(equality)]),518,theory(equality)])).
% cnf(687,plain,(ord_less(int,times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))),pls)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[359,164,theory(equality)]),518,theory(equality)]),208,theory(equality)]),518,theory(equality)]),164,theory(equality)]),518,theory(equality)]),208,theory(equality)]),209,theory(equality)]),164,theory(equality)]),518,theory(equality)]),409,theory(equality)])).
% cnf(688,negated_conjecture,(~ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls)),inference(rw,[status(thm)],[648,208,theory(equality)])).
% cnf(692,plain,(ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls)),inference(rw,[status(thm)],[687,685,theory(equality)])).
% cnf(693,plain,($false),inference(sr,[status(thm)],[692,688,theory(equality)])).
% cnf(694,plain,($false),693,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.10 CPU 0.21 WC
% FINAL PrfWatch: 0.10 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP2099/NUM924+5.tptp
% WARNING: TreeLimitedRun lost 0.10s, total lost is 0.10s
%
%------------------------------------------------------------------------------