TSTP Solution File: NUM924+6 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM924+6 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.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:28:43 EST 2011
% Result : Theorem 24.19s
% Output : Solution 24.19s
% 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/SystemOnTPTP8861/NUM924+6.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8861/NUM924+6.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8861/NUM924+6.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 9091
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 165 unused term cells.
% # Garbage collection reclaimed 2678 unused term cells.
% # Garbage collection reclaimed 2423 unused term cells.
% # Garbage collection reclaimed 2190 unused term cells.
% # Garbage collection reclaimed 1816 unused term cells.
% # Garbage collection reclaimed 1556 unused term cells.
% # Garbage collection reclaimed 1492 unused term cells.
% # Garbage collection reclaimed 1226 unused term cells.
% # Garbage collection reclaimed 1174 unused term cells.
% # Garbage collection reclaimed 895 unused term cells.
% # Garbage collection reclaimed 69 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFSLM32LD
% # 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 GHSMNFSLM32LD
% # 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
% # Garbage collection reclaimed 819 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 650
% # Removed by relevancy pruning : 0
% # Initial clauses : 850
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 842
% # Processed clauses : 840
% # ...of these trivial : 7
% # ...subsumed : 85
% # ...remaining for further processing: 747
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 15
% # Generated clauses : 2
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 11
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 728
% # Positive orientable unit clauses: 171
% # Positive unorientable unit clauses: 14
% # Negative unit clauses : 13
% # Non-unit-clauses : 530
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 13
% # Clause-clause subsumption calls (NU) : 2412
% # Rec. Clause-clause subsumption calls : 1821
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 539
% # Indexed BW rewrite successes : 55
% # Backwards rewriting index : 406 leaves, 2.54+/-4.201 terms/leaf
% # Paramod-from index : 280 leaves, 1.74+/-1.925 terms/leaf
% # Paramod-into index : 374 leaves, 2.36+/-3.851 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:number_number_of(int,X1)=ti(int,X1),file('/tmp/SRASS.s.p', fact_22_number__of__is__id)).
% fof(5, axiom,plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,bit0(bit1(pls))),file('/tmp/SRASS.s.p', fact_61_nat__1__add__1)).
% fof(15, axiom,![X11]:![X12]:![X13]:plus_plus(int,plus_plus(int,X11,X12),X13)=plus_plus(int,X11,plus_plus(int,X12,X13)),file('/tmp/SRASS.s.p', fact_94_zadd__assoc)).
% fof(16, axiom,![X9]:![X10]:![X14]:plus_plus(int,X9,plus_plus(int,X10,X14))=plus_plus(int,X10,plus_plus(int,X9,X14)),file('/tmp/SRASS.s.p', fact_95_zadd__left__commute)).
% 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(27, axiom,pls=zero_zero(int),file('/tmp/SRASS.s.p', fact_120_Pls__def)).
% fof(34, axiom,![X1]:plus_plus(int,X1,pls)=ti(int,X1),file('/tmp/SRASS.s.p', fact_127_add__Pls__right)).
% fof(37, axiom,![X1]:bit0(X1)=plus_plus(int,X1,X1),file('/tmp/SRASS.s.p', fact_130_Bit0__def)).
% fof(52, axiom,![X1]:bit1(X1)=plus_plus(int,plus_plus(int,one_one(int),X1),X1),file('/tmp/SRASS.s.p', fact_162_Bit1__def)).
% fof(156, 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(195, axiom,![X6]:times_times(int,pls,X6)=pls,file('/tmp/SRASS.s.p', fact_62_mult__Pls)).
% fof(212, 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(413, axiom,![X14]:![X6]:times_times(int,X14,X6)=times_times(int,X6,X14),file('/tmp/SRASS.s.p', fact_23_zmult__commute)).
% fof(650, 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(651, 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)],[650])).
% fof(682, 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)],[651,theory(equality)])).
% fof(683, plain,![X2]:number_number_of(int,X2)=ti(int,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(684,plain,(number_number_of(int,X1)=ti(int,X1)),inference(split_conjunct,[status(thm)],[683])).
% cnf(691,plain,(plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,bit0(bit1(pls)))),inference(split_conjunct,[status(thm)],[5])).
% fof(723, plain,![X14]:![X15]:![X16]:plus_plus(int,plus_plus(int,X14,X15),X16)=plus_plus(int,X14,plus_plus(int,X15,X16)),inference(variable_rename,[status(thm)],[15])).
% cnf(724,plain,(plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3))),inference(split_conjunct,[status(thm)],[723])).
% fof(725, plain,![X15]:![X16]:![X17]:plus_plus(int,X15,plus_plus(int,X16,X17))=plus_plus(int,X16,plus_plus(int,X15,X17)),inference(variable_rename,[status(thm)],[16])).
% cnf(726,plain,(plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3))),inference(split_conjunct,[status(thm)],[725])).
% fof(727, plain,![X15]:![X16]:plus_plus(int,X15,X16)=plus_plus(int,X16,X15),inference(variable_rename,[status(thm)],[17])).
% cnf(728,plain,(plus_plus(int,X1,X2)=plus_plus(int,X2,X1)),inference(split_conjunct,[status(thm)],[727])).
% cnf(748,plain,(pls=zero_zero(int)),inference(split_conjunct,[status(thm)],[27])).
% fof(767, plain,![X2]:plus_plus(int,X2,pls)=ti(int,X2),inference(variable_rename,[status(thm)],[34])).
% cnf(768,plain,(plus_plus(int,X1,pls)=ti(int,X1)),inference(split_conjunct,[status(thm)],[767])).
% fof(773, plain,![X2]:bit0(X2)=plus_plus(int,X2,X2),inference(variable_rename,[status(thm)],[37])).
% cnf(774,plain,(bit0(X1)=plus_plus(int,X1,X1)),inference(split_conjunct,[status(thm)],[773])).
% fof(816, plain,![X2]:bit1(X2)=plus_plus(int,plus_plus(int,one_one(int),X2),X2),inference(variable_rename,[status(thm)],[52])).
% cnf(817,plain,(bit1(X1)=plus_plus(int,plus_plus(int,one_one(int),X1),X1)),inference(split_conjunct,[status(thm)],[816])).
% cnf(1175,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)],[156])).
% fof(1311, plain,![X7]:times_times(int,pls,X7)=pls,inference(variable_rename,[status(thm)],[195])).
% cnf(1312,plain,(times_times(int,pls,X1)=pls),inference(split_conjunct,[status(thm)],[1311])).
% cnf(1369,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)],[212])).
% fof(2083, plain,![X15]:![X16]:times_times(int,X15,X16)=times_times(int,X16,X15),inference(variable_rename,[status(thm)],[413])).
% cnf(2084,plain,(times_times(int,X1,X2)=times_times(int,X2,X1)),inference(split_conjunct,[status(thm)],[2083])).
% cnf(2726,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)],[682])).
% cnf(2746,plain,(plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),inference(rw,[status(thm)],[691,774,theory(equality)]),['unfolding']).
% cnf(2769,plain,(times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),t)=plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),one_one(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1175,774,theory(equality)]),774,theory(equality)]),774,theory(equality)]),['unfolding']).
% cnf(2775,plain,(ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int)),zero_zero(int)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1369,774,theory(equality)]),774,theory(equality)]),774,theory(equality)]),774,theory(equality)]),['unfolding']).
% cnf(2883,negated_conjecture,(~ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),one_one(int)),zero_zero(int))),inference(rw,[status(thm)],[2726,774,theory(equality)]),['unfolding']).
% cnf(2910,plain,(plus_plus(nat,one_one(nat),one_one(nat))=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)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2746,817,theory(equality)]),817,theory(equality)]),['unfolding']).
% cnf(2933,plain,(times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,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)),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)))),m),one_one(int)),t)=plus_plus(int,power_power(int,s,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)))),one_one(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2769,817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),['unfolding']).
% cnf(2939,plain,(ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,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)),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)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,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)),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)))),m),one_one(int)),zero_zero(int)))),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)],[2775,817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),817,theory(equality)]),['unfolding']).
% cnf(3062,negated_conjecture,(~ord_less(int,plus_plus(int,power_power(int,s,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)))),one_one(int)),zero_zero(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2883,817,theory(equality)]),817,theory(equality)]),['unfolding']).
% cnf(3090,plain,(number_number_of(int,X1)=plus_plus(int,X1,pls)),inference(rw,[status(thm)],[768,684,theory(equality)])).
% cnf(3249,plain,(number_number_of(nat,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),one_one(int)))))))=plus_plus(nat,one_one(nat),one_one(nat))),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)],[2910,728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)])).
% cnf(3399,negated_conjecture,(~ord_less(int,plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat)))),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)],[3062,728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),3249,theory(equality)]),728,theory(equality)]),748,theory(equality)])).
% cnf(3483,plain,(times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))))))))))))=plus_plus(int,power_power(int,s,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)))),one_one(int))),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)],[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)],[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)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2933,728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),3090,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),728,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),2084,theory(equality)]),728,theory(equality)]),2084,theory(equality)])).
% cnf(3484,plain,(times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))))))))))))=plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))))),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)],[3483,728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),3249,theory(equality)]),728,theory(equality)])).
% cnf(3520,plain,(ord_less(int,plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat)))),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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[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)],[2939,728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),3090,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),728,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),2084,theory(equality)]),728,theory(equality)]),2084,theory(equality)]),3484,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),728,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),3090,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),724,theory(equality)]),728,theory(equality)]),726,theory(equality)]),726,theory(equality)]),726,theory(equality)]),2084,theory(equality)]),728,theory(equality)]),748,theory(equality)]),2084,theory(equality)]),1312,theory(equality)])).
% cnf(3521,plain,($false),inference(sr,[status(thm)],[3520,3399,theory(equality)])).
% cnf(3522,plain,($false),3521,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.36 CPU 0.46 WC
% FINAL PrfWatch: 0.36 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP8861/NUM924+6.tptp
% WARNING: TreeLimitedRun lost 0.12s, total lost is 0.12s
%
%------------------------------------------------------------------------------