↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET621+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 : art09.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:38 EST 2010

% Result   : Theorem 0.88s
% Output   : Solution 0.88s
% 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/SystemOnTPTP28039/SET621+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP28039/SET621+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28039/SET621+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 28135
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.012 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]:![X3]:difference(difference(X1,X2),X3)=difference(X1,union(X2,X3)),file('/tmp/SRASS.s.p', difference_difference_union)).
% 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(12, conjecture,![X1]:![X2]:![X3]:difference(symmetric_difference(X1,X2),X3)=union(difference(X1,union(X2,X3)),difference(X2,union(X1,X3))),file('/tmp/SRASS.s.p', prove_th97)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:difference(symmetric_difference(X1,X2),X3)=union(difference(X1,union(X2,X3)),difference(X2,union(X1,X3)))),inference(assume_negation,[status(cth)],[12])).
% fof(15, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X4]:![X5]:![X6]:difference(difference(X4,X5),X6)=difference(X4,union(X5,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(18,plain,(difference(difference(X1,X2),X3)=difference(X1,union(X2,X3))),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:difference(union(X4,X5),X6)=union(difference(X4,X6),difference(X5,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(difference(union(X1,X2),X3)=union(difference(X1,X3),difference(X2,X3))),inference(split_conjunct,[status(thm)],[19])).
% fof(62, negated_conjecture,?[X1]:?[X2]:?[X3]:~(difference(symmetric_difference(X1,X2),X3)=union(difference(X1,union(X2,X3)),difference(X2,union(X1,X3)))),inference(fof_nnf,[status(thm)],[13])).
% fof(63, negated_conjecture,?[X4]:?[X5]:?[X6]:~(difference(symmetric_difference(X4,X5),X6)=union(difference(X4,union(X5,X6)),difference(X5,union(X4,X6)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(difference(symmetric_difference(esk3_0,esk4_0),esk5_0)=union(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk4_0,union(esk3_0,esk5_0)))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(difference(symmetric_difference(esk3_0,esk4_0),esk5_0)!=union(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk4_0,union(esk3_0,esk5_0)))),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,negated_conjecture,(union(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk4_0,union(esk3_0,esk5_0)))!=difference(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),esk5_0)),inference(rw,[status(thm)],[65,16,theory(equality)]),['unfolding']).
% cnf(72,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[67,18,theory(equality)]),18,theory(equality)]),20,theory(equality)])).
% cnf(73,negated_conjecture,($false),inference(cn,[status(thm)],[72,theory(equality)])).
% cnf(74,negated_conjecture,($false),73,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 19
% # ...of these trivial                : 1
% # ...subsumed                        : 0
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 2
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 2
% # Current number of processed clauses: 15
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 11
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # 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:    15 leaves,   1.87+/-1.204 terms/leaf
% # Paramod-from index:            9 leaves,   1.22+/-0.416 terms/leaf
% # Paramod-into index:           12 leaves,   2.00+/-1.080 terms/leaf
% # -------------------------------------------------
% # User time              : 0.010 s
% # System time            : 0.003 s
% # Total time             : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP28039/SET621+3.tptp
% 
%------------------------------------------------------------------------------