TSTP Solution File: SET968+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET968+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 : art06.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:25:52 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/SystemOnTPTP6315/SET968+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6315/SET968+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6315/SET968+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 6411
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(3, 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(4, axiom,![X1]:![X2]:![X3]:set_union2(set_union2(X1,X2),X3)=set_union2(X1,set_union2(X2,X3)),file('/tmp/SRASS.s.p', t4_xboole_1)).
% fof(9, conjecture,![X1]:![X2]:![X3]:![X4]:cartesian_product2(set_union2(X1,X2),set_union2(X3,X4))=set_union2(set_union2(set_union2(cartesian_product2(X1,X3),cartesian_product2(X1,X4)),cartesian_product2(X2,X3)),cartesian_product2(X2,X4)),file('/tmp/SRASS.s.p', t121_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:cartesian_product2(set_union2(X1,X2),set_union2(X3,X4))=set_union2(set_union2(set_union2(cartesian_product2(X1,X3),cartesian_product2(X1,X4)),cartesian_product2(X2,X3)),cartesian_product2(X2,X4))),inference(assume_negation,[status(cth)],[9])).
% fof(14, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(15,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[14])).
% fof(18, 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)],[3])).
% cnf(19,plain,(cartesian_product2(X1,set_union2(X2,X3))=set_union2(cartesian_product2(X1,X2),cartesian_product2(X1,X3))),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(cartesian_product2(set_union2(X1,X2),X3)=set_union2(cartesian_product2(X1,X3),cartesian_product2(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X4]:![X5]:![X6]:set_union2(set_union2(X4,X5),X6)=set_union2(X4,set_union2(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(22,plain,(set_union2(set_union2(X1,X2),X3)=set_union2(X1,set_union2(X2,X3))),inference(split_conjunct,[status(thm)],[21])).
% fof(35, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:~(cartesian_product2(set_union2(X1,X2),set_union2(X3,X4))=set_union2(set_union2(set_union2(cartesian_product2(X1,X3),cartesian_product2(X1,X4)),cartesian_product2(X2,X3)),cartesian_product2(X2,X4))),inference(fof_nnf,[status(thm)],[10])).
% fof(36, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:~(cartesian_product2(set_union2(X5,X6),set_union2(X7,X8))=set_union2(set_union2(set_union2(cartesian_product2(X5,X7),cartesian_product2(X5,X8)),cartesian_product2(X6,X7)),cartesian_product2(X6,X8))),inference(variable_rename,[status(thm)],[35])).
% fof(37, negated_conjecture,~(cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0))=set_union2(set_union2(set_union2(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk6_0))),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0))!=set_union2(set_union2(set_union2(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk6_0))),inference(split_conjunct,[status(thm)],[37])).
% cnf(50,negated_conjecture,(cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0))!=set_union2(cartesian_product2(esk3_0,esk5_0),set_union2(cartesian_product2(esk3_0,esk6_0),set_union2(cartesian_product2(esk4_0,esk5_0),cartesian_product2(esk4_0,esk6_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[38,22,theory(equality)]),22,theory(equality)])).
% cnf(119,negated_conjecture,(set_union2(cartesian_product2(set_union2(esk3_0,esk4_0),esk5_0),cartesian_product2(set_union2(esk3_0,esk4_0),esk6_0))!=set_union2(cartesian_product2(esk3_0,esk5_0),set_union2(cartesian_product2(esk3_0,esk6_0),set_union2(cartesian_product2(esk4_0,esk5_0),cartesian_product2(esk4_0,esk6_0))))),inference(rw,[status(thm)],[50,19,theory(equality)])).
% cnf(148,negated_conjecture,(set_union2(cartesian_product2(esk3_0,esk5_0),set_union2(cartesian_product2(esk4_0,esk5_0),set_union2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk6_0))))!=set_union2(cartesian_product2(esk3_0,esk5_0),set_union2(cartesian_product2(esk3_0,esk6_0),set_union2(cartesian_product2(esk4_0,esk5_0),cartesian_product2(esk4_0,esk6_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[119,20,theory(equality)]),20,theory(equality)]),22,theory(equality)])).
% cnf(149,negated_conjecture,($false),inference(ar,[status(thm)],[148,15,22,theory(equality)])).
% cnf(150,negated_conjecture,($false),149,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 27
% # ...of these trivial : 2
% # ...subsumed : 10
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 62
% # ...of the previous two non-trivial : 40
% # Contextual simplify-reflections : 0
% # Paramodulations : 62
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 23
% # ...number of literals in the above : 32
% # Clause-clause subsumption calls (NU) : 21
% # Rec. Clause-clause subsumption calls : 21
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 15 leaves, 1.73+/-1.236 terms/leaf
% # Paramod-from index: 6 leaves, 1.50+/-0.764 terms/leaf
% # Paramod-into index: 11 leaves, 1.64+/-1.226 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP6315/SET968+1.tptp
%
%------------------------------------------------------------------------------