TSTP Solution File: SWW102+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW102+1 : TPTP v5.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Mon Feb 28 19:46:03 EST 2011
% Result : Theorem 0.65s
% Output : Solution 0.65s
% 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/SystemOnTPTP7498/SWW102+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7498/SWW102+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7498/SWW102+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 7586
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(~(bool(X1))=>not1(X1)=phi(X1)),file('/tmp/SRASS.s.p', not1_axiom1)).
% fof(2, axiom,not1(false)=true,file('/tmp/SRASS.s.p', not1_axiom2)).
% fof(3, axiom,not1(true)=false,file('/tmp/SRASS.s.p', not1_axiom3)).
% fof(4, axiom,![X2]:not2(X2)=impl(X2,false2),file('/tmp/SRASS.s.p', def_not2)).
% fof(5, axiom,![X3]:(bool(X3)<=>(X3=false|X3=true)),file('/tmp/SRASS.s.p', def_bool)).
% fof(6, axiom,![X4]:lazy_impl(false,X4)=true,file('/tmp/SRASS.s.p', lazy_impl_axiom2)).
% fof(7, axiom,((~(true=false)&~(true=err))&~(false=err)),file('/tmp/SRASS.s.p', distinct_false_true_err)).
% fof(8, axiom,![X1]:![X4]:(~(bool(X1))=>impl(X1,X4)=phi(X1)),file('/tmp/SRASS.s.p', impl_axiom1)).
% fof(16, axiom,![X3]:((d(X3)&phi(X3)=X3)|(~(d(X3))&phi(X3)=err)),file('/tmp/SRASS.s.p', def_phi)).
% fof(17, axiom,![X4]:(bool(X4)=>impl(false,X4)=true),file('/tmp/SRASS.s.p', impl_axiom3)).
% fof(18, axiom,![X4]:lazy_impl(true,X4)=phi(X4),file('/tmp/SRASS.s.p', lazy_impl_axiom3)).
% fof(25, axiom,((d(true)&d(false))&d(err)),file('/tmp/SRASS.s.p', false_true_err_in_d)).
% fof(27, axiom,![X4]:(bool(X4)=>impl(true,X4)=X4),file('/tmp/SRASS.s.p', impl_axiom4)).
% fof(28, axiom,![X3]:![X5]:(forallprefers(X3,X5)<=>(((~(d(X3))&d(X5))|(((d(X3)&d(X5))&~(bool(X3)))&bool(X5)))|(X3=false&X5=true))),file('/tmp/SRASS.s.p', def_forallprefers)).
% fof(30, axiom,![X3]:(prop(X3)=false<=>~(bool(X3))),file('/tmp/SRASS.s.p', prop_false)).
% fof(31, axiom,![X3]:(prop(X3)=true<=>bool(X3)),file('/tmp/SRASS.s.p', prop_true)).
% fof(33, axiom,?[X2]:(false2=phi(f7(X2))&~(?[X7]:forallprefers(f7(X7),f7(X2)))),file('/tmp/SRASS.s.p', def_false2)).
% fof(41, axiom,![X2]:f7(X2)=lazy_impl(prop(X2),X2),file('/tmp/SRASS.s.p', def_f7)).
% fof(45, conjecture,![X2]:not1(X2)=not2(X2),file('/tmp/SRASS.s.p', not1_not2)).
% fof(46, negated_conjecture,~(![X2]:not1(X2)=not2(X2)),inference(assume_negation,[status(cth)],[45])).
% fof(47, plain,![X1]:(~(bool(X1))=>not1(X1)=phi(X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(48, plain,![X1]:![X4]:(~(bool(X1))=>impl(X1,X4)=phi(X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(56, plain,![X3]:((d(X3)&phi(X3)=X3)|(~(d(X3))&phi(X3)=err)),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(57, plain,![X3]:![X5]:(forallprefers(X3,X5)<=>(((~(d(X3))&d(X5))|(((d(X3)&d(X5))&~(bool(X3)))&bool(X5)))|(X3=false&X5=true))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(59, plain,![X3]:(prop(X3)=false<=>~(bool(X3))),inference(fof_simplification,[status(thm)],[30,theory(equality)])).
% fof(60, plain,![X1]:(bool(X1)|not1(X1)=phi(X1)),inference(fof_nnf,[status(thm)],[47])).
% fof(61, plain,![X2]:(bool(X2)|not1(X2)=phi(X2)),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(not1(X1)=phi(X1)|bool(X1)),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,plain,(not1(false)=true),inference(split_conjunct,[status(thm)],[2])).
% cnf(64,plain,(not1(true)=false),inference(split_conjunct,[status(thm)],[3])).
% fof(65, plain,![X3]:not2(X3)=impl(X3,false2),inference(variable_rename,[status(thm)],[4])).
% cnf(66,plain,(not2(X1)=impl(X1,false2)),inference(split_conjunct,[status(thm)],[65])).
% fof(67, plain,![X3]:((~(bool(X3))|(X3=false|X3=true))&((~(X3=false)&~(X3=true))|bool(X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(68, plain,![X4]:((~(bool(X4))|(X4=false|X4=true))&((~(X4=false)&~(X4=true))|bool(X4))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X4]:((~(bool(X4))|(X4=false|X4=true))&((~(X4=false)|bool(X4))&(~(X4=true)|bool(X4)))),inference(distribute,[status(thm)],[68])).
% cnf(70,plain,(bool(X1)|X1!=true),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,plain,(bool(X1)|X1!=false),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,plain,(X1=true|X1=false|~bool(X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(73, plain,![X5]:lazy_impl(false,X5)=true,inference(variable_rename,[status(thm)],[6])).
% cnf(74,plain,(lazy_impl(false,X1)=true),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(false!=err),inference(split_conjunct,[status(thm)],[7])).
% cnf(76,plain,(true!=err),inference(split_conjunct,[status(thm)],[7])).
% cnf(77,plain,(true!=false),inference(split_conjunct,[status(thm)],[7])).
% fof(78, plain,![X1]:![X4]:(bool(X1)|impl(X1,X4)=phi(X1)),inference(fof_nnf,[status(thm)],[48])).
% fof(79, plain,![X5]:![X6]:(bool(X5)|impl(X5,X6)=phi(X5)),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(impl(X1,X2)=phi(X1)|bool(X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(102, plain,![X4]:((d(X4)&phi(X4)=X4)|(~(d(X4))&phi(X4)=err)),inference(variable_rename,[status(thm)],[56])).
% fof(103, plain,![X4]:(((~(d(X4))|d(X4))&(phi(X4)=err|d(X4)))&((~(d(X4))|phi(X4)=X4)&(phi(X4)=err|phi(X4)=X4))),inference(distribute,[status(thm)],[102])).
% cnf(104,plain,(phi(X1)=X1|phi(X1)=err),inference(split_conjunct,[status(thm)],[103])).
% cnf(105,plain,(phi(X1)=X1|~d(X1)),inference(split_conjunct,[status(thm)],[103])).
% cnf(106,plain,(d(X1)|phi(X1)=err),inference(split_conjunct,[status(thm)],[103])).
% fof(108, plain,![X4]:(~(bool(X4))|impl(false,X4)=true),inference(fof_nnf,[status(thm)],[17])).
% fof(109, plain,![X5]:(~(bool(X5))|impl(false,X5)=true),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(impl(false,X1)=true|~bool(X1)),inference(split_conjunct,[status(thm)],[109])).
% fof(111, plain,![X5]:lazy_impl(true,X5)=phi(X5),inference(variable_rename,[status(thm)],[18])).
% cnf(112,plain,(lazy_impl(true,X1)=phi(X1)),inference(split_conjunct,[status(thm)],[111])).
% cnf(130,plain,(d(false)),inference(split_conjunct,[status(thm)],[25])).
% cnf(131,plain,(d(true)),inference(split_conjunct,[status(thm)],[25])).
% fof(133, plain,![X4]:(~(bool(X4))|impl(true,X4)=X4),inference(fof_nnf,[status(thm)],[27])).
% fof(134, plain,![X5]:(~(bool(X5))|impl(true,X5)=X5),inference(variable_rename,[status(thm)],[133])).
% cnf(135,plain,(impl(true,X1)=X1|~bool(X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(136, plain,![X3]:![X5]:((~(forallprefers(X3,X5))|(((~(d(X3))&d(X5))|(((d(X3)&d(X5))&~(bool(X3)))&bool(X5)))|(X3=false&X5=true)))&((((d(X3)|~(d(X5)))&(((~(d(X3))|~(d(X5)))|bool(X3))|~(bool(X5))))&(~(X3=false)|~(X5=true)))|forallprefers(X3,X5))),inference(fof_nnf,[status(thm)],[57])).
% fof(137, plain,![X6]:![X7]:((~(forallprefers(X6,X7))|(((~(d(X6))&d(X7))|(((d(X6)&d(X7))&~(bool(X6)))&bool(X7)))|(X6=false&X7=true)))&((((d(X6)|~(d(X7)))&(((~(d(X6))|~(d(X7)))|bool(X6))|~(bool(X7))))&(~(X6=false)|~(X7=true)))|forallprefers(X6,X7))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X6]:![X7]:((((((((X6=false|(d(X6)|~(d(X6))))|~(forallprefers(X6,X7)))&((X7=true|(d(X6)|~(d(X6))))|~(forallprefers(X6,X7))))&(((X6=false|(d(X7)|~(d(X6))))|~(forallprefers(X6,X7)))&((X7=true|(d(X7)|~(d(X6))))|~(forallprefers(X6,X7)))))&(((X6=false|(~(bool(X6))|~(d(X6))))|~(forallprefers(X6,X7)))&((X7=true|(~(bool(X6))|~(d(X6))))|~(forallprefers(X6,X7)))))&(((X6=false|(bool(X7)|~(d(X6))))|~(forallprefers(X6,X7)))&((X7=true|(bool(X7)|~(d(X6))))|~(forallprefers(X6,X7)))))&((((((X6=false|(d(X6)|d(X7)))|~(forallprefers(X6,X7)))&((X7=true|(d(X6)|d(X7)))|~(forallprefers(X6,X7))))&(((X6=false|(d(X7)|d(X7)))|~(forallprefers(X6,X7)))&((X7=true|(d(X7)|d(X7)))|~(forallprefers(X6,X7)))))&(((X6=false|(~(bool(X6))|d(X7)))|~(forallprefers(X6,X7)))&((X7=true|(~(bool(X6))|d(X7)))|~(forallprefers(X6,X7)))))&(((X6=false|(bool(X7)|d(X7)))|~(forallprefers(X6,X7)))&((X7=true|(bool(X7)|d(X7)))|~(forallprefers(X6,X7))))))&((((d(X6)|~(d(X7)))|forallprefers(X6,X7))&((((~(d(X6))|~(d(X7)))|bool(X6))|~(bool(X7)))|forallprefers(X6,X7)))&((~(X6=false)|~(X7=true))|forallprefers(X6,X7)))),inference(distribute,[status(thm)],[137])).
% cnf(139,plain,(forallprefers(X1,X2)|X2!=true|X1!=false),inference(split_conjunct,[status(thm)],[138])).
% fof(180, plain,![X3]:((~(prop(X3)=false)|~(bool(X3)))&(bool(X3)|prop(X3)=false)),inference(fof_nnf,[status(thm)],[59])).
% fof(181, plain,![X4]:((~(prop(X4)=false)|~(bool(X4)))&(bool(X4)|prop(X4)=false)),inference(variable_rename,[status(thm)],[180])).
% cnf(182,plain,(prop(X1)=false|bool(X1)),inference(split_conjunct,[status(thm)],[181])).
% fof(184, plain,![X3]:((~(prop(X3)=true)|bool(X3))&(~(bool(X3))|prop(X3)=true)),inference(fof_nnf,[status(thm)],[31])).
% fof(185, plain,![X4]:((~(prop(X4)=true)|bool(X4))&(~(bool(X4))|prop(X4)=true)),inference(variable_rename,[status(thm)],[184])).
% cnf(186,plain,(prop(X1)=true|~bool(X1)),inference(split_conjunct,[status(thm)],[185])).
% fof(190, plain,?[X2]:(false2=phi(f7(X2))&![X7]:~(forallprefers(f7(X7),f7(X2)))),inference(fof_nnf,[status(thm)],[33])).
% fof(191, plain,?[X8]:(false2=phi(f7(X8))&![X9]:~(forallprefers(f7(X9),f7(X8)))),inference(variable_rename,[status(thm)],[190])).
% fof(192, plain,(false2=phi(f7(esk1_0))&![X9]:~(forallprefers(f7(X9),f7(esk1_0)))),inference(skolemize,[status(esa)],[191])).
% fof(193, plain,![X9]:(~(forallprefers(f7(X9),f7(esk1_0)))&false2=phi(f7(esk1_0))),inference(shift_quantors,[status(thm)],[192])).
% cnf(194,plain,(false2=phi(f7(esk1_0))),inference(split_conjunct,[status(thm)],[193])).
% cnf(195,plain,(~forallprefers(f7(X1),f7(esk1_0))),inference(split_conjunct,[status(thm)],[193])).
% fof(226, plain,![X3]:f7(X3)=lazy_impl(prop(X3),X3),inference(variable_rename,[status(thm)],[41])).
% cnf(227,plain,(f7(X1)=lazy_impl(prop(X1),X1)),inference(split_conjunct,[status(thm)],[226])).
% fof(242, negated_conjecture,?[X2]:~(not1(X2)=not2(X2)),inference(fof_nnf,[status(thm)],[46])).
% fof(243, negated_conjecture,?[X3]:~(not1(X3)=not2(X3)),inference(variable_rename,[status(thm)],[242])).
% fof(244, negated_conjecture,~(not1(esk8_0)=not2(esk8_0)),inference(skolemize,[status(esa)],[243])).
% cnf(245,negated_conjecture,(not1(esk8_0)!=not2(esk8_0)),inference(split_conjunct,[status(thm)],[244])).
% cnf(246,negated_conjecture,(impl(esk8_0,false2)!=not1(esk8_0)),inference(rw,[status(thm)],[245,66,theory(equality)]),['unfolding']).
% cnf(248,plain,(lazy_impl(true,f7(esk1_0))=false2),inference(rw,[status(thm)],[194,112,theory(equality)]),['unfolding']).
% cnf(255,plain,(lazy_impl(true,X1)=X1|lazy_impl(true,X1)=err),inference(rw,[status(thm)],[inference(rw,[status(thm)],[104,112,theory(equality)]),112,theory(equality)]),['unfolding']).
% cnf(256,plain,(lazy_impl(true,X1)=err|d(X1)),inference(rw,[status(thm)],[106,112,theory(equality)]),['unfolding']).
% cnf(257,plain,(lazy_impl(true,X1)=not1(X1)|bool(X1)),inference(rw,[status(thm)],[62,112,theory(equality)]),['unfolding']).
% cnf(258,plain,(impl(X1,X2)=lazy_impl(true,X1)|bool(X1)),inference(rw,[status(thm)],[80,112,theory(equality)]),['unfolding']).
% cnf(263,plain,(lazy_impl(true,X1)=X1|~d(X1)),inference(rw,[status(thm)],[105,112,theory(equality)]),['unfolding']).
% cnf(267,plain,(lazy_impl(true,lazy_impl(prop(esk1_0),esk1_0))=false2),inference(rw,[status(thm)],[248,227,theory(equality)]),['unfolding']).
% cnf(268,plain,(~forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk1_0),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,227,theory(equality)]),227,theory(equality)]),['unfolding']).
% cnf(302,negated_conjecture,(bool(esk8_0)|lazy_impl(true,esk8_0)!=impl(esk8_0,false2)),inference(spm,[status(thm)],[246,257,theory(equality)])).
% cnf(304,plain,(lazy_impl(true,false)=true|bool(false)),inference(spm,[status(thm)],[63,257,theory(equality)])).
% cnf(308,plain,(false2=err|d(lazy_impl(prop(esk1_0),esk1_0))),inference(spm,[status(thm)],[256,267,theory(equality)])).
% cnf(309,plain,(false2=lazy_impl(prop(esk1_0),esk1_0)|~d(lazy_impl(prop(esk1_0),esk1_0))),inference(spm,[status(thm)],[263,267,theory(equality)])).
% cnf(311,plain,(lazy_impl(true,lazy_impl(false,esk1_0))=false2|bool(esk1_0)),inference(spm,[status(thm)],[267,182,theory(equality)])).
% cnf(312,plain,(lazy_impl(true,true)=false2|bool(esk1_0)),inference(rw,[status(thm)],[311,74,theory(equality)])).
% cnf(317,plain,(lazy_impl(true,X3)=err|X3!=err),inference(ef,[status(thm)],[255,theory(equality)])).
% cnf(527,negated_conjecture,(bool(esk8_0)),inference(csr,[status(thm)],[302,258])).
% cnf(528,negated_conjecture,(false=esk8_0|true=esk8_0),inference(spm,[status(thm)],[72,527,theory(equality)])).
% cnf(530,negated_conjecture,(esk8_0=true|not1(false)!=impl(false,false2)),inference(spm,[status(thm)],[246,528,theory(equality)])).
% cnf(532,negated_conjecture,(esk8_0=true|true!=impl(false,false2)),inference(rw,[status(thm)],[530,63,theory(equality)])).
% cnf(535,negated_conjecture,(esk8_0=true|~bool(false2)),inference(spm,[status(thm)],[532,110,theory(equality)])).
% cnf(536,negated_conjecture,(esk8_0=true|false!=false2),inference(spm,[status(thm)],[535,71,theory(equality)])).
% cnf(538,negated_conjecture,(not1(true)!=impl(true,false2)|false2!=false),inference(spm,[status(thm)],[246,536,theory(equality)])).
% cnf(540,negated_conjecture,(false!=impl(true,false2)|false2!=false),inference(rw,[status(thm)],[538,64,theory(equality)])).
% cnf(559,negated_conjecture,(false2!=false|~bool(false2)),inference(spm,[status(thm)],[540,135,theory(equality)])).
% cnf(563,negated_conjecture,(false2!=false),inference(csr,[status(thm)],[559,71])).
% cnf(585,plain,(false2=true|bool(esk1_0)|~d(true)),inference(spm,[status(thm)],[263,312,theory(equality)])).
% cnf(592,plain,(false2=true|bool(esk1_0)|$false),inference(rw,[status(thm)],[585,131,theory(equality)])).
% cnf(593,plain,(false2=true|bool(esk1_0)),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(595,plain,(false=esk1_0|true=esk1_0|false2=true),inference(spm,[status(thm)],[72,593,theory(equality)])).
% cnf(598,plain,(true=false|bool(false)|~d(false)),inference(spm,[status(thm)],[263,304,theory(equality)])).
% cnf(604,plain,(true=false|bool(false)|$false),inference(rw,[status(thm)],[598,130,theory(equality)])).
% cnf(605,plain,(true=false|bool(false)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(606,plain,(bool(false)),inference(sr,[status(thm)],[605,77,theory(equality)])).
% cnf(659,plain,(lazy_impl(prop(esk1_0),esk1_0)=false2|false2=err),inference(spm,[status(thm)],[309,308,theory(equality)])).
% cnf(681,plain,(false2=err|~forallprefers(lazy_impl(prop(X1),X1),false2)),inference(spm,[status(thm)],[268,659,theory(equality)])).
% cnf(682,plain,(lazy_impl(true,esk1_0)=false2|false2=err|~bool(esk1_0)),inference(spm,[status(thm)],[659,186,theory(equality)])).
% cnf(708,plain,(false2=err|false!=lazy_impl(prop(X1),X1)|true!=false2),inference(spm,[status(thm)],[681,139,theory(equality)])).
% cnf(728,plain,(false2=err|lazy_impl(true,X1)!=false|false2!=true|~bool(X1)),inference(spm,[status(thm)],[708,186,theory(equality)])).
% cnf(861,plain,(false2=err|false2=esk1_0|~bool(esk1_0)),inference(spm,[status(thm)],[255,682,theory(equality)])).
% cnf(862,plain,(false2=err|esk1_0!=err|~bool(esk1_0)),inference(spm,[status(thm)],[317,682,theory(equality)])).
% cnf(908,plain,(false2=esk1_0|false2=err|true!=esk1_0),inference(spm,[status(thm)],[861,70,theory(equality)])).
% cnf(1662,plain,(false2=err|X1!=false|false2!=true|~bool(X1)|~d(X1)),inference(spm,[status(thm)],[728,263,theory(equality)])).
% cnf(1773,plain,(false2=err|false2=true|esk1_0!=err),inference(spm,[status(thm)],[862,593,theory(equality)])).
% cnf(1782,plain,(false2=err|false2!=true|X1!=false|~d(X1)),inference(csr,[status(thm)],[1662,71])).
% cnf(1791,plain,(false2=err|false2!=true),inference(spm,[status(thm)],[1782,130,theory(equality)])).
% cnf(1792,plain,(true=err|esk1_0=true|esk1_0=false),inference(spm,[status(thm)],[1791,595,theory(equality)])).
% cnf(1794,plain,(esk1_0=err|false2=err|esk1_0!=true),inference(spm,[status(thm)],[1791,908,theory(equality)])).
% cnf(1795,plain,(esk1_0=true|esk1_0=false),inference(sr,[status(thm)],[1792,76,theory(equality)])).
% cnf(1814,plain,(false2=false|false2=err|esk1_0=true|~bool(false)),inference(spm,[status(thm)],[861,1795,theory(equality)])).
% cnf(1831,plain,(false2=false|false2=err|esk1_0=true|$false),inference(rw,[status(thm)],[1814,606,theory(equality)])).
% cnf(1832,plain,(false2=false|false2=err|esk1_0=true),inference(cn,[status(thm)],[1831,theory(equality)])).
% cnf(1833,plain,(false2=err|esk1_0=true),inference(sr,[status(thm)],[1832,563,theory(equality)])).
% cnf(1848,plain,(esk1_0=err|false2=err),inference(csr,[status(thm)],[1794,1833])).
% cnf(1862,plain,(false2=err|false2=true),inference(csr,[status(thm)],[1773,1848])).
% cnf(1863,plain,(false2=err),inference(csr,[status(thm)],[1862,1791])).
% cnf(1904,plain,(err=true|bool(esk1_0)),inference(rw,[status(thm)],[593,1863,theory(equality)])).
% cnf(1905,plain,(bool(esk1_0)),inference(sr,[status(thm)],[1904,76,theory(equality)])).
% cnf(1921,plain,(lazy_impl(true,lazy_impl(prop(esk1_0),esk1_0))=err),inference(rw,[status(thm)],[267,1863,theory(equality)])).
% cnf(1979,plain,(lazy_impl(true,lazy_impl(true,esk1_0))=err|~bool(esk1_0)),inference(spm,[status(thm)],[1921,186,theory(equality)])).
% cnf(1993,plain,(lazy_impl(true,lazy_impl(true,esk1_0))=err|$false),inference(rw,[status(thm)],[1979,1905,theory(equality)])).
% cnf(1994,plain,(lazy_impl(true,lazy_impl(true,esk1_0))=err),inference(cn,[status(thm)],[1993,theory(equality)])).
% cnf(2013,plain,(lazy_impl(true,esk1_0)=err),inference(spm,[status(thm)],[1994,255,theory(equality)])).
% cnf(2040,plain,(err=esk1_0|~d(esk1_0)),inference(spm,[status(thm)],[263,2013,theory(equality)])).
% cnf(2050,plain,(false=err|esk1_0=true|~d(false)),inference(spm,[status(thm)],[2040,1795,theory(equality)])).
% cnf(2051,plain,(false=err|esk1_0=true|$false),inference(rw,[status(thm)],[2050,130,theory(equality)])).
% cnf(2052,plain,(false=err|esk1_0=true),inference(cn,[status(thm)],[2051,theory(equality)])).
% cnf(2053,plain,(esk1_0=true),inference(sr,[status(thm)],[2052,75,theory(equality)])).
% cnf(2060,plain,(true=err|~d(esk1_0)),inference(rw,[status(thm)],[2040,2053,theory(equality)])).
% cnf(2061,plain,(true=err|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2060,2053,theory(equality)]),131,theory(equality)])).
% cnf(2062,plain,(true=err),inference(cn,[status(thm)],[2061,theory(equality)])).
% cnf(2063,plain,($false),inference(sr,[status(thm)],[2062,76,theory(equality)])).
% cnf(2064,plain,($false),2063,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 412
% # ...of these trivial : 23
% # ...subsumed : 153
% # ...remaining for further processing: 236
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 34
% # Backward-rewritten : 63
% # Generated clauses : 1100
% # ...of the previous two non-trivial : 819
% # Contextual simplify-reflections : 112
% # Paramodulations : 1086
% # Factorizations : 13
% # Equation resolutions : 1
% # Current number of processed clauses: 77
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 218
% # ...number of literals in the above : 515
% # Clause-clause subsumption calls (NU) : 786
% # Rec. Clause-clause subsumption calls : 626
% # Unit Clause-clause subsumption calls : 39
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 91 leaves, 1.18+/-0.483 terms/leaf
% # Paramod-from index: 33 leaves, 1.03+/-0.171 terms/leaf
% # Paramod-into index: 87 leaves, 1.15+/-0.468 terms/leaf
% # -------------------------------------------------
% # User time : 0.056 s
% # System time : 0.004 s
% # Total time : 0.060 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP7498/SWW102+1.tptp
%
%------------------------------------------------------------------------------