TSTP Solution File: SEU103+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU103+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 01:08:51 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP11194/SEU103+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11194/SEU103+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11194/SEU103+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 11326
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>element(prebool_union2(X1,X2,X3),X1)),file('/tmp/SRASS.s.p', dt_k1_finsub_1)).
% fof(5, axiom,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>element(prebool_difference(X1,X2,X3),X1)),file('/tmp/SRASS.s.p', dt_k2_finsub_1)).
% fof(16, axiom,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>prebool_union2(X1,X2,X3)=set_union2(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k1_finsub_1)).
% fof(29, axiom,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>prebool_difference(X1,X2,X3)=set_difference(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k2_finsub_1)).
% fof(39, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=set_union2(set_difference(X1,X2),set_difference(X2,X1)),file('/tmp/SRASS.s.p', d6_xboole_0)).
% fof(46, conjecture,![X1]:![X2]:![X3]:((~(empty(X3))&preboolean(X3))=>((element(X1,X3)&element(X2,X3))=>element(symmetric_difference(X1,X2),X3))),file('/tmp/SRASS.s.p', t14_finsub_1)).
% fof(47, negated_conjecture,~(![X1]:![X2]:![X3]:((~(empty(X3))&preboolean(X3))=>((element(X1,X3)&element(X2,X3))=>element(symmetric_difference(X1,X2),X3)))),inference(assume_negation,[status(cth)],[46])).
% fof(49, plain,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>element(prebool_union2(X1,X2,X3),X1)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(50, plain,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>element(prebool_difference(X1,X2,X3),X1)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(56, plain,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>prebool_union2(X1,X2,X3)=set_union2(X2,X3)),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(62, plain,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>prebool_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(64, negated_conjecture,~(![X1]:![X2]:![X3]:((~(empty(X3))&preboolean(X3))=>((element(X1,X3)&element(X2,X3))=>element(symmetric_difference(X1,X2),X3)))),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% fof(74, plain,![X1]:![X2]:![X3]:((((empty(X1)|~(preboolean(X1)))|~(element(X2,X1)))|~(element(X3,X1)))|element(prebool_union2(X1,X2,X3),X1)),inference(fof_nnf,[status(thm)],[49])).
% fof(75, plain,![X4]:![X5]:![X6]:((((empty(X4)|~(preboolean(X4)))|~(element(X5,X4)))|~(element(X6,X4)))|element(prebool_union2(X4,X5,X6),X4)),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(element(prebool_union2(X1,X2,X3),X1)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(77, plain,![X1]:![X2]:![X3]:((((empty(X1)|~(preboolean(X1)))|~(element(X2,X1)))|~(element(X3,X1)))|element(prebool_difference(X1,X2,X3),X1)),inference(fof_nnf,[status(thm)],[50])).
% fof(78, plain,![X4]:![X5]:![X6]:((((empty(X4)|~(preboolean(X4)))|~(element(X5,X4)))|~(element(X6,X4)))|element(prebool_difference(X4,X5,X6),X4)),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(element(prebool_difference(X1,X2,X3),X1)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(112, plain,![X1]:![X2]:![X3]:((((empty(X1)|~(preboolean(X1)))|~(element(X2,X1)))|~(element(X3,X1)))|prebool_union2(X1,X2,X3)=set_union2(X2,X3)),inference(fof_nnf,[status(thm)],[56])).
% fof(113, plain,![X4]:![X5]:![X6]:((((empty(X4)|~(preboolean(X4)))|~(element(X5,X4)))|~(element(X6,X4)))|prebool_union2(X4,X5,X6)=set_union2(X5,X6)),inference(variable_rename,[status(thm)],[112])).
% cnf(114,plain,(prebool_union2(X1,X2,X3)=set_union2(X2,X3)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[113])).
% fof(158, plain,![X1]:![X2]:![X3]:((((empty(X1)|~(preboolean(X1)))|~(element(X2,X1)))|~(element(X3,X1)))|prebool_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_nnf,[status(thm)],[62])).
% fof(159, plain,![X4]:![X5]:![X6]:((((empty(X4)|~(preboolean(X4)))|~(element(X5,X4)))|~(element(X6,X4)))|prebool_difference(X4,X5,X6)=set_difference(X5,X6)),inference(variable_rename,[status(thm)],[158])).
% cnf(160,plain,(prebool_difference(X1,X2,X3)=set_difference(X2,X3)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[159])).
% fof(193, plain,![X3]:![X4]:symmetric_difference(X3,X4)=set_union2(set_difference(X3,X4),set_difference(X4,X3)),inference(variable_rename,[status(thm)],[39])).
% cnf(194,plain,(symmetric_difference(X1,X2)=set_union2(set_difference(X1,X2),set_difference(X2,X1))),inference(split_conjunct,[status(thm)],[193])).
% fof(218, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(empty(X3))&preboolean(X3))&((element(X1,X3)&element(X2,X3))&~(element(symmetric_difference(X1,X2),X3)))),inference(fof_nnf,[status(thm)],[64])).
% fof(219, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(empty(X6))&preboolean(X6))&((element(X4,X6)&element(X5,X6))&~(element(symmetric_difference(X4,X5),X6)))),inference(variable_rename,[status(thm)],[218])).
% fof(220, negated_conjecture,((~(empty(esk13_0))&preboolean(esk13_0))&((element(esk11_0,esk13_0)&element(esk12_0,esk13_0))&~(element(symmetric_difference(esk11_0,esk12_0),esk13_0)))),inference(skolemize,[status(esa)],[219])).
% cnf(221,negated_conjecture,(~element(symmetric_difference(esk11_0,esk12_0),esk13_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(222,negated_conjecture,(element(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(223,negated_conjecture,(element(esk11_0,esk13_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(224,negated_conjecture,(preboolean(esk13_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(225,negated_conjecture,(~empty(esk13_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(229,negated_conjecture,(~element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0)),inference(rw,[status(thm)],[221,194,theory(equality)]),['unfolding']).
% cnf(332,plain,(empty(X1)|element(set_union2(X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1)),inference(spm,[status(thm)],[76,114,theory(equality)])).
% cnf(333,plain,(empty(X1)|element(set_difference(X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1)),inference(spm,[status(thm)],[79,160,theory(equality)])).
% cnf(1100,negated_conjecture,(empty(esk13_0)|~preboolean(esk13_0)|~element(set_difference(esk12_0,esk11_0),esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(spm,[status(thm)],[229,332,theory(equality)])).
% cnf(1109,negated_conjecture,(empty(esk13_0)|$false|~element(set_difference(esk12_0,esk11_0),esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(rw,[status(thm)],[1100,224,theory(equality)])).
% cnf(1110,negated_conjecture,(empty(esk13_0)|~element(set_difference(esk12_0,esk11_0),esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(cn,[status(thm)],[1109,theory(equality)])).
% cnf(1111,negated_conjecture,(~element(set_difference(esk12_0,esk11_0),esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(sr,[status(thm)],[1110,225,theory(equality)])).
% cnf(1124,negated_conjecture,(empty(esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)|~preboolean(esk13_0)|~element(esk11_0,esk13_0)|~element(esk12_0,esk13_0)),inference(spm,[status(thm)],[1111,333,theory(equality)])).
% cnf(1130,negated_conjecture,(empty(esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)|$false|~element(esk11_0,esk13_0)|~element(esk12_0,esk13_0)),inference(rw,[status(thm)],[1124,224,theory(equality)])).
% cnf(1131,negated_conjecture,(empty(esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)|$false|$false|~element(esk12_0,esk13_0)),inference(rw,[status(thm)],[1130,223,theory(equality)])).
% cnf(1132,negated_conjecture,(empty(esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)|$false|$false|$false),inference(rw,[status(thm)],[1131,222,theory(equality)])).
% cnf(1133,negated_conjecture,(empty(esk13_0)|~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(cn,[status(thm)],[1132,theory(equality)])).
% cnf(1134,negated_conjecture,(~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(sr,[status(thm)],[1133,225,theory(equality)])).
% cnf(1135,negated_conjecture,(empty(esk13_0)|~preboolean(esk13_0)|~element(esk12_0,esk13_0)|~element(esk11_0,esk13_0)),inference(spm,[status(thm)],[1134,333,theory(equality)])).
% cnf(1136,negated_conjecture,(empty(esk13_0)|$false|~element(esk12_0,esk13_0)|~element(esk11_0,esk13_0)),inference(rw,[status(thm)],[1135,224,theory(equality)])).
% cnf(1137,negated_conjecture,(empty(esk13_0)|$false|$false|~element(esk11_0,esk13_0)),inference(rw,[status(thm)],[1136,222,theory(equality)])).
% cnf(1138,negated_conjecture,(empty(esk13_0)|$false|$false|$false),inference(rw,[status(thm)],[1137,223,theory(equality)])).
% cnf(1139,negated_conjecture,(empty(esk13_0)),inference(cn,[status(thm)],[1138,theory(equality)])).
% cnf(1140,negated_conjecture,($false),inference(sr,[status(thm)],[1139,225,theory(equality)])).
% cnf(1141,negated_conjecture,($false),1140,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 326
% # ...of these trivial : 6
% # ...subsumed : 25
% # ...remaining for further processing: 295
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 15
% # Generated clauses : 618
% # ...of the previous two non-trivial : 577
% # Contextual simplify-reflections : 46
% # Paramodulations : 615
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 208
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 168
% # Current number of unprocessed clauses: 363
% # ...number of literals in the above : 1135
% # Clause-clause subsumption calls (NU) : 1640
% # Rec. Clause-clause subsumption calls : 1433
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 38
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 200 leaves, 2.00+/-2.542 terms/leaf
% # Paramod-from index: 63 leaves, 1.70+/-2.775 terms/leaf
% # Paramod-into index: 190 leaves, 2.00+/-2.577 terms/leaf
% # -------------------------------------------------
% # User time : 0.046 s
% # System time : 0.004 s
% # Total time : 0.050 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP11194/SEU103+1.tptp
%
%------------------------------------------------------------------------------