TSTP Solution File: SET919+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET919+1 : TPTP v5.0.0. Released v3.2.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 00:23:46 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP660/SET919+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP660/SET919+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP660/SET919+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 794
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(5, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(6, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(10, conjecture,![X1]:![X2]:![X3]:(in(X1,X2)=>((in(X3,X2)&~(X1=X3))|set_intersection2(unordered_pair(X1,X3),X2)=singleton(X1))),file('/tmp/SRASS.s.p', t60_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:(in(X1,X2)=>((in(X3,X2)&~(X1=X3))|set_intersection2(unordered_pair(X1,X3),X2)=singleton(X1)))),inference(assume_negation,[status(cth)],[10])).
% fof(19, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(X1=singleton(X2)|esk1_2(X2,X1)=X2|in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(30, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk2_3(X5,X6,X7)=X5)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk2_3(X5,X6,X7)=X6)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[33])).
% cnf(39,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[34])).
% cnf(40,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(41, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(42, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))|~(in(esk3_3(X5,X6,X7),X6))))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)&in(esk3_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[42])).
% fof(44, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))|~(in(esk3_3(X5,X6,X7),X6))))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)&in(esk3_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))|~(in(esk3_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk3_3(X5,X6,X7),X6)|in(esk3_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[44])).
% cnf(49,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[45])).
% cnf(50,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[45])).
% cnf(51,plain,(in(X4,X2)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(60, negated_conjecture,?[X1]:?[X2]:?[X3]:(in(X1,X2)&((~(in(X3,X2))|X1=X3)&~(set_intersection2(unordered_pair(X1,X3),X2)=singleton(X1)))),inference(fof_nnf,[status(thm)],[11])).
% fof(61, negated_conjecture,?[X4]:?[X5]:?[X6]:(in(X4,X5)&((~(in(X6,X5))|X4=X6)&~(set_intersection2(unordered_pair(X4,X6),X5)=singleton(X4)))),inference(variable_rename,[status(thm)],[60])).
% fof(62, negated_conjecture,(in(esk6_0,esk7_0)&((~(in(esk8_0,esk7_0))|esk6_0=esk8_0)&~(set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0)=singleton(esk6_0)))),inference(skolemize,[status(esa)],[61])).
% cnf(63,negated_conjecture,(set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0)!=singleton(esk6_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,negated_conjecture,(esk6_0=esk8_0|~in(esk8_0,esk7_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,negated_conjecture,(in(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,negated_conjecture,(set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))!=singleton(esk6_0)),inference(rw,[status(thm)],[63,20,theory(equality)])).
% cnf(69,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(80,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[69,theory(equality)])).
% cnf(83,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[50,theory(equality)])).
% cnf(88,plain,(in(X1,X2)|~in(X1,set_intersection2(X2,X3))),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(93,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[40,theory(equality)])).
% cnf(108,negated_conjecture,(esk1_2(X1,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=X1|in(esk1_2(X1,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))),set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))|singleton(X1)!=singleton(esk6_0)),inference(spm,[status(thm)],[66,26,theory(equality)])).
% cnf(127,plain,(in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[49,theory(equality)])).
% cnf(2148,negated_conjecture,(esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0|in(esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))),set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))),inference(er,[status(thm)],[108,theory(equality)])).
% cnf(2186,negated_conjecture,(in(esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))),unordered_pair(esk6_0,esk8_0))|esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0),inference(spm,[status(thm)],[83,2148,theory(equality)])).
% cnf(2187,negated_conjecture,(in(esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))),esk7_0)|esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0),inference(spm,[status(thm)],[88,2148,theory(equality)])).
% cnf(2346,negated_conjecture,(esk6_0=esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))|esk8_0=esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))),inference(spm,[status(thm)],[93,2186,theory(equality)])).
% cnf(2433,negated_conjecture,(esk8_0=esk6_0|in(esk8_0,esk7_0)|esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0),inference(spm,[status(thm)],[2187,2346,theory(equality)])).
% cnf(2484,negated_conjecture,(esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0|esk8_0=esk6_0),inference(csr,[status(thm)],[2433,64])).
% cnf(2485,negated_conjecture,(singleton(esk6_0)=set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0))|esk8_0=esk6_0|~in(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))),inference(spm,[status(thm)],[27,2484,theory(equality)])).
% cnf(2532,negated_conjecture,(esk8_0=esk6_0|~in(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))),inference(sr,[status(thm)],[2485,66,theory(equality)])).
% cnf(2579,negated_conjecture,(esk8_0=esk6_0|~in(esk6_0,unordered_pair(esk6_0,esk8_0))|~in(esk6_0,esk7_0)),inference(spm,[status(thm)],[2532,127,theory(equality)])).
% cnf(2580,negated_conjecture,(esk8_0=esk6_0|$false|~in(esk6_0,esk7_0)),inference(rw,[status(thm)],[2579,80,theory(equality)])).
% cnf(2581,negated_conjecture,(esk8_0=esk6_0|$false|$false),inference(rw,[status(thm)],[2580,65,theory(equality)])).
% cnf(2582,negated_conjecture,(esk8_0=esk6_0),inference(cn,[status(thm)],[2581,theory(equality)])).
% cnf(2587,negated_conjecture,(esk1_2(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))=esk8_0|esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2346,2582,theory(equality)]),20,theory(equality)])).
% cnf(2588,negated_conjecture,(esk1_2(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))=esk6_0|esk1_2(esk6_0,set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))=esk6_0),inference(rw,[status(thm)],[2587,2582,theory(equality)])).
% cnf(2589,negated_conjecture,(esk1_2(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))=esk6_0|esk1_2(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))=esk6_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2588,2582,theory(equality)]),20,theory(equality)])).
% cnf(2590,negated_conjecture,(esk1_2(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))=esk6_0),inference(cn,[status(thm)],[2589,theory(equality)])).
% cnf(2621,negated_conjecture,(set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0)!=singleton(esk6_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[66,2582,theory(equality)]),20,theory(equality)])).
% cnf(2625,negated_conjecture,(singleton(esk6_0)=set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0)|~in(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))),inference(spm,[status(thm)],[27,2590,theory(equality)])).
% cnf(2716,negated_conjecture,(~in(esk6_0,set_intersection2(unordered_pair(esk6_0,esk6_0),esk7_0))),inference(sr,[status(thm)],[2625,2621,theory(equality)])).
% cnf(2764,negated_conjecture,(~in(esk6_0,esk7_0)|~in(esk6_0,unordered_pair(esk6_0,esk6_0))),inference(spm,[status(thm)],[2716,127,theory(equality)])).
% cnf(2765,negated_conjecture,($false|~in(esk6_0,unordered_pair(esk6_0,esk6_0))),inference(rw,[status(thm)],[2764,65,theory(equality)])).
% cnf(2766,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2765,80,theory(equality)])).
% cnf(2767,negated_conjecture,($false),inference(cn,[status(thm)],[2766,theory(equality)])).
% cnf(2768,negated_conjecture,($false),2767,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 202
% # ...of these trivial : 5
% # ...subsumed : 69
% # ...remaining for further processing: 128
% # Other redundant clauses eliminated : 40
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 20
% # Generated clauses : 2578
% # ...of the previous two non-trivial : 2495
% # Contextual simplify-reflections : 1
% # Paramodulations : 2514
% # Factorizations : 12
% # Equation resolutions : 52
% # Current number of processed clauses: 80
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 7
% # Non-unit-clauses : 63
% # Current number of unprocessed clauses: 1508
% # ...number of literals in the above : 7964
% # Clause-clause subsumption calls (NU) : 887
% # Rec. Clause-clause subsumption calls : 820
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 67 leaves, 1.49+/-1.262 terms/leaf
% # Paramod-from index: 26 leaves, 1.35+/-0.617 terms/leaf
% # Paramod-into index: 63 leaves, 1.41+/-1.049 terms/leaf
% # -------------------------------------------------
% # User time : 0.102 s
% # System time : 0.002 s
% # Total time : 0.104 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.31 WC
% FINAL PrfWatch: 0.24 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP660/SET919+1.tptp
%
%------------------------------------------------------------------------------