TSTP Solution File: LCL672+1.001 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL672+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 : 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 : Wed Dec 29 15:25:13 EST 2010
% Result : Theorem 8.21s
% Output : Solution 8.21s
% 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/SystemOnTPTP30029/LCL672+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30029/LCL672+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30029/LCL672+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 30161
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.95 CPU 2.03 WC
% PrfWatch: 3.94 CPU 4.03 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.93 CPU 6.04 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:r1(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(2, axiom,![X1]:![X2]:![X3]:((r1(X1,X2)&r1(X2,X3))=>r1(X1,X3)),file('/tmp/SRASS.s.p', transitivity)).
% fof(3, conjecture,~(?[X1]:~(((((((((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))&p1(X2))))))&~(![X2]:(~(r1(X1,X2))|p1(X2))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~((~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))))&~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2))))))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~($true))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|![X2]:(~(r1(X1,X2))|p2(X2)))|![X2]:((~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2)))))|![X1]:(~(r1(X2,X1))|p1(X1))))|![X2]:(~(r1(X1,X2))|p1(X2))))),file('/tmp/SRASS.s.p', main)).
% fof(4, negated_conjecture,~(~(?[X1]:~(((((((((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))&p1(X2))))))&~(![X2]:(~(r1(X1,X2))|p1(X2))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~((~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))))&~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2))))))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~($true))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|![X2]:(~(r1(X1,X2))|p2(X2)))|![X2]:((~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2)))))|![X1]:(~(r1(X2,X1))|p1(X1))))|![X2]:(~(r1(X1,X2))|p1(X2)))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, negated_conjecture,~(~(?[X1]:~(((((((((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(p1(X2))))))&p1(X2))))))&~(![X2]:(~(r1(X1,X2))|p1(X2))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~((~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~((~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|p1(X1)))))))&~(![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2))))))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|((~(![X2]:(~(r1(X1,X2))|p2(X2)))&~(![X2]:(~(r1(X1,X2))|~(![X1]:~(r1(X2,X1))))))&~(![X2]:(~(r1(X1,X2))|p1(X2)))))|![X2]:(~(r1(X1,X2))|p2(X2)))|![X2]:((~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|~(![X2]:(~(r1(X1,X2))|p1(X2)))))|![X1]:(~(r1(X2,X1))|p1(X1))))|![X2]:(~(r1(X1,X2))|p1(X2)))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(6, plain,![X2]:r1(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(7,plain,(r1(X1,X1)),inference(split_conjunct,[status(thm)],[6])).
% fof(8, plain,![X1]:![X2]:![X3]:((~(r1(X1,X2))|~(r1(X2,X3)))|r1(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(9, plain,![X4]:![X5]:![X6]:((~(r1(X4,X5))|~(r1(X5,X6)))|r1(X4,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(10,plain,(r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, negated_conjecture,?[X1]:((((((((![X2]:(~(r1(X1,X2))|p2(X2))|![X2]:(~(r1(X1,X2))|(![X1]:(~(r1(X2,X1))|?[X2]:(r1(X1,X2)&p1(X2)))|~(p1(X2)))))|![X2]:(~(r1(X1,X2))|p1(X2)))&((![X2]:(~(r1(X1,X2))|p2(X2))|![X2]:(~(r1(X1,X2))|![X1]:(~(r1(X2,X1))|(![X2]:(~(r1(X1,X2))|?[X1]:(r1(X2,X1)&~(p1(X1))))|![X2]:(~(r1(X1,X2))|p1(X2))))))|![X2]:(~(r1(X1,X2))|p1(X2))))&((![X2]:(~(r1(X1,X2))|p2(X2))|![X2]:(~(r1(X1,X2))|(![X1]:(~(r1(X2,X1))|?[X2]:(r1(X1,X2)&![X1]:(~(r1(X2,X1))|p1(X1))))|![X1]:(~(r1(X2,X1))|?[X2]:(r1(X1,X2)&~(p1(X2)))))))|![X2]:(~(r1(X1,X2))|p1(X2))))&((![X2]:(~(r1(X1,X2))|p2(X2))|![X2]:(~(r1(X1,X2))|?[X1]:r1(X2,X1)))|![X2]:(~(r1(X1,X2))|p1(X2))))&?[X2]:(r1(X1,X2)&~(p2(X2))))&?[X2]:((r1(X1,X2)&?[X1]:(r1(X2,X1)&![X2]:(~(r1(X1,X2))|p1(X2))))&?[X1]:(r1(X2,X1)&~(p1(X1)))))&?[X2]:(r1(X1,X2)&~(p1(X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(12, negated_conjecture,?[X3]:((((((((![X4]:(~(r1(X3,X4))|p2(X4))|![X5]:(~(r1(X3,X5))|(![X6]:(~(r1(X5,X6))|?[X7]:(r1(X6,X7)&p1(X7)))|~(p1(X5)))))|![X8]:(~(r1(X3,X8))|p1(X8)))&((![X9]:(~(r1(X3,X9))|p2(X9))|![X10]:(~(r1(X3,X10))|![X11]:(~(r1(X10,X11))|(![X12]:(~(r1(X11,X12))|?[X13]:(r1(X12,X13)&~(p1(X13))))|![X14]:(~(r1(X11,X14))|p1(X14))))))|![X15]:(~(r1(X3,X15))|p1(X15))))&((![X16]:(~(r1(X3,X16))|p2(X16))|![X17]:(~(r1(X3,X17))|(![X18]:(~(r1(X17,X18))|?[X19]:(r1(X18,X19)&![X20]:(~(r1(X19,X20))|p1(X20))))|![X21]:(~(r1(X17,X21))|?[X22]:(r1(X21,X22)&~(p1(X22)))))))|![X23]:(~(r1(X3,X23))|p1(X23))))&((![X24]:(~(r1(X3,X24))|p2(X24))|![X25]:(~(r1(X3,X25))|?[X26]:r1(X25,X26)))|![X27]:(~(r1(X3,X27))|p1(X27))))&?[X28]:(r1(X3,X28)&~(p2(X28))))&?[X29]:((r1(X3,X29)&?[X30]:(r1(X29,X30)&![X31]:(~(r1(X30,X31))|p1(X31))))&?[X32]:(r1(X29,X32)&~(p1(X32)))))&?[X33]:(r1(X3,X33)&~(p1(X33)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,((((((((![X4]:(~(r1(esk1_0,X4))|p2(X4))|![X5]:(~(r1(esk1_0,X5))|(![X6]:(~(r1(X5,X6))|(r1(X6,esk2_2(X5,X6))&p1(esk2_2(X5,X6))))|~(p1(X5)))))|![X8]:(~(r1(esk1_0,X8))|p1(X8)))&((![X9]:(~(r1(esk1_0,X9))|p2(X9))|![X10]:(~(r1(esk1_0,X10))|![X11]:(~(r1(X10,X11))|(![X12]:(~(r1(X11,X12))|(r1(X12,esk3_3(X10,X11,X12))&~(p1(esk3_3(X10,X11,X12)))))|![X14]:(~(r1(X11,X14))|p1(X14))))))|![X15]:(~(r1(esk1_0,X15))|p1(X15))))&((![X16]:(~(r1(esk1_0,X16))|p2(X16))|![X17]:(~(r1(esk1_0,X17))|(![X18]:(~(r1(X17,X18))|(r1(X18,esk4_2(X17,X18))&![X20]:(~(r1(esk4_2(X17,X18),X20))|p1(X20))))|![X21]:(~(r1(X17,X21))|(r1(X21,esk5_2(X17,X21))&~(p1(esk5_2(X17,X21))))))))|![X23]:(~(r1(esk1_0,X23))|p1(X23))))&((![X24]:(~(r1(esk1_0,X24))|p2(X24))|![X25]:(~(r1(esk1_0,X25))|r1(X25,esk6_1(X25))))|![X27]:(~(r1(esk1_0,X27))|p1(X27))))&(r1(esk1_0,esk7_0)&~(p2(esk7_0))))&((r1(esk1_0,esk8_0)&(r1(esk8_0,esk9_0)&![X31]:(~(r1(esk9_0,X31))|p1(X31))))&(r1(esk8_0,esk10_0)&~(p1(esk10_0)))))&(r1(esk1_0,esk11_0)&~(p1(esk11_0)))),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X4]:![X5]:![X6]:![X8]:![X9]:![X10]:![X11]:![X12]:![X14]:![X15]:![X16]:![X17]:![X18]:![X20]:![X21]:![X23]:![X24]:![X25]:![X27]:![X31]:((((((~(r1(esk9_0,X31))|p1(X31))&r1(esk8_0,esk9_0))&r1(esk1_0,esk8_0))&(r1(esk8_0,esk10_0)&~(p1(esk10_0))))&((((~(r1(esk1_0,X27))|p1(X27))|((~(r1(esk1_0,X25))|r1(X25,esk6_1(X25)))|(~(r1(esk1_0,X24))|p2(X24))))&(((~(r1(esk1_0,X23))|p1(X23))|((((~(r1(X17,X21))|(r1(X21,esk5_2(X17,X21))&~(p1(esk5_2(X17,X21)))))|(((~(r1(esk4_2(X17,X18),X20))|p1(X20))&r1(X18,esk4_2(X17,X18)))|~(r1(X17,X18))))|~(r1(esk1_0,X17)))|(~(r1(esk1_0,X16))|p2(X16))))&(((~(r1(esk1_0,X15))|p1(X15))|(((((~(r1(X11,X14))|p1(X14))|(~(r1(X11,X12))|(r1(X12,esk3_3(X10,X11,X12))&~(p1(esk3_3(X10,X11,X12))))))|~(r1(X10,X11)))|~(r1(esk1_0,X10)))|(~(r1(esk1_0,X9))|p2(X9))))&((~(r1(esk1_0,X8))|p1(X8))|((((~(r1(X5,X6))|(r1(X6,esk2_2(X5,X6))&p1(esk2_2(X5,X6))))|~(p1(X5)))|~(r1(esk1_0,X5)))|(~(r1(esk1_0,X4))|p2(X4)))))))&(r1(esk1_0,esk7_0)&~(p2(esk7_0)))))&(r1(esk1_0,esk11_0)&~(p1(esk11_0)))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, negated_conjecture,![X4]:![X5]:![X6]:![X8]:![X9]:![X10]:![X11]:![X12]:![X14]:![X15]:![X16]:![X17]:![X18]:![X20]:![X21]:![X23]:![X24]:![X25]:![X27]:![X31]:((((((~(r1(esk9_0,X31))|p1(X31))&r1(esk8_0,esk9_0))&r1(esk1_0,esk8_0))&(r1(esk8_0,esk10_0)&~(p1(esk10_0))))&((((~(r1(esk1_0,X27))|p1(X27))|((~(r1(esk1_0,X25))|r1(X25,esk6_1(X25)))|(~(r1(esk1_0,X24))|p2(X24))))&(((((((((~(r1(esk4_2(X17,X18),X20))|p1(X20))|~(r1(X17,X18)))|(r1(X21,esk5_2(X17,X21))|~(r1(X17,X21))))|~(r1(esk1_0,X17)))|(~(r1(esk1_0,X16))|p2(X16)))|(~(r1(esk1_0,X23))|p1(X23)))&(((((r1(X18,esk4_2(X17,X18))|~(r1(X17,X18)))|(r1(X21,esk5_2(X17,X21))|~(r1(X17,X21))))|~(r1(esk1_0,X17)))|(~(r1(esk1_0,X16))|p2(X16)))|(~(r1(esk1_0,X23))|p1(X23))))&(((((((~(r1(esk4_2(X17,X18),X20))|p1(X20))|~(r1(X17,X18)))|(~(p1(esk5_2(X17,X21)))|~(r1(X17,X21))))|~(r1(esk1_0,X17)))|(~(r1(esk1_0,X16))|p2(X16)))|(~(r1(esk1_0,X23))|p1(X23)))&(((((r1(X18,esk4_2(X17,X18))|~(r1(X17,X18)))|(~(p1(esk5_2(X17,X21)))|~(r1(X17,X21))))|~(r1(esk1_0,X17)))|(~(r1(esk1_0,X16))|p2(X16)))|(~(r1(esk1_0,X23))|p1(X23)))))&((((((((r1(X12,esk3_3(X10,X11,X12))|~(r1(X11,X12)))|(~(r1(X11,X14))|p1(X14)))|~(r1(X10,X11)))|~(r1(esk1_0,X10)))|(~(r1(esk1_0,X9))|p2(X9)))|(~(r1(esk1_0,X15))|p1(X15)))&((((((~(p1(esk3_3(X10,X11,X12)))|~(r1(X11,X12)))|(~(r1(X11,X14))|p1(X14)))|~(r1(X10,X11)))|~(r1(esk1_0,X10)))|(~(r1(esk1_0,X9))|p2(X9)))|(~(r1(esk1_0,X15))|p1(X15))))&((((((r1(X6,esk2_2(X5,X6))|~(r1(X5,X6)))|~(p1(X5)))|~(r1(esk1_0,X5)))|(~(r1(esk1_0,X4))|p2(X4)))|(~(r1(esk1_0,X8))|p1(X8)))&(((((p1(esk2_2(X5,X6))|~(r1(X5,X6)))|~(p1(X5)))|~(r1(esk1_0,X5)))|(~(r1(esk1_0,X4))|p2(X4)))|(~(r1(esk1_0,X8))|p1(X8)))))))&(r1(esk1_0,esk7_0)&~(p2(esk7_0)))))&(r1(esk1_0,esk11_0)&~(p1(esk11_0)))),inference(distribute,[status(thm)],[14])).
% cnf(16,negated_conjecture,(~p1(esk11_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,negated_conjecture,(r1(esk1_0,esk11_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(18,negated_conjecture,(~p2(esk7_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(19,negated_conjecture,(r1(esk1_0,esk7_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(22,negated_conjecture,(p1(X1)|p2(X2)|p1(X5)|~r1(esk1_0,X1)|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X4,X6)|~p1(esk3_3(X3,X4,X6))),inference(split_conjunct,[status(thm)],[15])).
% cnf(23,negated_conjecture,(p1(X1)|p2(X2)|p1(X5)|r1(X6,esk3_3(X3,X4,X6))|~r1(esk1_0,X1)|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X4,X6)),inference(split_conjunct,[status(thm)],[15])).
% cnf(31,negated_conjecture,(r1(esk1_0,esk8_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(32,negated_conjecture,(r1(esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(33,negated_conjecture,(p1(X1)|~r1(esk9_0,X1)),inference(split_conjunct,[status(thm)],[15])).
% cnf(36,negated_conjecture,(r1(X1,esk9_0)|~r1(X1,esk8_0)),inference(spm,[status(thm)],[10,32,theory(equality)])).
% cnf(58,negated_conjecture,(p1(X1)|p1(X2)|p2(X3)|~p1(esk3_3(esk1_0,X4,X5))|~r1(esk1_0,X3)|~r1(esk1_0,X1)|~r1(X4,X5)|~r1(X4,X2)|~r1(esk1_0,X4)),inference(spm,[status(thm)],[22,7,theory(equality)])).
% cnf(74,negated_conjecture,(p1(X1)|p1(X2)|p2(X3)|r1(X4,esk3_3(esk1_0,X5,X4))|~r1(esk1_0,X3)|~r1(esk1_0,X1)|~r1(X5,X4)|~r1(X5,X2)|~r1(esk1_0,X5)),inference(spm,[status(thm)],[23,7,theory(equality)])).
% cnf(111,negated_conjecture,(r1(esk1_0,esk9_0)),inference(spm,[status(thm)],[36,31,theory(equality)])).
% cnf(820,negated_conjecture,(p1(X1)|p1(X2)|p2(esk7_0)|~p1(esk3_3(esk1_0,X3,X4))|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(X3,X4)|~r1(X3,X1)),inference(spm,[status(thm)],[58,19,theory(equality)])).
% cnf(837,negated_conjecture,(p1(X1)|p1(X2)|~p1(esk3_3(esk1_0,X3,X4))|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(X3,X4)|~r1(X3,X1)),inference(sr,[status(thm)],[820,18,theory(equality)])).
% cnf(2246,negated_conjecture,(p1(X1)|p1(X2)|p2(esk7_0)|r1(X3,esk3_3(esk1_0,X4,X3))|~r1(esk1_0,X2)|~r1(esk1_0,X4)|~r1(X4,X3)|~r1(X4,X1)),inference(spm,[status(thm)],[74,19,theory(equality)])).
% cnf(2272,negated_conjecture,(p1(X1)|p1(X2)|r1(X3,esk3_3(esk1_0,X4,X3))|~r1(esk1_0,X2)|~r1(esk1_0,X4)|~r1(X4,X3)|~r1(X4,X1)),inference(sr,[status(thm)],[2246,18,theory(equality)])).
% cnf(14191,negated_conjecture,(p1(esk11_0)|p1(X1)|~p1(esk3_3(esk1_0,X2,X3))|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X2,X1)),inference(spm,[status(thm)],[837,17,theory(equality)])).
% cnf(14244,negated_conjecture,(p1(X1)|~p1(esk3_3(esk1_0,X2,X3))|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X2,X1)),inference(sr,[status(thm)],[14191,16,theory(equality)])).
% cnf(14694,negated_conjecture,(p1(X1)|~p1(esk3_3(esk1_0,esk1_0,X2))|~r1(esk1_0,X2)|~r1(esk1_0,X1)),inference(spm,[status(thm)],[14244,7,theory(equality)])).
% cnf(14751,negated_conjecture,(p1(X1)|~p1(esk3_3(esk1_0,esk1_0,esk9_0))|~r1(esk1_0,X1)),inference(spm,[status(thm)],[14694,111,theory(equality)])).
% cnf(38970,negated_conjecture,(p1(esk11_0)|p1(X1)|r1(X2,esk3_3(esk1_0,X3,X2))|~r1(esk1_0,X3)|~r1(X3,X2)|~r1(X3,X1)),inference(spm,[status(thm)],[2272,17,theory(equality)])).
% cnf(39042,negated_conjecture,(p1(X1)|r1(X2,esk3_3(esk1_0,X3,X2))|~r1(esk1_0,X3)|~r1(X3,X2)|~r1(X3,X1)),inference(sr,[status(thm)],[38970,16,theory(equality)])).
% cnf(112841,negated_conjecture,(p1(X1)|r1(X2,esk3_3(esk1_0,esk1_0,X2))|~r1(esk1_0,X2)|~r1(esk1_0,X1)),inference(spm,[status(thm)],[39042,7,theory(equality)])).
% cnf(112987,negated_conjecture,(p1(X1)|r1(esk9_0,esk3_3(esk1_0,esk1_0,esk9_0))|~r1(esk1_0,X1)),inference(spm,[status(thm)],[112841,111,theory(equality)])).
% cnf(115122,negated_conjecture,(p1(esk11_0)|r1(esk9_0,esk3_3(esk1_0,esk1_0,esk9_0))),inference(spm,[status(thm)],[112987,17,theory(equality)])).
% cnf(115267,negated_conjecture,(r1(esk9_0,esk3_3(esk1_0,esk1_0,esk9_0))),inference(sr,[status(thm)],[115122,16,theory(equality)])).
% cnf(115322,negated_conjecture,(p1(esk3_3(esk1_0,esk1_0,esk9_0))),inference(spm,[status(thm)],[33,115267,theory(equality)])).
% cnf(115333,negated_conjecture,(p1(X1)|$false|~r1(esk1_0,X1)),inference(rw,[status(thm)],[14751,115322,theory(equality)])).
% cnf(115334,negated_conjecture,(p1(X1)|~r1(esk1_0,X1)),inference(cn,[status(thm)],[115333,theory(equality)])).
% cnf(115336,negated_conjecture,(p1(esk11_0)),inference(spm,[status(thm)],[115334,17,theory(equality)])).
% cnf(115481,negated_conjecture,($false),inference(sr,[status(thm)],[115336,16,theory(equality)])).
% cnf(115482,negated_conjecture,($false),115481,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6505
% # ...of these trivial : 0
% # ...subsumed : 470
% # ...remaining for further processing: 6035
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1436
% # Backward-rewritten : 878
% # Generated clauses : 98588
% # ...of the previous two non-trivial : 83857
% # Contextual simplify-reflections : 132
% # Paramodulations : 98588
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3721
% # Positive orientable unit clauses: 623
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 3095
% # Current number of unprocessed clauses: 9581
% # ...number of literals in the above : 27747
% # Clause-clause subsumption calls (NU) : 115141
% # Rec. Clause-clause subsumption calls : 55935
% # Unit Clause-clause subsumption calls : 6184
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4086
% # Indexed BW rewrite successes : 108
% # Backwards rewriting index: 665 leaves, 3.25+/-6.165 terms/leaf
% # Paramod-from index: 228 leaves, 3.19+/-5.294 terms/leaf
% # Paramod-into index: 523 leaves, 3.51+/-6.584 terms/leaf
% # -------------------------------------------------
% # User time : 5.633 s
% # System time : 0.130 s
% # Total time : 5.763 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.19 CPU 7.31 WC
% FINAL PrfWatch: 7.19 CPU 7.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP30029/LCL672+1.001.tptp
%
%------------------------------------------------------------------------------