TSTP Solution File: SET581+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET581+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 : 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 : Wed Dec 29 23:16:26 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP10595/SET581+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10595/SET581+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10595/SET581+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 10727
% 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(1, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(2, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(3, axiom,![X1]:![X2]:(not_equal(X1,X2)<=>~(X1=X2)),file('/tmp/SRASS.s.p', not_equal_defn)).
% fof(7, conjecture,![X1]:![X2]:![X3]:((member(X1,X2)&member(X1,X3))=>not_equal(intersection(X2,X3),empty_set)),file('/tmp/SRASS.s.p', prove_th24)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:((member(X1,X2)&member(X1,X3))=>not_equal(intersection(X2,X3),empty_set))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(11, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(12, plain,![X4]:![X5]:![X6]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(17, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[9])).
% cnf(18,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X1]:![X2]:((~(not_equal(X1,X2))|~(X1=X2))&(X1=X2|not_equal(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(20, plain,![X3]:![X4]:((~(not_equal(X3,X4))|~(X3=X4))&(X3=X4|not_equal(X3,X4))),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(not_equal(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[20])).
% fof(40, negated_conjecture,?[X1]:?[X2]:?[X3]:((member(X1,X2)&member(X1,X3))&~(not_equal(intersection(X2,X3),empty_set))),inference(fof_nnf,[status(thm)],[8])).
% fof(41, negated_conjecture,?[X4]:?[X5]:?[X6]:((member(X4,X5)&member(X4,X6))&~(not_equal(intersection(X5,X6),empty_set))),inference(variable_rename,[status(thm)],[40])).
% fof(42, negated_conjecture,((member(esk3_0,esk4_0)&member(esk3_0,esk5_0))&~(not_equal(intersection(esk4_0,esk5_0),empty_set))),inference(skolemize,[status(esa)],[41])).
% cnf(43,negated_conjecture,(~not_equal(intersection(esk4_0,esk5_0),empty_set)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,negated_conjecture,(member(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,negated_conjecture,(member(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(47,negated_conjecture,(intersection(esk4_0,esk5_0)=empty_set),inference(spm,[status(thm)],[43,21,theory(equality)])).
% cnf(76,negated_conjecture,(member(X1,empty_set)|~member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[14,47,theory(equality)])).
% cnf(79,negated_conjecture,(~member(X1,esk5_0)|~member(X1,esk4_0)),inference(sr,[status(thm)],[76,18,theory(equality)])).
% cnf(80,negated_conjecture,(~member(esk3_0,esk4_0)),inference(spm,[status(thm)],[79,44,theory(equality)])).
% cnf(84,negated_conjecture,($false),inference(rw,[status(thm)],[80,45,theory(equality)])).
% cnf(85,negated_conjecture,($false),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(86,negated_conjecture,($false),85,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 39
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 36
% # ...of the previous two non-trivial : 27
% # Contextual simplify-reflections : 0
% # Paramodulations : 33
% # Factorizations : 2
% # Equation resolutions : 1
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 16
% # ...number of literals in the above : 43
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 23 leaves, 1.35+/-0.758 terms/leaf
% # Paramod-from index: 9 leaves, 1.22+/-0.416 terms/leaf
% # Paramod-into index: 20 leaves, 1.30+/-0.714 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.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP10595/SET581+3.tptp
%
%------------------------------------------------------------------------------