TSTP Solution File: SET618+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET618+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:16 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/SystemOnTPTP29158/SET618+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29158/SET618+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29158/SET618+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 29254
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:difference(X1,X1)=empty_set,file('/tmp/SRASS.s.p', self_difference_is_empty_set)).
% fof(4, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1)),file('/tmp/SRASS.s.p', symmetric_difference_defn)).
% fof(5, axiom,![X1]:union(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotency_of_union)).
% fof(12, conjecture,![X1]:symmetric_difference(X1,X1)=empty_set,file('/tmp/SRASS.s.p', prove_th93)).
% fof(13, negated_conjecture,~(![X1]:symmetric_difference(X1,X1)=empty_set),inference(assume_negation,[status(cth)],[12])).
% fof(18, plain,![X2]:difference(X2,X2)=empty_set,inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(difference(X1,X1)=empty_set),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:union(X2,X2)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(union(X1,X1)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(59, negated_conjecture,?[X1]:~(symmetric_difference(X1,X1)=empty_set),inference(fof_nnf,[status(thm)],[13])).
% fof(60, negated_conjecture,?[X2]:~(symmetric_difference(X2,X2)=empty_set),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,~(symmetric_difference(esk4_0,esk4_0)=empty_set),inference(skolemize,[status(esa)],[60])).
% cnf(62,negated_conjecture,(symmetric_difference(esk4_0,esk4_0)!=empty_set),inference(split_conjunct,[status(thm)],[61])).
% cnf(64,negated_conjecture,(union(difference(esk4_0,esk4_0),difference(esk4_0,esk4_0))!=empty_set),inference(rw,[status(thm)],[62,23,theory(equality)]),['unfolding']).
% cnf(65,negated_conjecture,(union(empty_set,empty_set)!=empty_set),inference(rw,[status(thm)],[inference(rw,[status(thm)],[64,19,theory(equality)]),19,theory(equality)])).
% cnf(91,negated_conjecture,($false),inference(rw,[status(thm)],[65,25,theory(equality)])).
% cnf(92,negated_conjecture,($false),inference(cn,[status(thm)],[91,theory(equality)])).
% cnf(93,negated_conjecture,($false),92,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 20
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 0
% # Paramodulations : 16
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 16 leaves, 1.56+/-0.933 terms/leaf
% # Paramod-from index: 8 leaves, 1.38+/-0.696 terms/leaf
% # Paramod-into index: 15 leaves, 1.40+/-0.712 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP29158/SET618+3.tptp
%
%------------------------------------------------------------------------------