TSTP Solution File: SWV104+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV104+1 : TPTP v5.0.0. Bugfixed v3.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 : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:30:41 EST 2010
% Result : Theorem 1.85s
% Output : Solution 1.85s
% 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/SystemOnTPTP1296/SWV104+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1296/SWV104+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1296/SWV104+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 1429
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:a_select2(tptp_update2(X1,X2,X3),X2)=X3,file('/tmp/SRASS.s.p', sel2_update_1)).
% fof(2, axiom,![X4]:![X2]:![X1]:![X3]:![X5]:((~(X4=X2)&a_select2(X1,X2)=X3)=>a_select2(tptp_update2(X1,X4,X5),X2)=X3),file('/tmp/SRASS.s.p', sel2_update_2)).
% fof(9, axiom,gt(n5,n4),file('/tmp/SRASS.s.p', gt_5_4)).
% fof(18, axiom,gt(n5,n3),file('/tmp/SRASS.s.p', gt_5_3)).
% fof(19, axiom,succ(succ(succ(succ(n0))))=n4,file('/tmp/SRASS.s.p', successor_4)).
% fof(20, axiom,succ(succ(succ(succ(succ(n0)))))=n5,file('/tmp/SRASS.s.p', successor_5)).
% fof(21, axiom,succ(succ(succ(n0)))=n3,file('/tmp/SRASS.s.p', successor_3)).
% fof(22, axiom,succ(n0)=n1,file('/tmp/SRASS.s.p', successor_1)).
% fof(23, axiom,succ(succ(n0))=n2,file('/tmp/SRASS.s.p', successor_2)).
% fof(40, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(41, axiom,![X1]:leq(X1,X1),file('/tmp/SRASS.s.p', reflexivity_leq)).
% fof(49, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(50, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(51, axiom,![X1]:plus(X1,n2)=succ(succ(X1)),file('/tmp/SRASS.s.p', succ_plus_2_r)).
% fof(52, axiom,![X1]:plus(n2,X1)=succ(succ(X1)),file('/tmp/SRASS.s.p', succ_plus_2_l)).
% fof(53, axiom,![X1]:plus(X1,n3)=succ(succ(succ(X1))),file('/tmp/SRASS.s.p', succ_plus_3_r)).
% fof(55, axiom,![X1]:plus(X1,n4)=succ(succ(succ(succ(X1)))),file('/tmp/SRASS.s.p', succ_plus_4_r)).
% fof(56, axiom,![X1]:plus(n4,X1)=succ(succ(succ(succ(X1)))),file('/tmp/SRASS.s.p', succ_plus_4_l)).
% fof(57, axiom,![X1]:plus(X1,n5)=succ(succ(succ(succ(succ(X1))))),file('/tmp/SRASS.s.p', succ_plus_5_r)).
% fof(79, axiom,![X1]:![X14]:(leq(X1,X14)<=>gt(succ(X14),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(85, conjecture,((((((a_select3(u_defuse,n0,n0)=use&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)=>(((((a_select3(u_defuse,n0,n0)=use&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)=use)&a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)=use)&a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)=use)),file('/tmp/SRASS.s.p', quaternion_ds1_inuse_0016)).
% fof(86, negated_conjecture,~(((((((a_select3(u_defuse,n0,n0)=use&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)=>(((((a_select3(u_defuse,n0,n0)=use&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)=use)&a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)=use)&a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)=use))),inference(assume_negation,[status(cth)],[85])).
% fof(87, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[40,theory(equality)])).
% fof(90, plain,![X4]:![X5]:![X6]:a_select2(tptp_update2(X4,X5,X6),X5)=X6,inference(variable_rename,[status(thm)],[1])).
% cnf(91,plain,(a_select2(tptp_update2(X1,X2,X3),X2)=X3),inference(split_conjunct,[status(thm)],[90])).
% fof(92, plain,![X4]:![X2]:![X1]:![X3]:![X5]:((X4=X2|~(a_select2(X1,X2)=X3))|a_select2(tptp_update2(X1,X4,X5),X2)=X3),inference(fof_nnf,[status(thm)],[2])).
% fof(93, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((X6=X7|~(a_select2(X8,X7)=X9))|a_select2(tptp_update2(X8,X6,X10),X7)=X9),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(a_select2(tptp_update2(X1,X2,X3),X4)=X5|X2=X4|a_select2(X1,X4)!=X5),inference(split_conjunct,[status(thm)],[93])).
% cnf(117,plain,(gt(n5,n4)),inference(split_conjunct,[status(thm)],[9])).
% cnf(126,plain,(gt(n5,n3)),inference(split_conjunct,[status(thm)],[18])).
% cnf(127,plain,(succ(succ(succ(succ(n0))))=n4),inference(split_conjunct,[status(thm)],[19])).
% cnf(128,plain,(succ(succ(succ(succ(succ(n0)))))=n5),inference(split_conjunct,[status(thm)],[20])).
% cnf(129,plain,(succ(succ(succ(n0)))=n3),inference(split_conjunct,[status(thm)],[21])).
% cnf(130,plain,(succ(n0)=n1),inference(split_conjunct,[status(thm)],[22])).
% cnf(131,plain,(succ(succ(n0))=n2),inference(split_conjunct,[status(thm)],[23])).
% fof(248, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[87])).
% cnf(249,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[248])).
% fof(250, plain,![X2]:leq(X2,X2),inference(variable_rename,[status(thm)],[41])).
% cnf(251,plain,(leq(X1,X1)),inference(split_conjunct,[status(thm)],[250])).
% fof(284, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[49])).
% cnf(285,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[284])).
% fof(286, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[50])).
% cnf(287,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[286])).
% fof(288, plain,![X2]:plus(X2,n2)=succ(succ(X2)),inference(variable_rename,[status(thm)],[51])).
% cnf(289,plain,(plus(X1,n2)=succ(succ(X1))),inference(split_conjunct,[status(thm)],[288])).
% fof(290, plain,![X2]:plus(n2,X2)=succ(succ(X2)),inference(variable_rename,[status(thm)],[52])).
% cnf(291,plain,(plus(n2,X1)=succ(succ(X1))),inference(split_conjunct,[status(thm)],[290])).
% fof(292, plain,![X2]:plus(X2,n3)=succ(succ(succ(X2))),inference(variable_rename,[status(thm)],[53])).
% cnf(293,plain,(plus(X1,n3)=succ(succ(succ(X1)))),inference(split_conjunct,[status(thm)],[292])).
% fof(296, plain,![X2]:plus(X2,n4)=succ(succ(succ(succ(X2)))),inference(variable_rename,[status(thm)],[55])).
% cnf(297,plain,(plus(X1,n4)=succ(succ(succ(succ(X1))))),inference(split_conjunct,[status(thm)],[296])).
% fof(298, plain,![X2]:plus(n4,X2)=succ(succ(succ(succ(X2)))),inference(variable_rename,[status(thm)],[56])).
% cnf(299,plain,(plus(n4,X1)=succ(succ(succ(succ(X1))))),inference(split_conjunct,[status(thm)],[298])).
% fof(300, plain,![X2]:plus(X2,n5)=succ(succ(succ(succ(succ(X2))))),inference(variable_rename,[status(thm)],[57])).
% cnf(301,plain,(plus(X1,n5)=succ(succ(succ(succ(succ(X1)))))),inference(split_conjunct,[status(thm)],[300])).
% fof(354, plain,![X1]:![X14]:((~(leq(X1,X14))|gt(succ(X14),X1))&(~(gt(succ(X14),X1))|leq(X1,X14))),inference(fof_nnf,[status(thm)],[79])).
% fof(355, plain,![X15]:![X16]:((~(leq(X15,X16))|gt(succ(X16),X15))&(~(gt(succ(X16),X15))|leq(X15,X16))),inference(variable_rename,[status(thm)],[354])).
% cnf(357,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[355])).
% fof(374, negated_conjecture,((((((a_select3(u_defuse,n0,n0)=use&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)&(((((~(a_select3(u_defuse,n0,n0)=use)|~(a_select3(u_defuse,n1,n0)=use))|~(a_select3(u_defuse,n2,n0)=use))|~(a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)=use))|~(a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)=use))|~(a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)=use))),inference(fof_nnf,[status(thm)],[86])).
% cnf(375,negated_conjecture,(a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select3(u_defuse,n2,n0)!=use|a_select3(u_defuse,n1,n0)!=use|a_select3(u_defuse,n0,n0)!=use),inference(split_conjunct,[status(thm)],[374])).
% cnf(379,negated_conjecture,(a_select3(u_defuse,n2,n0)=use),inference(split_conjunct,[status(thm)],[374])).
% cnf(380,negated_conjecture,(a_select3(u_defuse,n1,n0)=use),inference(split_conjunct,[status(thm)],[374])).
% cnf(381,negated_conjecture,(a_select3(u_defuse,n0,n0)=use),inference(split_conjunct,[status(thm)],[374])).
% cnf(415,plain,(plus(n0,n1)=n1),inference(rw,[status(thm)],[130,285,theory(equality)]),['unfolding']).
% cnf(419,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[287,285,theory(equality)]),['unfolding']).
% cnf(420,plain,(plus(plus(n0,n1),n1)=n2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[131,285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(422,plain,(plus(X1,n2)=plus(plus(X1,n1),n1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[289,285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(423,plain,(plus(n2,X1)=plus(plus(X1,n1),n1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[291,285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(424,plain,(plus(plus(plus(n0,n1),n1),n1)=n3),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[129,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(425,plain,(plus(plus(plus(X1,n1),n1),n1)=plus(X1,n3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[293,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(427,plain,(plus(plus(plus(plus(n0,n1),n1),n1),n1)=n4),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[127,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(428,plain,(plus(plus(plus(plus(X1,n1),n1),n1),n1)=plus(X1,n4)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[297,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(429,plain,(plus(plus(plus(plus(X1,n1),n1),n1),n1)=plus(n4,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[299,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(430,plain,(plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1)=n5),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[128,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(431,plain,(plus(plus(plus(plus(plus(X1,n1),n1),n1),n1),n1)=plus(X1,n5)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[301,285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),285,theory(equality)]),['unfolding']).
% cnf(436,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[357,285,theory(equality)]),['unfolding']).
% cnf(440,plain,(plus(n1,n1)=n2),inference(rw,[status(thm)],[420,415,theory(equality)])).
% cnf(443,plain,(plus(n1,n2)=n3),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[424,415,theory(equality)]),440,theory(equality)]),419,theory(equality)])).
% cnf(444,plain,(plus(n1,plus(X1,n1))=plus(X1,n2)),inference(rw,[status(thm)],[422,419,theory(equality)])).
% cnf(445,plain,(plus(X1,n2)=plus(n2,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[423,419,theory(equality)]),444,theory(equality)])).
% cnf(446,plain,(plus(n1,n3)=n4),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[427,415,theory(equality)]),440,theory(equality)]),419,theory(equality)]),443,theory(equality)]),419,theory(equality)])).
% cnf(447,plain,(plus(n1,plus(X1,n2))=plus(X1,n3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[425,419,theory(equality)]),444,theory(equality)]),419,theory(equality)])).
% cnf(449,plain,(plus(n1,n4)=n5),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)],[430,415,theory(equality)]),440,theory(equality)]),419,theory(equality)]),443,theory(equality)]),419,theory(equality)]),446,theory(equality)]),419,theory(equality)])).
% cnf(450,plain,(plus(n1,plus(X1,n3))=plus(X1,n4)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[428,419,theory(equality)]),444,theory(equality)]),419,theory(equality)]),447,theory(equality)]),419,theory(equality)])).
% cnf(451,plain,(plus(X1,n4)=plus(n4,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[429,419,theory(equality)]),444,theory(equality)]),419,theory(equality)]),447,theory(equality)]),419,theory(equality)]),450,theory(equality)])).
% cnf(452,plain,(plus(n1,plus(X1,n4))=plus(X1,n5)),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)],[431,419,theory(equality)]),444,theory(equality)]),419,theory(equality)]),447,theory(equality)]),419,theory(equality)]),450,theory(equality)]),419,theory(equality)])).
% cnf(455,negated_conjecture,($false|a_select3(u_defuse,n1,n0)!=use|a_select3(u_defuse,n2,n0)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)!=use),inference(rw,[status(thm)],[375,381,theory(equality)])).
% cnf(456,negated_conjecture,($false|$false|a_select3(u_defuse,n2,n0)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)!=use),inference(rw,[status(thm)],[455,380,theory(equality)])).
% cnf(457,negated_conjecture,($false|$false|$false|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)!=use),inference(rw,[status(thm)],[456,379,theory(equality)])).
% cnf(458,negated_conjecture,($false|$false|$false|$false|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)!=use),inference(rw,[status(thm)],[457,91,theory(equality)])).
% cnf(459,negated_conjecture,(a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4)!=use),inference(cn,[status(thm)],[458,theory(equality)])).
% cnf(520,plain,(plus(n1,plus(n1,n4))=plus(n4,n2)),inference(spm,[status(thm)],[444,451,theory(equality)])).
% cnf(523,plain,(plus(n1,n5)=plus(n4,n2)),inference(rw,[status(thm)],[520,449,theory(equality)])).
% cnf(534,plain,(plus(n1,plus(n3,n2))=plus(n2,n4)),inference(spm,[status(thm)],[450,445,theory(equality)])).
% cnf(538,plain,(plus(n3,n3)=plus(n2,n4)),inference(rw,[status(thm)],[534,447,theory(equality)])).
% cnf(541,plain,(plus(n1,plus(n4,n2))=plus(n2,n5)),inference(spm,[status(thm)],[452,445,theory(equality)])).
% cnf(545,plain,(plus(n4,n3)=plus(n2,n5)),inference(rw,[status(thm)],[541,447,theory(equality)])).
% cnf(558,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[249,436,theory(equality)])).
% cnf(591,plain,(a_select2(tptp_update2(X1,X2,X3),X4)=a_select2(X1,X4)|X2=X4),inference(er,[status(thm)],[94,theory(equality)])).
% cnf(5191,plain,(~leq(plus(n1,X1),X1)),inference(spm,[status(thm)],[558,419,theory(equality)])).
% cnf(6021,plain,(~leq(plus(X1,n5),plus(X1,n4))),inference(spm,[status(thm)],[5191,452,theory(equality)])).
% cnf(8642,plain,(~leq(plus(n2,n5),plus(n4,n2))),inference(spm,[status(thm)],[6021,445,theory(equality)])).
% cnf(8651,plain,(~leq(plus(n2,n5),plus(n1,n5))),inference(rw,[status(thm)],[8642,523,theory(equality)])).
% cnf(8665,plain,(plus(n1,n5)=plus(n3,n3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[538,445,theory(equality)]),523,theory(equality)])).
% cnf(8672,plain,(plus(n5,n2)=plus(n4,n3)),inference(rw,[status(thm)],[545,445,theory(equality)])).
% cnf(8673,plain,(plus(n5,n2)=plus(n3,n4)),inference(rw,[status(thm)],[8672,451,theory(equality)])).
% cnf(8679,plain,(~leq(plus(n3,n4),plus(n1,n5))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8651,445,theory(equality)]),8673,theory(equality)])).
% cnf(9188,negated_conjecture,(n5=n4|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n4)!=use),inference(spm,[status(thm)],[459,591,theory(equality)])).
% cnf(9189,negated_conjecture,(n5=n4|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use|$false),inference(rw,[status(thm)],[9188,91,theory(equality)])).
% cnf(9190,negated_conjecture,(n5=n4|a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3)!=use),inference(cn,[status(thm)],[9189,theory(equality)])).
% cnf(10751,negated_conjecture,(n5=n4|n5=n3|a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3)!=use),inference(spm,[status(thm)],[9190,591,theory(equality)])).
% cnf(10752,negated_conjecture,(n5=n3|n5=n4|n4=n3|a_select2(tptp_update2(xinit_defuse,n3,use),n3)!=use),inference(spm,[status(thm)],[10751,591,theory(equality)])).
% cnf(10754,negated_conjecture,(n5=n3|n5=n4|n4=n3|$false),inference(rw,[status(thm)],[10752,91,theory(equality)])).
% cnf(10755,negated_conjecture,(n5=n3|n5=n4|n4=n3),inference(cn,[status(thm)],[10754,theory(equality)])).
% cnf(10762,negated_conjecture,(gt(n4,n4)|n4=n3|n5=n3),inference(spm,[status(thm)],[117,10755,theory(equality)])).
% cnf(10799,negated_conjecture,(n4=n3|n5=n3),inference(sr,[status(thm)],[10762,249,theory(equality)])).
% cnf(10836,negated_conjecture,(gt(n3,n3)|n4=n3),inference(spm,[status(thm)],[126,10799,theory(equality)])).
% cnf(10874,negated_conjecture,(n4=n3),inference(sr,[status(thm)],[10836,249,theory(equality)])).
% cnf(10921,plain,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8679,10874,theory(equality)]),8665,theory(equality)]),251,theory(equality)])).
% cnf(10922,plain,($false),inference(cn,[status(thm)],[10921,theory(equality)])).
% cnf(10923,plain,($false),10922,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 606
% # ...of these trivial : 24
% # ...subsumed : 78
% # ...remaining for further processing: 504
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 59
% # Generated clauses : 6318
% # ...of the previous two non-trivial : 6118
% # Contextual simplify-reflections : 0
% # Paramodulations : 6305
% # Factorizations : 3
% # Equation resolutions : 10
% # Current number of processed clauses: 246
% # Positive orientable unit clauses: 79
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 18
% # Non-unit-clauses : 145
% # Current number of unprocessed clauses: 4880
% # ...number of literals in the above : 32181
% # Clause-clause subsumption calls (NU) : 4837
% # Rec. Clause-clause subsumption calls : 1429
% # Unit Clause-clause subsumption calls : 132
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 27
% # Backwards rewriting index: 268 leaves, 1.24+/-1.430 terms/leaf
% # Paramod-from index: 111 leaves, 1.04+/-0.186 terms/leaf
% # Paramod-into index: 165 leaves, 1.12+/-0.537 terms/leaf
% # -------------------------------------------------
% # User time : 0.330 s
% # System time : 0.012 s
% # Total time : 0.342 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.61 CPU 0.68 WC
% FINAL PrfWatch: 0.61 CPU 0.68 WC
% SZS output end Solution for /tmp/SystemOnTPTP1296/SWV104+1.tptp
%
%------------------------------------------------------------------------------