TSTP Solution File: SET584+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET584+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:17:01 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP11293/SET584+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11293/SET584+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11293/SET584+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 11425
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 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]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(6, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(union(X1,X3),union(X2,X3))),file('/tmp/SRASS.s.p', prove_th33)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(union(X1,X3),union(X2,X3)))),inference(assume_negation,[status(cth)],[6])).
% fof(10, plain,![X1]:![X2]:![X3]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(11, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))&~(member(X6,X5)))|member(X6,union(X4,X5)))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))|member(X6,union(X4,X5)))&(~(member(X6,X5))|member(X6,union(X4,X5))))),inference(distribute,[status(thm)],[11])).
% cnf(13,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(15,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[12])).
% fof(16, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(35, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&~(subset(union(X1,X3),union(X2,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&~(subset(union(X4,X6),union(X5,X6)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, negated_conjecture,(subset(esk3_0,esk4_0)&~(subset(union(esk3_0,esk5_0),union(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(~subset(union(esk3_0,esk5_0),union(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(44,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[21,13,theory(equality)])).
% cnf(45,plain,(subset(X1,union(X2,X3))|~member(esk1_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[21,14,theory(equality)])).
% cnf(48,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[23,39,theory(equality)])).
% cnf(52,plain,(member(esk1_2(union(X1,X2),X3),X2)|member(esk1_2(union(X1,X2),X3),X1)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[15,22,theory(equality)])).
% cnf(83,negated_conjecture,(subset(X1,union(esk4_0,X2))|~member(esk1_2(X1,union(esk4_0,X2)),esk3_0)),inference(spm,[status(thm)],[45,48,theory(equality)])).
% cnf(119,plain,(subset(union(X1,X2),union(X3,X2))|member(esk1_2(union(X1,X2),union(X3,X2)),X1)),inference(spm,[status(thm)],[44,52,theory(equality)])).
% cnf(1378,negated_conjecture,(subset(union(esk3_0,X1),union(esk4_0,X1))),inference(spm,[status(thm)],[83,119,theory(equality)])).
% cnf(1402,negated_conjecture,($false),inference(rw,[status(thm)],[38,1378,theory(equality)])).
% cnf(1403,negated_conjecture,($false),inference(cn,[status(thm)],[1402,theory(equality)])).
% cnf(1404,negated_conjecture,($false),1403,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 289
% # ...of these trivial : 91
% # ...subsumed : 68
% # ...remaining for further processing: 130
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 1023
% # ...of the previous two non-trivial : 776
% # Contextual simplify-reflections : 4
% # Paramodulations : 1001
% # Factorizations : 22
% # Equation resolutions : 0
% # Current number of processed clauses: 129
% # Positive orientable unit clauses: 72
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 499
% # ...number of literals in the above : 1316
% # Clause-clause subsumption calls (NU) : 662
% # Rec. Clause-clause subsumption calls : 575
% # Unit Clause-clause subsumption calls : 231
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 326
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 112 leaves, 2.07+/-1.562 terms/leaf
% # Paramod-from index: 49 leaves, 2.14+/-1.539 terms/leaf
% # Paramod-into index: 100 leaves, 2.03+/-1.533 terms/leaf
% # -------------------------------------------------
% # User time : 0.036 s
% # System time : 0.006 s
% # Total time : 0.042 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP11293/SET584+3.tptp
%
%------------------------------------------------------------------------------