TSTP Solution File: SWW101+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW101+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:45:54 EST 2011
% Result : Theorem 0.62s
% Output : Solution 0.62s
% 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/SystemOnTPTP7247/SWW101+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7247/SWW101+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7247/SWW101+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 7335
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,false1=false,file('/tmp/SRASS.s.p', def_false1)).
% fof(3, axiom,?[X1]:(false2=phi(f7(X1))&~(?[X2]:forallprefers(f7(X2),f7(X1)))),file('/tmp/SRASS.s.p', def_false2)).
% fof(12, axiom,![X8]:(prop(X8)=true<=>bool(X8)),file('/tmp/SRASS.s.p', prop_true)).
% fof(16, axiom,![X1]:f7(X1)=lazy_impl(prop(X1),X1),file('/tmp/SRASS.s.p', def_f7)).
% fof(17, axiom,![X8]:(bool(X8)<=>(X8=false|X8=true)),file('/tmp/SRASS.s.p', def_bool)).
% fof(18, axiom,![X8]:![X10]:(forallprefers(X8,X10)<=>(((~(d(X8))&d(X10))|(((d(X8)&d(X10))&~(bool(X8)))&bool(X10)))|(X8=false&X10=true))),file('/tmp/SRASS.s.p', def_forallprefers)).
% fof(20, axiom,![X8]:(prop(X8)=false<=>~(bool(X8))),file('/tmp/SRASS.s.p', prop_false)).
% fof(21, axiom,![X3]:lazy_impl(false,X3)=true,file('/tmp/SRASS.s.p', lazy_impl_axiom2)).
% fof(24, axiom,((~(true=false)&~(true=err))&~(false=err)),file('/tmp/SRASS.s.p', distinct_false_true_err)).
% fof(26, axiom,![X4]:![X3]:(~(bool(X4))=>lazy_impl(X4,X3)=phi(X4)),file('/tmp/SRASS.s.p', lazy_impl_axiom1)).
% fof(28, axiom,![X3]:lazy_and1(true,X3)=phi(X3),file('/tmp/SRASS.s.p', lazy_and1_axiom3)).
% fof(31, axiom,not1(true)=false,file('/tmp/SRASS.s.p', not1_axiom3)).
% fof(32, axiom,((d(true)&d(false))&d(err)),file('/tmp/SRASS.s.p', false_true_err_in_d)).
% fof(33, axiom,![X3]:lazy_impl(true,X3)=phi(X3),file('/tmp/SRASS.s.p', lazy_impl_axiom3)).
% fof(38, axiom,![X4]:(~(bool(X4))=>not1(X4)=phi(X4)),file('/tmp/SRASS.s.p', not1_axiom1)).
% fof(40, axiom,![X8]:((d(X8)&phi(X8)=X8)|(~(d(X8))&phi(X8)=err)),file('/tmp/SRASS.s.p', def_phi)).
% fof(45, conjecture,false1=false2,file('/tmp/SRASS.s.p', false1_false2)).
% fof(46, negated_conjecture,~(false1=false2),inference(assume_negation,[status(cth)],[45])).
% fof(49, plain,![X8]:![X10]:(forallprefers(X8,X10)<=>(((~(d(X8))&d(X10))|(((d(X8)&d(X10))&~(bool(X8)))&bool(X10)))|(X8=false&X10=true))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(51, plain,![X8]:(prop(X8)=false<=>~(bool(X8))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(52, plain,![X4]:![X3]:(~(bool(X4))=>lazy_impl(X4,X3)=phi(X4)),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(58, plain,![X4]:(~(bool(X4))=>not1(X4)=phi(X4)),inference(fof_simplification,[status(thm)],[38,theory(equality)])).
% fof(59, plain,![X8]:((d(X8)&phi(X8)=X8)|(~(d(X8))&phi(X8)=err)),inference(fof_simplification,[status(thm)],[40,theory(equality)])).
% fof(60, negated_conjecture,~(false1=false2),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% cnf(61,plain,(false1=false),inference(split_conjunct,[status(thm)],[1])).
% fof(64, plain,?[X1]:(false2=phi(f7(X1))&![X2]:~(forallprefers(f7(X2),f7(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(65, plain,?[X3]:(false2=phi(f7(X3))&![X4]:~(forallprefers(f7(X4),f7(X3)))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,(false2=phi(f7(esk1_0))&![X4]:~(forallprefers(f7(X4),f7(esk1_0)))),inference(skolemize,[status(esa)],[65])).
% fof(67, plain,![X4]:(~(forallprefers(f7(X4),f7(esk1_0)))&false2=phi(f7(esk1_0))),inference(shift_quantors,[status(thm)],[66])).
% cnf(68,plain,(false2=phi(f7(esk1_0))),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,plain,(~forallprefers(f7(X1),f7(esk1_0))),inference(split_conjunct,[status(thm)],[67])).
% fof(108, plain,![X8]:((~(prop(X8)=true)|bool(X8))&(~(bool(X8))|prop(X8)=true)),inference(fof_nnf,[status(thm)],[12])).
% fof(109, plain,![X9]:((~(prop(X9)=true)|bool(X9))&(~(bool(X9))|prop(X9)=true)),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(prop(X1)=true|~bool(X1)),inference(split_conjunct,[status(thm)],[109])).
% fof(121, plain,![X2]:f7(X2)=lazy_impl(prop(X2),X2),inference(variable_rename,[status(thm)],[16])).
% cnf(122,plain,(f7(X1)=lazy_impl(prop(X1),X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(123, plain,![X8]:((~(bool(X8))|(X8=false|X8=true))&((~(X8=false)&~(X8=true))|bool(X8))),inference(fof_nnf,[status(thm)],[17])).
% fof(124, plain,![X9]:((~(bool(X9))|(X9=false|X9=true))&((~(X9=false)&~(X9=true))|bool(X9))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X9]:((~(bool(X9))|(X9=false|X9=true))&((~(X9=false)|bool(X9))&(~(X9=true)|bool(X9)))),inference(distribute,[status(thm)],[124])).
% cnf(126,plain,(bool(X1)|X1!=true),inference(split_conjunct,[status(thm)],[125])).
% cnf(127,plain,(bool(X1)|X1!=false),inference(split_conjunct,[status(thm)],[125])).
% cnf(128,plain,(X1=true|X1=false|~bool(X1)),inference(split_conjunct,[status(thm)],[125])).
% fof(129, plain,![X8]:![X10]:((~(forallprefers(X8,X10))|(((~(d(X8))&d(X10))|(((d(X8)&d(X10))&~(bool(X8)))&bool(X10)))|(X8=false&X10=true)))&((((d(X8)|~(d(X10)))&(((~(d(X8))|~(d(X10)))|bool(X8))|~(bool(X10))))&(~(X8=false)|~(X10=true)))|forallprefers(X8,X10))),inference(fof_nnf,[status(thm)],[49])).
% fof(130, plain,![X11]:![X12]:((~(forallprefers(X11,X12))|(((~(d(X11))&d(X12))|(((d(X11)&d(X12))&~(bool(X11)))&bool(X12)))|(X11=false&X12=true)))&((((d(X11)|~(d(X12)))&(((~(d(X11))|~(d(X12)))|bool(X11))|~(bool(X12))))&(~(X11=false)|~(X12=true)))|forallprefers(X11,X12))),inference(variable_rename,[status(thm)],[129])).
% fof(131, plain,![X11]:![X12]:((((((((X11=false|(d(X11)|~(d(X11))))|~(forallprefers(X11,X12)))&((X12=true|(d(X11)|~(d(X11))))|~(forallprefers(X11,X12))))&(((X11=false|(d(X12)|~(d(X11))))|~(forallprefers(X11,X12)))&((X12=true|(d(X12)|~(d(X11))))|~(forallprefers(X11,X12)))))&(((X11=false|(~(bool(X11))|~(d(X11))))|~(forallprefers(X11,X12)))&((X12=true|(~(bool(X11))|~(d(X11))))|~(forallprefers(X11,X12)))))&(((X11=false|(bool(X12)|~(d(X11))))|~(forallprefers(X11,X12)))&((X12=true|(bool(X12)|~(d(X11))))|~(forallprefers(X11,X12)))))&((((((X11=false|(d(X11)|d(X12)))|~(forallprefers(X11,X12)))&((X12=true|(d(X11)|d(X12)))|~(forallprefers(X11,X12))))&(((X11=false|(d(X12)|d(X12)))|~(forallprefers(X11,X12)))&((X12=true|(d(X12)|d(X12)))|~(forallprefers(X11,X12)))))&(((X11=false|(~(bool(X11))|d(X12)))|~(forallprefers(X11,X12)))&((X12=true|(~(bool(X11))|d(X12)))|~(forallprefers(X11,X12)))))&(((X11=false|(bool(X12)|d(X12)))|~(forallprefers(X11,X12)))&((X12=true|(bool(X12)|d(X12)))|~(forallprefers(X11,X12))))))&((((d(X11)|~(d(X12)))|forallprefers(X11,X12))&((((~(d(X11))|~(d(X12)))|bool(X11))|~(bool(X12)))|forallprefers(X11,X12)))&((~(X11=false)|~(X12=true))|forallprefers(X11,X12)))),inference(distribute,[status(thm)],[130])).
% cnf(132,plain,(forallprefers(X1,X2)|X2!=true|X1!=false),inference(split_conjunct,[status(thm)],[131])).
% fof(173, plain,![X8]:((~(prop(X8)=false)|~(bool(X8)))&(bool(X8)|prop(X8)=false)),inference(fof_nnf,[status(thm)],[51])).
% fof(174, plain,![X9]:((~(prop(X9)=false)|~(bool(X9)))&(bool(X9)|prop(X9)=false)),inference(variable_rename,[status(thm)],[173])).
% cnf(175,plain,(prop(X1)=false|bool(X1)),inference(split_conjunct,[status(thm)],[174])).
% fof(177, plain,![X4]:lazy_impl(false,X4)=true,inference(variable_rename,[status(thm)],[21])).
% cnf(178,plain,(lazy_impl(false,X1)=true),inference(split_conjunct,[status(thm)],[177])).
% cnf(186,plain,(true!=err),inference(split_conjunct,[status(thm)],[24])).
% cnf(187,plain,(true!=false),inference(split_conjunct,[status(thm)],[24])).
% fof(191, plain,![X4]:![X3]:(bool(X4)|lazy_impl(X4,X3)=phi(X4)),inference(fof_nnf,[status(thm)],[52])).
% fof(192, plain,![X5]:![X6]:(bool(X5)|lazy_impl(X5,X6)=phi(X5)),inference(variable_rename,[status(thm)],[191])).
% cnf(193,plain,(lazy_impl(X1,X2)=phi(X1)|bool(X1)),inference(split_conjunct,[status(thm)],[192])).
% fof(197, plain,![X4]:lazy_and1(true,X4)=phi(X4),inference(variable_rename,[status(thm)],[28])).
% cnf(198,plain,(lazy_and1(true,X1)=phi(X1)),inference(split_conjunct,[status(thm)],[197])).
% cnf(202,plain,(not1(true)=false),inference(split_conjunct,[status(thm)],[31])).
% cnf(204,plain,(d(false)),inference(split_conjunct,[status(thm)],[32])).
% cnf(205,plain,(d(true)),inference(split_conjunct,[status(thm)],[32])).
% fof(206, plain,![X4]:lazy_impl(true,X4)=phi(X4),inference(variable_rename,[status(thm)],[33])).
% cnf(207,plain,(lazy_impl(true,X1)=phi(X1)),inference(split_conjunct,[status(thm)],[206])).
% fof(220, plain,![X4]:(bool(X4)|not1(X4)=phi(X4)),inference(fof_nnf,[status(thm)],[58])).
% fof(221, plain,![X5]:(bool(X5)|not1(X5)=phi(X5)),inference(variable_rename,[status(thm)],[220])).
% cnf(222,plain,(not1(X1)=phi(X1)|bool(X1)),inference(split_conjunct,[status(thm)],[221])).
% fof(225, plain,![X9]:((d(X9)&phi(X9)=X9)|(~(d(X9))&phi(X9)=err)),inference(variable_rename,[status(thm)],[59])).
% fof(226, plain,![X9]:(((~(d(X9))|d(X9))&(phi(X9)=err|d(X9)))&((~(d(X9))|phi(X9)=X9)&(phi(X9)=err|phi(X9)=X9))),inference(distribute,[status(thm)],[225])).
% cnf(227,plain,(phi(X1)=X1|phi(X1)=err),inference(split_conjunct,[status(thm)],[226])).
% cnf(228,plain,(phi(X1)=X1|~d(X1)),inference(split_conjunct,[status(thm)],[226])).
% cnf(229,plain,(d(X1)|phi(X1)=err),inference(split_conjunct,[status(thm)],[226])).
% cnf(243,negated_conjecture,(false1!=false2),inference(split_conjunct,[status(thm)],[60])).
% cnf(244,plain,(lazy_impl(true,X1)=lazy_and1(true,X1)),inference(rw,[status(thm)],[207,198,theory(equality)]),['unfolding']).
% cnf(245,plain,(lazy_and1(true,f7(esk1_0))=false2),inference(rw,[status(thm)],[68,198,theory(equality)]),['unfolding']).
% cnf(252,plain,(lazy_and1(true,X1)=X1|lazy_and1(true,X1)=err),inference(rw,[status(thm)],[inference(rw,[status(thm)],[227,198,theory(equality)]),198,theory(equality)]),['unfolding']).
% cnf(253,plain,(lazy_and1(true,X1)=err|d(X1)),inference(rw,[status(thm)],[229,198,theory(equality)]),['unfolding']).
% cnf(254,plain,(not1(X1)=lazy_and1(true,X1)|bool(X1)),inference(rw,[status(thm)],[222,198,theory(equality)]),['unfolding']).
% cnf(259,plain,(lazy_impl(X1,X2)=lazy_and1(true,X1)|bool(X1)),inference(rw,[status(thm)],[193,198,theory(equality)]),['unfolding']).
% cnf(260,plain,(lazy_and1(true,X1)=X1|~d(X1)),inference(rw,[status(thm)],[228,198,theory(equality)]),['unfolding']).
% cnf(264,plain,(lazy_and1(true,lazy_impl(prop(esk1_0),esk1_0))=false2),inference(rw,[status(thm)],[245,122,theory(equality)]),['unfolding']).
% cnf(265,plain,(~forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk1_0),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[69,122,theory(equality)]),122,theory(equality)]),['unfolding']).
% cnf(273,negated_conjecture,(false2!=false),inference(rw,[status(thm)],[243,61,theory(equality)])).
% cnf(303,plain,(false2=err|d(lazy_impl(prop(esk1_0),esk1_0))),inference(spm,[status(thm)],[253,264,theory(equality)])).
% cnf(304,plain,(false2=lazy_impl(prop(esk1_0),esk1_0)|~d(lazy_impl(prop(esk1_0),esk1_0))),inference(spm,[status(thm)],[260,264,theory(equality)])).
% cnf(305,plain,(lazy_and1(true,lazy_impl(false,esk1_0))=false2|bool(esk1_0)),inference(spm,[status(thm)],[264,175,theory(equality)])).
% cnf(306,plain,(lazy_and1(true,lazy_impl(true,esk1_0))=false2|~bool(esk1_0)),inference(spm,[status(thm)],[264,110,theory(equality)])).
% cnf(307,plain,(lazy_and1(true,true)=false2|bool(esk1_0)),inference(rw,[status(thm)],[305,178,theory(equality)])).
% cnf(308,plain,(lazy_and1(true,lazy_and1(true,esk1_0))=false2|~bool(esk1_0)),inference(rw,[status(thm)],[306,244,theory(equality)])).
% cnf(311,plain,(lazy_and1(true,false)=true|bool(false)),inference(spm,[status(thm)],[178,259,theory(equality)])).
% cnf(312,plain,(lazy_and1(true,true)=false|bool(true)),inference(spm,[status(thm)],[202,254,theory(equality)])).
% cnf(351,plain,(false!=lazy_impl(prop(X1),X1)|true!=lazy_impl(prop(esk1_0),esk1_0)),inference(spm,[status(thm)],[265,132,theory(equality)])).
% cnf(591,plain,(false2=true|bool(esk1_0)|~d(true)),inference(spm,[status(thm)],[260,307,theory(equality)])).
% cnf(599,plain,(false2=true|bool(esk1_0)|$false),inference(rw,[status(thm)],[591,205,theory(equality)])).
% cnf(600,plain,(false2=true|bool(esk1_0)),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(601,plain,(false=esk1_0|true=esk1_0|false2=true),inference(spm,[status(thm)],[128,600,theory(equality)])).
% cnf(629,plain,(true=false|bool(false)|~d(false)),inference(spm,[status(thm)],[260,311,theory(equality)])).
% cnf(637,plain,(true=false|bool(false)|$false),inference(rw,[status(thm)],[629,204,theory(equality)])).
% cnf(638,plain,(true=false|bool(false)),inference(cn,[status(thm)],[637,theory(equality)])).
% cnf(639,plain,(bool(false)),inference(sr,[status(thm)],[638,187,theory(equality)])).
% cnf(648,plain,(lazy_impl(prop(esk1_0),esk1_0)=false2|false2=err),inference(spm,[status(thm)],[304,303,theory(equality)])).
% cnf(676,plain,(false2=err|false2!=true|lazy_impl(prop(X1),X1)!=false),inference(spm,[status(thm)],[351,648,theory(equality)])).
% cnf(678,plain,(lazy_impl(true,esk1_0)=false2|false2=err|~bool(esk1_0)),inference(spm,[status(thm)],[648,110,theory(equality)])).
% cnf(680,plain,(lazy_and1(true,esk1_0)=false2|false2=err|~bool(esk1_0)),inference(rw,[status(thm)],[678,244,theory(equality)])).
% cnf(730,plain,(false2=err|lazy_impl(true,X1)!=false|false2!=true|~bool(X1)),inference(spm,[status(thm)],[676,110,theory(equality)])).
% cnf(735,plain,(false2=err|lazy_and1(true,X1)!=false|false2!=true|~bool(X1)),inference(rw,[status(thm)],[730,244,theory(equality)])).
% cnf(789,plain,(false=true|bool(true)|~d(true)),inference(spm,[status(thm)],[260,312,theory(equality)])).
% cnf(800,plain,(false=true|bool(true)|$false),inference(rw,[status(thm)],[789,205,theory(equality)])).
% cnf(801,plain,(false=true|bool(true)),inference(cn,[status(thm)],[800,theory(equality)])).
% cnf(802,plain,(bool(true)),inference(sr,[status(thm)],[801,187,theory(equality)])).
% cnf(873,plain,(false2=err|false2=esk1_0|~bool(esk1_0)),inference(spm,[status(thm)],[252,680,theory(equality)])).
% cnf(883,plain,(false2=esk1_0|false2=err|true!=esk1_0),inference(spm,[status(thm)],[873,126,theory(equality)])).
% cnf(998,plain,(false2=err|X1!=false|false2!=true|~bool(X1)|~d(X1)),inference(spm,[status(thm)],[735,260,theory(equality)])).
% cnf(1043,plain,(false2=err|false2!=true|X1!=false|~d(X1)),inference(csr,[status(thm)],[998,127])).
% cnf(1051,plain,(false2=err|false2!=true),inference(spm,[status(thm)],[1043,204,theory(equality)])).
% cnf(1053,plain,(true=err|esk1_0=true|esk1_0=false),inference(spm,[status(thm)],[1051,601,theory(equality)])).
% cnf(1054,plain,(esk1_0=err|false2=err|esk1_0!=true),inference(spm,[status(thm)],[1051,883,theory(equality)])).
% cnf(1055,plain,(esk1_0=true|esk1_0=false),inference(sr,[status(thm)],[1053,186,theory(equality)])).
% cnf(1057,plain,(false2=false|false2=err|esk1_0=true|~bool(false)),inference(spm,[status(thm)],[873,1055,theory(equality)])).
% cnf(1060,plain,(lazy_and1(true,lazy_and1(true,false))=false2|esk1_0=true|~bool(false)),inference(spm,[status(thm)],[308,1055,theory(equality)])).
% cnf(1075,plain,(false2=false|false2=err|esk1_0=true|$false),inference(rw,[status(thm)],[1057,639,theory(equality)])).
% cnf(1076,plain,(false2=false|false2=err|esk1_0=true),inference(cn,[status(thm)],[1075,theory(equality)])).
% cnf(1077,plain,(false2=err|esk1_0=true),inference(sr,[status(thm)],[1076,273,theory(equality)])).
% cnf(1080,plain,(lazy_and1(true,lazy_and1(true,false))=false2|esk1_0=true|$false),inference(rw,[status(thm)],[1060,639,theory(equality)])).
% cnf(1081,plain,(lazy_and1(true,lazy_and1(true,false))=false2|esk1_0=true),inference(cn,[status(thm)],[1080,theory(equality)])).
% cnf(1097,plain,(esk1_0=err|false2=err),inference(csr,[status(thm)],[1054,1077])).
% cnf(1142,plain,(lazy_and1(true,false)=false2|esk1_0=true|~d(false)),inference(spm,[status(thm)],[1081,260,theory(equality)])).
% cnf(1151,plain,(lazy_and1(true,false)=false2|esk1_0=true|$false),inference(rw,[status(thm)],[1142,204,theory(equality)])).
% cnf(1152,plain,(lazy_and1(true,false)=false2|esk1_0=true),inference(cn,[status(thm)],[1151,theory(equality)])).
% cnf(1157,plain,(false2=false|esk1_0=true|~d(false)),inference(spm,[status(thm)],[260,1152,theory(equality)])).
% cnf(1167,plain,(false2=false|esk1_0=true|$false),inference(rw,[status(thm)],[1157,204,theory(equality)])).
% cnf(1168,plain,(false2=false|esk1_0=true),inference(cn,[status(thm)],[1167,theory(equality)])).
% cnf(1169,plain,(esk1_0=true),inference(sr,[status(thm)],[1168,273,theory(equality)])).
% cnf(1184,plain,(false2=err|true=err),inference(rw,[status(thm)],[1097,1169,theory(equality)])).
% cnf(1185,plain,(false2=err),inference(sr,[status(thm)],[1184,186,theory(equality)])).
% cnf(1227,plain,(lazy_and1(true,lazy_and1(true,true))=false2|~bool(esk1_0)),inference(rw,[status(thm)],[308,1169,theory(equality)])).
% cnf(1228,plain,(lazy_and1(true,lazy_and1(true,true))=false2|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1227,1169,theory(equality)]),802,theory(equality)])).
% cnf(1229,plain,(lazy_and1(true,lazy_and1(true,true))=false2),inference(cn,[status(thm)],[1228,theory(equality)])).
% cnf(1269,plain,(lazy_and1(true,lazy_and1(true,true))=err),inference(rw,[status(thm)],[1229,1185,theory(equality)])).
% cnf(1277,plain,(lazy_and1(true,true)=err|~d(true)),inference(spm,[status(thm)],[1269,260,theory(equality)])).
% cnf(1289,plain,(lazy_and1(true,true)=err|$false),inference(rw,[status(thm)],[1277,205,theory(equality)])).
% cnf(1290,plain,(lazy_and1(true,true)=err),inference(cn,[status(thm)],[1289,theory(equality)])).
% cnf(1297,plain,(err=true|~d(true)),inference(spm,[status(thm)],[260,1290,theory(equality)])).
% cnf(1305,plain,(err=true|$false),inference(rw,[status(thm)],[1297,205,theory(equality)])).
% cnf(1306,plain,(err=true),inference(cn,[status(thm)],[1305,theory(equality)])).
% cnf(1307,plain,($false),inference(sr,[status(thm)],[1306,186,theory(equality)])).
% cnf(1308,plain,($false),1307,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 307
% # ...of these trivial : 18
% # ...subsumed : 93
% # ...remaining for further processing: 196
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 53
% # Generated clauses : 684
% # ...of the previous two non-trivial : 574
% # Contextual simplify-reflections : 62
% # Paramodulations : 673
% # Factorizations : 10
% # Equation resolutions : 1
% # Current number of processed clauses: 68
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 44
% # Current number of unprocessed clauses: 176
% # ...number of literals in the above : 417
% # Clause-clause subsumption calls (NU) : 334
% # Rec. Clause-clause subsumption calls : 314
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 85 leaves, 1.16+/-0.481 terms/leaf
% # Paramod-from index: 32 leaves, 1.03+/-0.174 terms/leaf
% # Paramod-into index: 83 leaves, 1.13+/-0.460 terms/leaf
% # -------------------------------------------------
% # User time : 0.041 s
% # System time : 0.007 s
% # Total time : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.26 WC
% FINAL PrfWatch: 0.15 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP7247/SWW101+1.tptp
%
%------------------------------------------------------------------------------