TSTP Solution File: NUM925+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM925+1 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:29:04 EST 2011
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP29959/NUM925+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29959/NUM925+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29959/NUM925+1.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 30073
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Garbage collection reclaimed 20 unused term cells.
% # Garbage collection reclaimed 337 unused term cells.
% # Garbage collection reclaimed 333 unused term cells.
% # Garbage collection reclaimed 249 unused term cells.
% # Garbage collection reclaimed 225 unused term cells.
% # Garbage collection reclaimed 204 unused term cells.
% # Garbage collection reclaimed 160 unused term cells.
% # Garbage collection reclaimed 134 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFLM21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <precrank20>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFLM21MD
% # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # plus_plus_int is AC
% # AC handling enabled
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 107
% # Removed by relevancy pruning : 0
% # Initial clauses : 152
% # Removed in clause preprocessing : 11
% # Initial clauses in saturation : 141
% # Processed clauses : 241
% # ...of these trivial : 21
% # ...subsumed : 28
% # ...remaining for further processing: 192
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 843
% # ...of the previous two non-trivial : 677
% # Contextual simplify-reflections : 0
% # Paramodulations : 836
% # Factorizations : 2
% # Equation resolutions : 5
% # Current number of processed clauses: 93
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 6
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 651
% # ...number of literals in the above : 1348
% # Clause-clause subsumption calls (NU) : 303
% # Rec. Clause-clause subsumption calls : 297
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 34
% # Indexed BW rewrite successes : 33
% # Backwards rewriting index : 87 leaves, 1.25+/-0.761 terms/leaf
% # Paramod-from index : 53 leaves, 1.13+/-0.390 terms/leaf
% # Paramod-into index : 73 leaves, 1.26+/-0.777 terms/leaf
% # SZS output start CNFRefutation.
% fof(21, axiom,pls=zero_zero_int,file('/tmp/SRASS.s.p', fact_78_Pls__def)).
% fof(23, axiom,![X16]:plus_plus_int(X16,pls)=X16,file('/tmp/SRASS.s.p', fact_80_add__Pls__right)).
% fof(26, axiom,![X16]:bit0(X16)=plus_plus_int(X16,X16),file('/tmp/SRASS.s.p', fact_83_Bit0__def)).
% fof(31, axiom,![X16]:bit1(X16)=plus_plus_int(plus_plus_int(one_one_int,X16),X16),file('/tmp/SRASS.s.p', fact_99_Bit1__def)).
% fof(36, axiom,ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),file('/tmp/SRASS.s.p', fact_0_n1pos)).
% fof(46, axiom,![X3]:![X5]:(power_power_int(X3,number_number_of_nat(X5))=zero_zero_int<=>(X3=zero_zero_int&~(number_number_of_nat(X5)=zero_zero_nat))),file('/tmp/SRASS.s.p', fact_92_power__eq__0__iff__number__of)).
% fof(95, axiom,~(ord_less_int(pls,pls)),file('/tmp/SRASS.s.p', fact_36_rel__simps_I2_J)).
% fof(107, conjecture,~(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int),file('/tmp/SRASS.s.p', conj_0)).
% fof(108, negated_conjecture,~(~(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int)),inference(assume_negation,[status(cth)],[107])).
% fof(113, plain,~(ord_less_int(pls,pls)),inference(fof_simplification,[status(thm)],[95,theory(equality)])).
% fof(114, negated_conjecture,power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int,inference(fof_simplification,[status(thm)],[108,theory(equality)])).
% cnf(172,plain,(pls=zero_zero_int),inference(split_conjunct,[status(thm)],[21])).
% fof(174, plain,![X17]:plus_plus_int(X17,pls)=X17,inference(variable_rename,[status(thm)],[23])).
% cnf(175,plain,(plus_plus_int(X1,pls)=X1),inference(split_conjunct,[status(thm)],[174])).
% fof(180, plain,![X17]:bit0(X17)=plus_plus_int(X17,X17),inference(variable_rename,[status(thm)],[26])).
% cnf(181,plain,(bit0(X1)=plus_plus_int(X1,X1)),inference(split_conjunct,[status(thm)],[180])).
% fof(190, plain,![X17]:bit1(X17)=plus_plus_int(plus_plus_int(one_one_int,X17),X17),inference(variable_rename,[status(thm)],[31])).
% cnf(191,plain,(bit1(X1)=plus_plus_int(plus_plus_int(one_one_int,X1),X1)),inference(split_conjunct,[status(thm)],[190])).
% cnf(206,plain,(ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n)))),inference(split_conjunct,[status(thm)],[36])).
% fof(224, plain,![X3]:![X5]:((~(power_power_int(X3,number_number_of_nat(X5))=zero_zero_int)|(X3=zero_zero_int&~(number_number_of_nat(X5)=zero_zero_nat)))&((~(X3=zero_zero_int)|number_number_of_nat(X5)=zero_zero_nat)|power_power_int(X3,number_number_of_nat(X5))=zero_zero_int)),inference(fof_nnf,[status(thm)],[46])).
% fof(225, plain,![X6]:![X7]:((~(power_power_int(X6,number_number_of_nat(X7))=zero_zero_int)|(X6=zero_zero_int&~(number_number_of_nat(X7)=zero_zero_nat)))&((~(X6=zero_zero_int)|number_number_of_nat(X7)=zero_zero_nat)|power_power_int(X6,number_number_of_nat(X7))=zero_zero_int)),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X6]:![X7]:(((X6=zero_zero_int|~(power_power_int(X6,number_number_of_nat(X7))=zero_zero_int))&(~(number_number_of_nat(X7)=zero_zero_nat)|~(power_power_int(X6,number_number_of_nat(X7))=zero_zero_int)))&((~(X6=zero_zero_int)|number_number_of_nat(X7)=zero_zero_nat)|power_power_int(X6,number_number_of_nat(X7))=zero_zero_int)),inference(distribute,[status(thm)],[225])).
% cnf(229,plain,(X1=zero_zero_int|power_power_int(X1,number_number_of_nat(X2))!=zero_zero_int),inference(split_conjunct,[status(thm)],[226])).
% cnf(347,plain,(~ord_less_int(pls,pls)),inference(split_conjunct,[status(thm)],[113])).
% cnf(387,negated_conjecture,(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int),inference(split_conjunct,[status(thm)],[114])).
% cnf(400,negated_conjecture,(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls))))=zero_zero_int),inference(rw,[status(thm)],[387,181,theory(equality)]),['unfolding']).
% cnf(451,negated_conjecture,(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))=zero_zero_int),inference(rw,[status(thm)],[inference(rw,[status(thm)],[400,191,theory(equality)]),191,theory(equality)]),['unfolding']).
% cnf(515,plain,(pls=X1|power_power_int(X1,number_number_of_nat(X2))!=zero_zero_int),inference(rw,[status(thm)],[229,172,theory(equality)])).
% cnf(516,plain,(pls=X1|power_power_int(X1,number_number_of_nat(X2))!=pls),inference(rw,[status(thm)],[515,172,theory(equality)])).
% cnf(519,plain,(ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n)))),inference(rw,[status(thm)],[206,172,theory(equality)])).
% cnf(562,negated_conjecture,(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int)))=zero_zero_int),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[451,175,theory(equality)]),175,theory(equality)]),175,theory(equality)]),175,theory(equality)])).
% cnf(563,negated_conjecture,(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int)))=pls),inference(rw,[status(thm)],[562,172,theory(equality)])).
% cnf(725,negated_conjecture,(pls=plus_plus_int(one_one_int,semiri1621563631at_int(n))),inference(spm,[status(thm)],[516,563,theory(equality)])).
% cnf(1805,plain,(ord_less_int(pls,pls)),inference(rw,[status(thm)],[519,725,theory(equality)])).
% cnf(1806,plain,($false),inference(sr,[status(thm)],[1805,347,theory(equality)])).
% cnf(1807,plain,($false),1806,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.10 CPU 0.22 WC
% FINAL PrfWatch: 0.10 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP29959/NUM925+1.tptp
% WARNING: TreeLimitedRun lost 0.06s, total lost is 0.06s
%
%------------------------------------------------------------------------------