TSTP Solution File: LCL644+1.001 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL644+1.001 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 14:32:37 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP28891/LCL644+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28891/LCL644+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28891/LCL644+1.001.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 28987
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,~(?[X1]:~(((~(((![X2]:((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X2]:((~(r1(X1,X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2)))))|~(((![X2]:(((~(r1(X1,X2))|![X1]:((~(r1(X2,X1))|~((p2(X1)&![X2]:(~(r1(X1,X2))|p2(X2)))))|p1(X1)))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))&![X2]:(((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X1]:((~(r1(X2,X1))|p2(X1))|~(((p1(X1)&![X2]:(~(r1(X1,X2))|p1(X2)))&p1(X1))))))&![X2]:((((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2))))))),file('/tmp/SRASS.s.p', main)).
% fof(2, negated_conjecture,~(~(?[X1]:~(((~(((![X2]:((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X2]:((~(r1(X1,X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2)))))|~(((![X2]:(((~(r1(X1,X2))|![X1]:((~(r1(X2,X1))|~((p2(X1)&![X2]:(~(r1(X1,X2))|p2(X2)))))|p1(X1)))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))&![X2]:(((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X1]:((~(r1(X2,X1))|p2(X1))|~(((p1(X1)&![X2]:(~(r1(X1,X2))|p1(X2)))&p1(X1))))))&![X2]:((((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(~(?[X1]:~(((~(((![X2]:((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X2]:((~(r1(X1,X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2)))))|~(((![X2]:(((~(r1(X1,X2))|![X1]:((~(r1(X2,X1))|~((p2(X1)&![X2]:(~(r1(X1,X2))|p2(X2)))))|p1(X1)))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))&![X2]:(((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X1]:((~(r1(X2,X1))|p2(X1))|~(((p1(X1)&![X2]:(~(r1(X1,X2))|p1(X2)))&p1(X1))))))&![X2]:((((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, plain,![X1]:((![X2]:(((~(r1(X1,X2))|![X1]:((~(r1(X2,X1))|~((p2(X1)&![X2]:(~(r1(X1,X2))|p2(X2)))))|p1(X1)))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))&![X2]:(((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X1]:((~(r1(X2,X1))|p2(X1))|~(((p1(X1)&![X2]:(~(r1(X1,X2))|p1(X2)))&p1(X1))))))=>epred1_1(X1)),introduced(definition)).
% fof(5, negated_conjecture,~(~(?[X1]:~(((~(((![X2]:((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|![X2]:((~(r1(X1,X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2)))))|~((epred1_1(X1)&![X2]:((((~(r1(X1,X2))|~((p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1)))))|p1(X2))|p2(X2))|~(((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2))))))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))|![X2]:((~(r1(X1,X2))|p1(X2))|~((![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))))))),inference(apply_def,[status(esa)],[3,4,theory(equality)])).
% fof(6, negated_conjecture,?[X1]:((((![X2]:((~(r1(X1,X2))|(~(p2(X2))|?[X1]:(r1(X2,X1)&~(p2(X1)))))|p1(X2))|![X2]:((~(r1(X1,X2))|p2(X2))|((~(p1(X2))|?[X1]:(r1(X2,X1)&~(p1(X1))))|~(p1(X2)))))|(~(epred1_1(X1))|?[X2]:((((r1(X1,X2)&(p2(X2)&![X1]:(~(r1(X2,X1))|p2(X1))))&~(p1(X2)))&~(p2(X2)))&((p1(X2)&![X1]:(~(r1(X2,X1))|p1(X1)))&p1(X2)))))&?[X2]:((r1(X1,X2)&~(p1(X2)))&(![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2))))&?[X2]:((r1(X1,X2)&~(p1(X2)))&(![X1]:(~(r1(X2,X1))|p1(X1))&p1(X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(7, negated_conjecture,?[X3]:((((![X4]:((~(r1(X3,X4))|(~(p2(X4))|?[X5]:(r1(X4,X5)&~(p2(X5)))))|p1(X4))|![X6]:((~(r1(X3,X6))|p2(X6))|((~(p1(X6))|?[X7]:(r1(X6,X7)&~(p1(X7))))|~(p1(X6)))))|(~(epred1_1(X3))|?[X8]:((((r1(X3,X8)&(p2(X8)&![X9]:(~(r1(X8,X9))|p2(X9))))&~(p1(X8)))&~(p2(X8)))&((p1(X8)&![X10]:(~(r1(X8,X10))|p1(X10)))&p1(X8)))))&?[X11]:((r1(X3,X11)&~(p1(X11)))&(![X12]:(~(r1(X11,X12))|p1(X12))&p1(X11))))&?[X13]:((r1(X3,X13)&~(p1(X13)))&(![X14]:(~(r1(X13,X14))|p1(X14))&p1(X13)))),inference(variable_rename,[status(thm)],[6])).
% fof(8, negated_conjecture,((((![X4]:((~(r1(esk1_0,X4))|(~(p2(X4))|(r1(X4,esk2_1(X4))&~(p2(esk2_1(X4))))))|p1(X4))|![X6]:((~(r1(esk1_0,X6))|p2(X6))|((~(p1(X6))|(r1(X6,esk3_1(X6))&~(p1(esk3_1(X6)))))|~(p1(X6)))))|(~(epred1_1(esk1_0))|((((r1(esk1_0,esk4_0)&(p2(esk4_0)&![X9]:(~(r1(esk4_0,X9))|p2(X9))))&~(p1(esk4_0)))&~(p2(esk4_0)))&((p1(esk4_0)&![X10]:(~(r1(esk4_0,X10))|p1(X10)))&p1(esk4_0)))))&((r1(esk1_0,esk5_0)&~(p1(esk5_0)))&(![X12]:(~(r1(esk5_0,X12))|p1(X12))&p1(esk5_0))))&((r1(esk1_0,esk6_0)&~(p1(esk6_0)))&(![X14]:(~(r1(esk6_0,X14))|p1(X14))&p1(esk6_0)))),inference(skolemize,[status(esa)],[7])).
% fof(9, negated_conjecture,![X4]:![X6]:![X9]:![X10]:![X12]:![X14]:((((~(r1(esk6_0,X14))|p1(X14))&p1(esk6_0))&(r1(esk1_0,esk6_0)&~(p1(esk6_0))))&((((~(r1(esk5_0,X12))|p1(X12))&p1(esk5_0))&(r1(esk1_0,esk5_0)&~(p1(esk5_0))))&((((((~(r1(esk4_0,X10))|p1(X10))&p1(esk4_0))&p1(esk4_0))&(((((~(r1(esk4_0,X9))|p2(X9))&p2(esk4_0))&r1(esk1_0,esk4_0))&~(p1(esk4_0)))&~(p2(esk4_0))))|~(epred1_1(esk1_0)))|(((~(r1(esk1_0,X6))|p2(X6))|((~(p1(X6))|(r1(X6,esk3_1(X6))&~(p1(esk3_1(X6)))))|~(p1(X6))))|((~(r1(esk1_0,X4))|(~(p2(X4))|(r1(X4,esk2_1(X4))&~(p2(esk2_1(X4))))))|p1(X4)))))),inference(shift_quantors,[status(thm)],[8])).
% fof(10, negated_conjecture,![X4]:![X6]:![X9]:![X10]:![X12]:![X14]:((((~(r1(esk6_0,X14))|p1(X14))&p1(esk6_0))&(r1(esk1_0,esk6_0)&~(p1(esk6_0))))&((((~(r1(esk5_0,X12))|p1(X12))&p1(esk5_0))&(r1(esk1_0,esk5_0)&~(p1(esk5_0))))&((((((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X10))|p1(X10))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X10))|p1(X10))|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X10))|p1(X10))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X10))|p1(X10))|~(epred1_1(esk1_0))))))&(((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0)))))))&(((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p1(esk4_0)|~(epred1_1(esk1_0)))))))&(((((((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X9))|p2(X9))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X9))|p2(X9))|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X9))|p2(X9))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|((~(r1(esk4_0,X9))|p2(X9))|~(epred1_1(esk1_0))))))&(((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p2(esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p2(esk4_0)|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p2(esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(p2(esk4_0)|~(epred1_1(esk1_0)))))))&(((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(r1(esk1_0,esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(r1(esk1_0,esk4_0)|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(r1(esk1_0,esk4_0)|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(r1(esk1_0,esk4_0)|~(epred1_1(esk1_0)))))))&(((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p1(esk4_0))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p1(esk4_0))|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p1(esk4_0))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p1(esk4_0))|~(epred1_1(esk1_0)))))))&(((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p2(esk4_0))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((r1(X6,esk3_1(X6))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p2(esk4_0))|~(epred1_1(esk1_0)))))&((((((r1(X4,esk2_1(X4))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p2(esk4_0))|~(epred1_1(esk1_0))))&(((((~(p2(esk2_1(X4)))|~(p2(X4)))|~(r1(esk1_0,X4)))|p1(X4))|(((~(p1(esk3_1(X6)))|~(p1(X6)))|~(p1(X6)))|(~(r1(esk1_0,X6))|p2(X6))))|(~(p2(esk4_0))|~(epred1_1(esk1_0)))))))))),inference(distribute,[status(thm)],[9])).
% cnf(43,negated_conjecture,(~p1(esk5_0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(45,negated_conjecture,(p1(esk5_0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(137,negated_conjecture,($false),inference(rw,[status(thm)],[43,45,theory(equality)])).
% cnf(138,negated_conjecture,($false),inference(cn,[status(thm)],[137,theory(equality)])).
% cnf(139,negated_conjecture,($false),138,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 3
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 2
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 118
% # ...number of literals in the above : 614
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 4 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.004 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP28891/LCL644+1.001.tptp
%
%------------------------------------------------------------------------------