TSTP Solution File: NUM925+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM925+3 : 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:29:19 EST 2011
% Result : Theorem 156.13s
% Output : Solution 156.13s
% 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/SystemOnTPTP2385/NUM925+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2385/NUM925+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2385/NUM925+3.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 2732
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 392 unused term cells.
% # Garbage collection reclaimed 7504 unused term cells.
% # Garbage collection reclaimed 5735 unused term cells.
% # Garbage collection reclaimed 5446 unused term cells.
% # Garbage collection reclaimed 4457 unused term cells.
% # Garbage collection reclaimed 3727 unused term cells.
% # Garbage collection reclaimed 3067 unused term cells.
% # Garbage collection reclaimed 2634 unused term cells.
% # Garbage collection reclaimed 2357 unused term cells.
% # Garbage collection reclaimed 424 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNSSLM31LD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNSSLM31LD
% # Auto-Mode selected heuristic G_E___008_C45_F1_AE_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # plus_plus_int is AC
% # times_times_int is AC
% # plus_plus_nat is AC
% # times_times_nat is AC
% # plus_plus_real is AC
% # times_times_real is AC
% # AC handling enabled
% # Garbage collection reclaimed 2124 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 267 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 278 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Presaturation interreduction done
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 1233
% # Removed by relevancy pruning : 0
% # Initial clauses : 1809
% # Removed in clause preprocessing : 121
% # Initial clauses in saturation : 1688
% # Processed clauses : 5204
% # ...of these trivial : 189
% # ...subsumed : 2725
% # ...remaining for further processing: 2290
% # Other redundant clauses eliminated : 37
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 348
% # Generated clauses : 10527
% # ...of the previous two non-trivial : 9213
% # Contextual simplify-reflections : 161
% # Paramodulations : 10480
% # Factorizations : 1
% # Equation resolutions : 46
% # Current number of processed clauses: 794
% # Positive orientable unit clauses: 322
% # Positive unorientable unit clauses: 19
% # Negative unit clauses : 130
% # Non-unit-clauses : 323
% # Current number of unprocessed clauses: 6140
% # ...number of literals in the above : 9818
% # Clause-clause subsumption calls (NU) : 131355
% # Rec. Clause-clause subsumption calls : 112395
% # Unit Clause-clause subsumption calls : 1584
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2348
% # Indexed BW rewrite successes : 1409
% # Backwards rewriting index : 770 leaves, 1.44+/-1.739 terms/leaf
% # Paramod-from index : 353 leaves, 1.22+/-0.786 terms/leaf
% # Paramod-into index : 713 leaves, 1.44+/-1.752 terms/leaf
% # SZS output start CNFRefutation.
% fof(20, axiom,bit0(pls)=pls,file('/tmp/SRASS.s.p', fact_97_Bit0__Pls)).
% fof(21, axiom,pls=zero_zero_int,file('/tmp/SRASS.s.p', fact_98_Pls__def)).
% fof(26, axiom,![X16]:bit0(X16)=plus_plus_int(X16,X16),file('/tmp/SRASS.s.p', fact_103_Bit0__def)).
% fof(37, axiom,![X18]:![X19]:(is_int(X19)=>(~(X19=zero_zero_int)=>~(hAPP_nat_int(power_power_int(X19),X18)=zero_zero_int))),file('/tmp/SRASS.s.p', fact_231_field__power__not__zero)).
% fof(61, axiom,is_int(one_one_int),file('/tmp/SRASS.s.p', gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint)).
% fof(62, axiom,![X59]:![X60]:((is_int(X59)&is_int(X60))=>is_int(plus_plus_int(X59,X60))),file('/tmp/SRASS.s.p', gsy_c_Groups_Oplus__class_Oplus_000tc__Int__Oint)).
% fof(67, axiom,![X59]:![X60]:is_int(hAPP_nat_int(X59,X60)),file('/tmp/SRASS.s.p', gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint)).
% fof(75, axiom,plus_plus_int(one_one_int,one_one_int)=number_number_of_int(bit0(bit1(pls))),file('/tmp/SRASS.s.p', fact_16_one__add__one__is__two)).
% fof(163, axiom,![X16]:succ(bit0(X16))=bit1(X16),file('/tmp/SRASS.s.p', fact_809_succ__Bit0)).
% fof(165, axiom,![X16]:succ(X16)=plus_plus_int(X16,one_one_int),file('/tmp/SRASS.s.p', fact_814_succ__def)).
% fof(171, axiom,hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),file('/tmp/SRASS.s.p', fact_0_n1pos)).
% fof(270, axiom,~(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),file('/tmp/SRASS.s.p', fact_48_rel__simps_I2_J)).
% fof(653, axiom,![X13]:nat(number_number_of_int(X13))=number_number_of_nat(X13),file('/tmp/SRASS.s.p', fact_766_nat__number__of)).
% fof(1233, conjecture,~(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int),file('/tmp/SRASS.s.p', conj_0)).
% fof(1234, negated_conjecture,~(~(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int)),inference(assume_negation,[status(cth)],[1233])).
% fof(1243, plain,~(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),inference(fof_simplification,[status(thm)],[270,theory(equality)])).
% fof(1320, negated_conjecture,hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int,inference(fof_simplification,[status(thm)],[1234,theory(equality)])).
% cnf(1383,plain,(bit0(pls)=pls),inference(split_conjunct,[status(thm)],[20])).
% cnf(1384,plain,(pls=zero_zero_int),inference(split_conjunct,[status(thm)],[21])).
% fof(1394, plain,![X17]:bit0(X17)=plus_plus_int(X17,X17),inference(variable_rename,[status(thm)],[26])).
% cnf(1395,plain,(bit0(X1)=plus_plus_int(X1,X1)),inference(split_conjunct,[status(thm)],[1394])).
% fof(1420, plain,![X18]:![X19]:(~(is_int(X19))|(X19=zero_zero_int|~(hAPP_nat_int(power_power_int(X19),X18)=zero_zero_int))),inference(fof_nnf,[status(thm)],[37])).
% fof(1421, plain,![X20]:![X21]:(~(is_int(X21))|(X21=zero_zero_int|~(hAPP_nat_int(power_power_int(X21),X20)=zero_zero_int))),inference(variable_rename,[status(thm)],[1420])).
% cnf(1422,plain,(X1=zero_zero_int|hAPP_nat_int(power_power_int(X1),X2)!=zero_zero_int|~is_int(X1)),inference(split_conjunct,[status(thm)],[1421])).
% cnf(1496,plain,(is_int(one_one_int)),inference(split_conjunct,[status(thm)],[61])).
% fof(1497, plain,![X59]:![X60]:((~(is_int(X59))|~(is_int(X60)))|is_int(plus_plus_int(X59,X60))),inference(fof_nnf,[status(thm)],[62])).
% fof(1498, plain,![X61]:![X62]:((~(is_int(X61))|~(is_int(X62)))|is_int(plus_plus_int(X61,X62))),inference(variable_rename,[status(thm)],[1497])).
% cnf(1499,plain,(is_int(plus_plus_int(X1,X2))|~is_int(X2)|~is_int(X1)),inference(split_conjunct,[status(thm)],[1498])).
% fof(1508, plain,![X61]:![X62]:is_int(hAPP_nat_int(X61,X62)),inference(variable_rename,[status(thm)],[67])).
% cnf(1509,plain,(is_int(hAPP_nat_int(X1,X2))),inference(split_conjunct,[status(thm)],[1508])).
% cnf(1532,plain,(plus_plus_int(one_one_int,one_one_int)=number_number_of_int(bit0(bit1(pls)))),inference(split_conjunct,[status(thm)],[75])).
% fof(1744, plain,![X17]:succ(bit0(X17))=bit1(X17),inference(variable_rename,[status(thm)],[163])).
% cnf(1745,plain,(succ(bit0(X1))=bit1(X1)),inference(split_conjunct,[status(thm)],[1744])).
% fof(1748, plain,![X17]:succ(X17)=plus_plus_int(X17,one_one_int),inference(variable_rename,[status(thm)],[165])).
% cnf(1749,plain,(succ(X1)=plus_plus_int(X1,one_one_int)),inference(split_conjunct,[status(thm)],[1748])).
% cnf(1767,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))))),inference(split_conjunct,[status(thm)],[171])).
% cnf(2038,plain,(~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),inference(split_conjunct,[status(thm)],[1243])).
% fof(3232, plain,![X14]:nat(number_number_of_int(X14))=number_number_of_nat(X14),inference(variable_rename,[status(thm)],[653])).
% cnf(3233,plain,(nat(number_number_of_int(X1))=number_number_of_nat(X1)),inference(split_conjunct,[status(thm)],[3232])).
% cnf(5246,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls))))=zero_zero_int),inference(split_conjunct,[status(thm)],[1320])).
% cnf(5247,plain,(plus_plus_int(pls,pls)=pls),inference(rw,[status(thm)],[1383,1395,theory(equality)]),['unfolding']).
% cnf(5248,plain,(succ(plus_plus_int(X1,X1))=bit1(X1)),inference(rw,[status(thm)],[1745,1395,theory(equality)]),['unfolding']).
% cnf(5256,plain,(number_number_of_int(plus_plus_int(bit1(pls),bit1(pls)))=plus_plus_int(one_one_int,one_one_int)),inference(rw,[status(thm)],[1532,1395,theory(equality)]),['unfolding']).
% cnf(5283,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls))))=zero_zero_int),inference(rw,[status(thm)],[5246,1395,theory(equality)]),['unfolding']).
% cnf(5448,plain,(number_number_of_int(plus_plus_int(succ(plus_plus_int(pls,pls)),succ(plus_plus_int(pls,pls))))=plus_plus_int(one_one_int,one_one_int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5256,5248,theory(equality)]),5248,theory(equality)]),['unfolding']).
% cnf(5480,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(succ(plus_plus_int(pls,pls)),succ(plus_plus_int(pls,pls)))))=zero_zero_int),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5283,5248,theory(equality)]),5248,theory(equality)]),['unfolding']).
% cnf(5666,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(number_number_of_int(plus_plus_int(succ(plus_plus_int(pls,pls)),succ(plus_plus_int(pls,pls))))))=zero_zero_int),inference(rw,[status(thm)],[5480,3233,theory(equality)]),['unfolding']).
% cnf(5791,plain,(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int)))=plus_plus_int(one_one_int,one_one_int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5448,1749,theory(equality)]),1749,theory(equality)]),['unfolding']).
% cnf(5823,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int)))))=zero_zero_int),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5666,1749,theory(equality)]),1749,theory(equality)]),['unfolding']).
% cnf(6018,plain,(number_number_of_int(plus_plus_int(plus_plus_int(pls,one_one_int),plus_plus_int(pls,one_one_int)))=plus_plus_int(one_one_int,one_one_int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5791,5247,theory(equality)]),5247,theory(equality)])).
% cnf(6027,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),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)],[5823,5247,theory(equality)]),5247,theory(equality)]),6018,theory(equality)])).
% cnf(6028,negated_conjecture,(hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(plus_plus_int(one_one_int,one_one_int)))=pls),inference(rw,[status(thm)],[6027,1384,theory(equality)])).
% cnf(6074,plain,(pls=X1|hAPP_nat_int(power_power_int(X1),X2)!=zero_zero_int|~is_int(X1)),inference(rw,[status(thm)],[1422,1384,theory(equality)])).
% cnf(6075,plain,(pls=X1|hAPP_nat_int(power_power_int(X1),X2)!=pls|~is_int(X1)),inference(rw,[status(thm)],[6074,1384,theory(equality)])).
% cnf(6179,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))))),inference(rw,[status(thm)],[1767,1384,theory(equality)])).
% cnf(7320,negated_conjecture,(pls=plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))|~is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),inference(spm,[status(thm)],[6075,6028,theory(equality)])).
% cnf(24729,negated_conjecture,(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))=pls|~is_int(hAPP_nat_int(semiri1621563631at_int,n))|~is_int(one_one_int)),inference(spm,[status(thm)],[7320,1499,theory(equality)])).
% cnf(24801,negated_conjecture,(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))=pls|$false|~is_int(one_one_int)),inference(rw,[status(thm)],[24729,1509,theory(equality)])).
% cnf(24802,negated_conjecture,(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))=pls|$false|$false),inference(rw,[status(thm)],[24801,1496,theory(equality)])).
% cnf(24803,negated_conjecture,(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))=pls),inference(cn,[status(thm)],[24802,theory(equality)])).
% cnf(25003,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),inference(rw,[status(thm)],[6179,24803,theory(equality)])).
% cnf(25004,plain,($false),inference(sr,[status(thm)],[25003,2038,theory(equality)])).
% cnf(25005,plain,($false),25004,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 1.76 CPU 1.87 WC
% FINAL PrfWatch: 1.76 CPU 1.87 WC
% SZS output end Solution for /tmp/SystemOnTPTP2385/NUM925+3.tptp
%
%------------------------------------------------------------------------------