TSTP Solution File: NUM924+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM924+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 : art01.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:07 EST 2011
% Result : Theorem 33.37s
% Output : Solution 33.37s
% 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/SystemOnTPTP31741/NUM924+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31741/NUM924+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31741/NUM924+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 31855
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Garbage collection reclaimed 172 unused term cells.
% # Garbage collection reclaimed 3369 unused term cells.
% # Garbage collection reclaimed 2939 unused term cells.
% # Garbage collection reclaimed 2725 unused term cells.
% # Garbage collection reclaimed 2013 unused term cells.
% # Garbage collection reclaimed 1648 unused term cells.
% # Garbage collection reclaimed 1349 unused term cells.
% # Garbage collection reclaimed 1152 unused term cells.
% # Garbage collection reclaimed 871 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
% # plus_plus_int is AC
% # times_times_int is AC
% # times_times_nat is AC
% # plus_plus_nat is AC
% # times_times_real is AC
% # plus_plus_real is AC
% # AC handling enabled
% # Garbage collection reclaimed 703 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 716
% # Removed by relevancy pruning : 0
% # Initial clauses : 955
% # Removed in clause preprocessing : 24
% # Initial clauses in saturation : 931
% # Processed clauses : 933
% # ...of these trivial : 103
% # ...subsumed : 136
% # ...remaining for further processing: 693
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 69
% # Generated clauses : 15
% # ...of the previous two non-trivial : 80
% # Contextual simplify-reflections : 9
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 15
% # Current number of processed clauses: 598
% # Positive orientable unit clauses: 140
% # Positive unorientable unit clauses: 40
% # Negative unit clauses : 12
% # Non-unit-clauses : 406
% # Current number of unprocessed clauses: 78
% # ...number of literals in the above : 136
% # Clause-clause subsumption calls (NU) : 2964
% # Rec. Clause-clause subsumption calls : 2089
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 432
% # Indexed BW rewrite successes : 213
% # Backwards rewriting index : 555 leaves, 1.64+/-1.910 terms/leaf
% # Paramod-from index : 344 leaves, 1.19+/-0.511 terms/leaf
% # Paramod-into index : 482 leaves, 1.57+/-1.801 terms/leaf
% # SZS output start CNFRefutation.
% fof(42, axiom,![X8]:bit1(X8)=plus_plus_int(plus_plus_int(one_one_int,X8),X8),file('/tmp/SRASS.s.p', fact_234_Bit1__def)).
% fof(67, axiom,![X8]:bit0(X8)=plus_plus_int(X8,X8),file('/tmp/SRASS.s.p', fact_180_Bit0__def)).
% fof(72, axiom,pls=zero_zero_int,file('/tmp/SRASS.s.p', fact_170_Pls__def)).
% fof(127, axiom,![X83]:![X84]:![X85]:plus_plus_int(plus_plus_int(X83,X84),X85)=plus_plus_int(X83,plus_plus_int(X84,X85)),file('/tmp/SRASS.s.p', fact_130_zadd__assoc)).
% fof(128, axiom,![X1]:![X2]:![X24]:plus_plus_int(X1,plus_plus_int(X2,X24))=plus_plus_int(X2,plus_plus_int(X1,X24)),file('/tmp/SRASS.s.p', fact_131_zadd__left__commute)).
% fof(129, axiom,![X24]:![X53]:plus_plus_int(X24,X53)=plus_plus_int(X53,X24),file('/tmp/SRASS.s.p', fact_132_zadd__commute)).
% fof(181, 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(191, 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(286, axiom,![X24]:![X53]:times_times_int(X24,X53)=times_times_int(X53,X24),file('/tmp/SRASS.s.p', fact_35_zmult__commute)).
% fof(448, axiom,![X240]:times_times_int(X240,zero_zero_int)=zero_zero_int,file('/tmp/SRASS.s.p', fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J)).
% fof(716, 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(717, 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)],[716])).
% fof(752, 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)],[717,theory(equality)])).
% fof(882, plain,![X9]:bit1(X9)=plus_plus_int(plus_plus_int(one_one_int,X9),X9),inference(variable_rename,[status(thm)],[42])).
% cnf(883,plain,(bit1(X1)=plus_plus_int(plus_plus_int(one_one_int,X1),X1)),inference(split_conjunct,[status(thm)],[882])).
% fof(961, plain,![X9]:bit0(X9)=plus_plus_int(X9,X9),inference(variable_rename,[status(thm)],[67])).
% cnf(962,plain,(bit0(X1)=plus_plus_int(X1,X1)),inference(split_conjunct,[status(thm)],[961])).
% cnf(973,plain,(pls=zero_zero_int),inference(split_conjunct,[status(thm)],[72])).
% fof(1156, plain,![X86]:![X87]:![X88]:plus_plus_int(plus_plus_int(X86,X87),X88)=plus_plus_int(X86,plus_plus_int(X87,X88)),inference(variable_rename,[status(thm)],[127])).
% cnf(1157,plain,(plus_plus_int(plus_plus_int(X1,X2),X3)=plus_plus_int(X1,plus_plus_int(X2,X3))),inference(split_conjunct,[status(thm)],[1156])).
% fof(1158, plain,![X25]:![X26]:![X27]:plus_plus_int(X25,plus_plus_int(X26,X27))=plus_plus_int(X26,plus_plus_int(X25,X27)),inference(variable_rename,[status(thm)],[128])).
% cnf(1159,plain,(plus_plus_int(X1,plus_plus_int(X2,X3))=plus_plus_int(X2,plus_plus_int(X1,X3))),inference(split_conjunct,[status(thm)],[1158])).
% fof(1160, plain,![X54]:![X55]:plus_plus_int(X54,X55)=plus_plus_int(X55,X54),inference(variable_rename,[status(thm)],[129])).
% cnf(1161,plain,(plus_plus_int(X1,X2)=plus_plus_int(X2,X1)),inference(split_conjunct,[status(thm)],[1160])).
% cnf(1289,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)],[181])).
% cnf(1307,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)],[191])).
% fof(1563, plain,![X54]:![X55]:times_times_int(X54,X55)=times_times_int(X55,X54),inference(variable_rename,[status(thm)],[286])).
% cnf(1564,plain,(times_times_int(X1,X2)=times_times_int(X2,X1)),inference(split_conjunct,[status(thm)],[1563])).
% fof(1974, plain,![X241]:times_times_int(X241,zero_zero_int)=zero_zero_int,inference(variable_rename,[status(thm)],[448])).
% cnf(1975,plain,(times_times_int(X1,zero_zero_int)=zero_zero_int),inference(split_conjunct,[status(thm)],[1974])).
% cnf(2789,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)],[752])).
% cnf(2875,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)],[1289,962,theory(equality)]),962,theory(equality)]),962,theory(equality)]),['unfolding']).
% cnf(2884,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)],[1307,962,theory(equality)]),962,theory(equality)]),962,theory(equality)]),962,theory(equality)]),['unfolding']).
% cnf(2996,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)],[2789,962,theory(equality)]),['unfolding']).
% cnf(3105,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)],[2875,883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),['unfolding']).
% cnf(3114,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)],[2884,883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),883,theory(equality)]),['unfolding']).
% cnf(3244,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)],[2996,883,theory(equality)]),883,theory(equality)]),['unfolding']).
% cnf(3266,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),pls)),inference(rw,[status(thm)],[3244,973,theory(equality)])).
% cnf(3293,plain,(times_times_int(X1,pls)=zero_zero_int),inference(rw,[status(thm)],[1975,973,theory(equality)])).
% cnf(3294,plain,(times_times_int(X1,pls)=pls),inference(rw,[status(thm)],[3293,973,theory(equality)])).
% cnf(3408,negated_conjecture,(~ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(plus_plus_int(plus_plus_int(pls,plus_plus_int(pls,one_one_int)),plus_plus_int(pls,plus_plus_int(pls,one_one_int)))))),pls)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3266,1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)])).
% cnf(3744,plain,(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(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)],[3105,1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1564,theory(equality)]),1161,theory(equality)]),1564,theory(equality)])).
% cnf(3745,plain,(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(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,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))))))))),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)],[3744,1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)])).
% cnf(3917,plain,(ord_less_int(plus_plus_int(one_one_int,power_power_int(s,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)))))))),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)],[3114,1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1564,theory(equality)]),1161,theory(equality)]),1564,theory(equality)]),3745,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1161,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),1564,theory(equality)]),1161,theory(equality)]),973,theory(equality)]),3294,theory(equality)])).
% cnf(3959,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3408,1157,theory(equality)]),1157,theory(equality)]),1159,theory(equality)]),1159,theory(equality)]),3917,theory(equality)])).
% cnf(3960,negated_conjecture,($false),inference(cn,[status(thm)],[3959,theory(equality)])).
% cnf(3961,negated_conjecture,($false),3960,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.41 CPU 0.53 WC
% FINAL PrfWatch: 0.41 CPU 0.53 WC
% SZS output end Solution for /tmp/SystemOnTPTP31741/NUM924+2.tptp
% WARNING: TreeLimitedRun lost 0.01s, total lost is 0.01s
%
%------------------------------------------------------------------------------