TSTP Solution File: SET979+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET979+1 : TPTP v5.0.0. Released v3.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 : Thu Dec 30 00:28:43 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP1403/SET979+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1403/SET979+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1403/SET979+1.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 1499
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:![X3]:(cartesian_product2(set_union2(X1,X2),X3)=set_union2(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&cartesian_product2(X3,set_union2(X1,X2))=set_union2(cartesian_product2(X3,X1),cartesian_product2(X3,X2))),file('/tmp/SRASS.s.p', t120_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:unordered_pair(X1,X2)=set_union2(singleton(X1),singleton(X2)),file('/tmp/SRASS.s.p', t41_enumset1)).
% fof(10, conjecture,![X1]:![X2]:![X3]:(cartesian_product2(unordered_pair(X1,X2),X3)=set_union2(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X3))&cartesian_product2(X3,unordered_pair(X1,X2))=set_union2(cartesian_product2(X3,singleton(X1)),cartesian_product2(X3,singleton(X2)))),file('/tmp/SRASS.s.p', t132_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:(cartesian_product2(unordered_pair(X1,X2),X3)=set_union2(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X3))&cartesian_product2(X3,unordered_pair(X1,X2))=set_union2(cartesian_product2(X3,singleton(X1)),cartesian_product2(X3,singleton(X2))))),inference(assume_negation,[status(cth)],[10])).
% fof(21, plain,![X4]:![X5]:![X6]:(cartesian_product2(set_union2(X4,X5),X6)=set_union2(cartesian_product2(X4,X6),cartesian_product2(X5,X6))&cartesian_product2(X6,set_union2(X4,X5))=set_union2(cartesian_product2(X6,X4),cartesian_product2(X6,X5))),inference(variable_rename,[status(thm)],[4])).
% cnf(22,plain,(cartesian_product2(X1,set_union2(X2,X3))=set_union2(cartesian_product2(X1,X2),cartesian_product2(X1,X3))),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(cartesian_product2(set_union2(X1,X2),X3)=set_union2(cartesian_product2(X1,X3),cartesian_product2(X2,X3))),inference(split_conjunct,[status(thm)],[21])).
% fof(24, plain,![X3]:![X4]:unordered_pair(X3,X4)=set_union2(singleton(X3),singleton(X4)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(unordered_pair(X1,X2)=set_union2(singleton(X1),singleton(X2))),inference(split_conjunct,[status(thm)],[24])).
% fof(38, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(cartesian_product2(unordered_pair(X1,X2),X3)=set_union2(cartesian_product2(singleton(X1),X3),cartesian_product2(singleton(X2),X3)))|~(cartesian_product2(X3,unordered_pair(X1,X2))=set_union2(cartesian_product2(X3,singleton(X1)),cartesian_product2(X3,singleton(X2))))),inference(fof_nnf,[status(thm)],[11])).
% fof(39, negated_conjecture,?[X4]:?[X5]:?[X6]:(~(cartesian_product2(unordered_pair(X4,X5),X6)=set_union2(cartesian_product2(singleton(X4),X6),cartesian_product2(singleton(X5),X6)))|~(cartesian_product2(X6,unordered_pair(X4,X5))=set_union2(cartesian_product2(X6,singleton(X4)),cartesian_product2(X6,singleton(X5))))),inference(variable_rename,[status(thm)],[38])).
% fof(40, negated_conjecture,(~(cartesian_product2(unordered_pair(esk3_0,esk4_0),esk5_0)=set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0)))|~(cartesian_product2(esk5_0,unordered_pair(esk3_0,esk4_0))=set_union2(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk5_0,singleton(esk4_0))))),inference(skolemize,[status(esa)],[39])).
% cnf(41,negated_conjecture,(cartesian_product2(esk5_0,unordered_pair(esk3_0,esk4_0))!=set_union2(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk5_0,singleton(esk4_0)))|cartesian_product2(unordered_pair(esk3_0,esk4_0),esk5_0)!=set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0))),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,negated_conjecture,(set_union2(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk5_0,singleton(esk4_0)))!=cartesian_product2(esk5_0,set_union2(singleton(esk3_0),singleton(esk4_0)))|set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0))!=cartesian_product2(set_union2(singleton(esk3_0),singleton(esk4_0)),esk5_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[41,25,theory(equality)]),25,theory(equality)]),['unfolding']).
% cnf(51,negated_conjecture,($false|set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0))!=cartesian_product2(set_union2(singleton(esk3_0),singleton(esk4_0)),esk5_0)),inference(rw,[status(thm)],[43,22,theory(equality)])).
% cnf(52,negated_conjecture,(set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0))!=cartesian_product2(set_union2(singleton(esk3_0),singleton(esk4_0)),esk5_0)),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(95,negated_conjecture,($false),inference(rw,[status(thm)],[52,23,theory(equality)])).
% cnf(96,negated_conjecture,($false),inference(cn,[status(thm)],[95,theory(equality)])).
% cnf(97,negated_conjecture,($false),96,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 1
% # ...subsumed : 6
% # ...remaining for further processing: 14
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 39
% # ...of the previous two non-trivial : 29
% # Contextual simplify-reflections : 0
% # Paramodulations : 39
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 32
% # Clause-clause subsumption calls (NU) : 40
% # Rec. Clause-clause subsumption calls : 40
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 15 leaves, 1.93+/-1.482 terms/leaf
% # Paramod-from index: 3 leaves, 2.00+/-0.816 terms/leaf
% # Paramod-into index: 12 leaves, 2.17+/-1.572 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.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP1403/SET979+1.tptp
%
%------------------------------------------------------------------------------