TSTP Solution File: SET620+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET620+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 23:17:35 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/SystemOnTPTP29676/SET620+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29676/SET620+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29676/SET620+3.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 29772
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1)),file('/tmp/SRASS.s.p', symmetric_difference_defn)).
% fof(2, axiom,![X1]:![X2]:difference(X1,intersection(X1,X2))=difference(X1,X2),file('/tmp/SRASS.s.p', difference_into_intersection)).
% fof(3, axiom,![X1]:![X2]:![X3]:difference(union(X1,X2),X3)=union(difference(X1,X3),difference(X2,X3)),file('/tmp/SRASS.s.p', difference_distributes_over_union)).
% fof(4, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(5, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(14, conjecture,![X1]:![X2]:symmetric_difference(X1,X2)=difference(union(X1,X2),intersection(X1,X2)),file('/tmp/SRASS.s.p', prove_th96)).
% fof(15, negated_conjecture,~(![X1]:![X2]:symmetric_difference(X1,X2)=difference(union(X1,X2),intersection(X1,X2))),inference(assume_negation,[status(cth)],[14])).
% fof(17, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[1])).
% cnf(18,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:difference(X3,intersection(X3,X4))=difference(X3,X4),inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,(difference(X1,intersection(X1,X2))=difference(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:difference(union(X4,X5),X6)=union(difference(X4,X6),difference(X5,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,(difference(union(X1,X2),X3)=union(difference(X1,X3),difference(X2,X3))),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(24,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(26,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(72, negated_conjecture,?[X1]:?[X2]:~(symmetric_difference(X1,X2)=difference(union(X1,X2),intersection(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(73, negated_conjecture,?[X3]:?[X4]:~(symmetric_difference(X3,X4)=difference(union(X3,X4),intersection(X3,X4))),inference(variable_rename,[status(thm)],[72])).
% fof(74, negated_conjecture,~(symmetric_difference(esk3_0,esk4_0)=difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[73])).
% cnf(75,negated_conjecture,(symmetric_difference(esk3_0,esk4_0)!=difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,negated_conjecture,(difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0))!=union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),inference(rw,[status(thm)],[75,18,theory(equality)]),['unfolding']).
% cnf(82,plain,(difference(X1,intersection(X2,X1))=difference(X1,X2)),inference(spm,[status(thm)],[20,26,theory(equality)])).
% cnf(86,plain,(union(difference(X1,intersection(X2,X3)),difference(X2,X3))=difference(union(X1,X2),intersection(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(167,plain,(union(difference(X2,X3),difference(X1,intersection(X2,X3)))=difference(union(X1,X2),intersection(X2,X3))),inference(rw,[status(thm)],[86,24,theory(equality)])).
% cnf(174,plain,(union(difference(X1,X2),difference(X2,X1))=difference(union(X2,X1),intersection(X1,X2))),inference(spm,[status(thm)],[167,82,theory(equality)])).
% cnf(304,plain,(difference(union(X1,X2),intersection(X1,X2))=union(difference(X2,X1),difference(X1,X2))),inference(spm,[status(thm)],[174,26,theory(equality)])).
% cnf(333,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[77,304,theory(equality)]),24,theory(equality)])).
% cnf(334,negated_conjecture,($false),inference(cn,[status(thm)],[333,theory(equality)])).
% cnf(335,negated_conjecture,($false),334,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 79
% # ...of these trivial : 4
% # ...subsumed : 15
% # ...remaining for further processing: 60
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 223
% # ...of the previous two non-trivial : 172
% # Contextual simplify-reflections : 3
% # Paramodulations : 219
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 36
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 138
% # ...number of literals in the above : 287
% # Clause-clause subsumption calls (NU) : 83
% # Rec. Clause-clause subsumption calls : 83
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 28 leaves, 2.14+/-1.575 terms/leaf
% # Paramod-from index: 14 leaves, 1.50+/-0.824 terms/leaf
% # Paramod-into index: 24 leaves, 2.00+/-1.225 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 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/SystemOnTPTP29676/SET620+3.tptp
%
%------------------------------------------------------------------------------