TSTP Solution File: NUM925+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM925+2 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 00:29:10 EST 2011
% Result : Theorem 31.96s
% Output : Solution 31.96s
% 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/SystemOnTPTP31846/NUM925+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31846/NUM925+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31846/NUM925+2.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 31960
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 168 unused term cells.
% # Garbage collection reclaimed 4537 unused term cells.
% # Garbage collection reclaimed 3491 unused term cells.
% # Garbage collection reclaimed 2912 unused term cells.
% # Garbage collection reclaimed 2546 unused term cells.
% # Garbage collection reclaimed 1873 unused term cells.
% # Garbage collection reclaimed 1611 unused term cells.
% # Garbage collection reclaimed 1340 unused term cells.
% # Garbage collection reclaimed 492 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFSLM31LD
% # 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 GHSMNFSLM31LD
% # 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
% # Garbage collection reclaimed 1047 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Presaturation interreduction done
% # Garbage collection reclaimed 259 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 708
% # Removed by relevancy pruning : 0
% # Initial clauses : 996
% # Removed in clause preprocessing : 104
% # Initial clauses in saturation : 892
% # Processed clauses : 1141
% # ...of these trivial : 111
% # ...subsumed : 230
% # ...remaining for further processing: 800
% # Other redundant clauses eliminated : 19
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 22
% # Backward-rewritten : 10
% # Generated clauses : 1934
% # ...of the previous two non-trivial : 1493
% # Contextual simplify-reflections : 4
% # Paramodulations : 1899
% # Factorizations : 0
% # Equation resolutions : 35
% # Current number of processed clauses: 237
% # Positive orientable unit clauses: 78
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 24
% # Non-unit-clauses : 130
% # Current number of unprocessed clauses: 1762
% # ...number of literals in the above : 3935
% # Clause-clause subsumption calls (NU) : 7385
% # Rec. Clause-clause subsumption calls : 6848
% # Unit Clause-clause subsumption calls : 361
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 493
% # Indexed BW rewrite successes : 218
% # Backwards rewriting index : 308 leaves, 1.56+/-1.728 terms/leaf
% # Paramod-from index : 93 leaves, 1.37+/-1.285 terms/leaf
% # Paramod-into index : 287 leaves, 1.50+/-1.592 terms/leaf
% # SZS output start CNFRefutation.
% fof(21, axiom,pls=zero_zero_int,file('/tmp/SRASS.s.p', fact_98_Pls__def)).
% fof(24, axiom,![X16]:hAPP_int_int(plus_plus_int(pls),X16)=X16,file('/tmp/SRASS.s.p', fact_101_add__Pls)).
% fof(26, axiom,![X16]:bit0(X16)=hAPP_int_int(plus_plus_int(X16),X16),file('/tmp/SRASS.s.p', fact_103_Bit0__def)).
% fof(95, axiom,![X16]:succ(X16)=hAPP_int_int(plus_plus_int(X16),one_one_int),file('/tmp/SRASS.s.p', fact_573_succ__def)).
% fof(111, axiom,hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),file('/tmp/SRASS.s.p', fact_0_n1pos)).
% fof(121, axiom,![X16]:succ(bit0(X16))=bit1(X16),file('/tmp/SRASS.s.p', fact_568_succ__Bit0)).
% fof(164, 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(300, axiom,![X204]:![X205]:(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X205))=>hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X205),X204)))),file('/tmp/SRASS.s.p', fact_267_zero__less__power)).
% fof(708, conjecture,~(hAPP_nat_int(power_power_int(hAPP_int_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(709, negated_conjecture,~(~(hAPP_nat_int(power_power_int(hAPP_int_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)],[708])).
% fof(714, plain,~(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),inference(fof_simplification,[status(thm)],[164,theory(equality)])).
% fof(752, negated_conjecture,hAPP_nat_int(power_power_int(hAPP_int_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)],[709,theory(equality)])).
% cnf(810,plain,(pls=zero_zero_int),inference(split_conjunct,[status(thm)],[21])).
% fof(814, plain,![X17]:hAPP_int_int(plus_plus_int(pls),X17)=X17,inference(variable_rename,[status(thm)],[24])).
% cnf(815,plain,(hAPP_int_int(plus_plus_int(pls),X1)=X1),inference(split_conjunct,[status(thm)],[814])).
% fof(818, plain,![X17]:bit0(X17)=hAPP_int_int(plus_plus_int(X17),X17),inference(variable_rename,[status(thm)],[26])).
% cnf(819,plain,(bit0(X1)=hAPP_int_int(plus_plus_int(X1),X1)),inference(split_conjunct,[status(thm)],[818])).
% fof(975, plain,![X17]:succ(X17)=hAPP_int_int(plus_plus_int(X17),one_one_int),inference(variable_rename,[status(thm)],[95])).
% cnf(976,plain,(succ(X1)=hAPP_int_int(plus_plus_int(X1),one_one_int)),inference(split_conjunct,[status(thm)],[975])).
% cnf(1011,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))))),inference(split_conjunct,[status(thm)],[111])).
% fof(1026, plain,![X17]:succ(bit0(X17))=bit1(X17),inference(variable_rename,[status(thm)],[121])).
% cnf(1027,plain,(succ(bit0(X1))=bit1(X1)),inference(split_conjunct,[status(thm)],[1026])).
% cnf(1137,plain,(~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),inference(split_conjunct,[status(thm)],[714])).
% fof(1578, plain,![X204]:![X205]:(~(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X205)))|hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X205),X204)))),inference(fof_nnf,[status(thm)],[300])).
% fof(1579, plain,![X206]:![X207]:(~(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X207)))|hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X207),X206)))),inference(variable_rename,[status(thm)],[1578])).
% cnf(1580,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X1),X2)))|~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X1))),inference(split_conjunct,[status(thm)],[1579])).
% cnf(2901,negated_conjecture,(hAPP_nat_int(power_power_int(hAPP_int_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)],[752])).
% cnf(3012,negated_conjecture,(hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(succ(bit0(pls)))))=zero_zero_int),inference(rw,[status(thm)],[2901,1027,theory(equality)]),['unfolding']).
% cnf(3167,negated_conjecture,(hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(succ(hAPP_int_int(plus_plus_int(pls),pls))),succ(hAPP_int_int(plus_plus_int(pls),pls)))))=zero_zero_int),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3012,819,theory(equality)]),819,theory(equality)]),['unfolding']).
% cnf(3344,negated_conjecture,(hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(pls),pls)),one_one_int)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(pls),pls)),one_one_int))))=zero_zero_int),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3167,976,theory(equality)]),976,theory(equality)]),['unfolding']).
% cnf(3522,negated_conjecture,(hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(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)],[3344,815,theory(equality)]),815,theory(equality)]),815,theory(equality)]),815,theory(equality)])).
% cnf(3523,negated_conjecture,(hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)))=pls),inference(rw,[status(thm)],[3522,810,theory(equality)])).
% cnf(3619,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))))),inference(rw,[status(thm)],[1011,810,theory(equality)])).
% cnf(3767,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_nat_int(power_power_int(X1),X2)))|~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X1))),inference(rw,[status(thm)],[1580,810,theory(equality)])).
% cnf(3768,plain,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_nat_int(power_power_int(X1),X2)))|~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),X1))),inference(rw,[status(thm)],[3767,810,theory(equality)])).
% cnf(6846,negated_conjecture,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))|~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))))),inference(spm,[status(thm)],[3768,3523,theory(equality)])).
% cnf(6856,negated_conjecture,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))|$false),inference(rw,[status(thm)],[6846,3619,theory(equality)])).
% cnf(6857,negated_conjecture,(hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))),inference(cn,[status(thm)],[6856,theory(equality)])).
% cnf(6858,negated_conjecture,($false),inference(sr,[status(thm)],[6857,1137,theory(equality)])).
% cnf(6859,negated_conjecture,($false),6858,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.52 CPU 0.62 WC
% FINAL PrfWatch: 0.52 CPU 0.62 WC
% SZS output end Solution for /tmp/SystemOnTPTP31846/NUM925+2.tptp
%
%------------------------------------------------------------------------------