TSTP Solution File: SET971+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET971+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 : art05.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:27:25 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/SystemOnTPTP6126/SET971+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6126/SET971+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6126/SET971+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 6222
% 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(1, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),file('/tmp/SRASS.s.p', t123_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(8, conjecture,![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3))=cartesian_product2(X1,X3)),file('/tmp/SRASS.s.p', t124_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3))=cartesian_product2(X1,X3))),inference(assume_negation,[status(cth)],[8])).
% fof(11, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(17, plain,![X5]:![X6]:![X7]:![X8]:cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8))=set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),inference(variable_rename,[status(thm)],[4])).
% cnf(18,plain,(cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X1]:![X2]:(~(subset(X1,X2))|set_intersection2(X1,X2)=X1),inference(fof_nnf,[status(thm)],[5])).
% fof(20, plain,![X3]:![X4]:(~(subset(X3,X4))|set_intersection2(X3,X4)=X3),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(set_intersection2(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% fof(28, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(X1,X2)&subset(X3,X4))&~(set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3))=cartesian_product2(X1,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(29, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((subset(X5,X6)&subset(X7,X8))&~(set_intersection2(cartesian_product2(X5,X8),cartesian_product2(X6,X7))=cartesian_product2(X5,X7))),inference(variable_rename,[status(thm)],[28])).
% fof(30, negated_conjecture,((subset(esk3_0,esk4_0)&subset(esk5_0,esk6_0))&~(set_intersection2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk5_0))=cartesian_product2(esk3_0,esk5_0))),inference(skolemize,[status(esa)],[29])).
% cnf(31,negated_conjecture,(set_intersection2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk5_0))!=cartesian_product2(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[30])).
% cnf(34,negated_conjecture,(set_intersection2(esk5_0,esk6_0)=esk5_0),inference(spm,[status(thm)],[21,32,theory(equality)])).
% cnf(35,negated_conjecture,(set_intersection2(esk3_0,esk4_0)=esk3_0),inference(spm,[status(thm)],[21,33,theory(equality)])).
% cnf(54,negated_conjecture,(cartesian_product2(esk3_0,set_intersection2(X1,X2))=set_intersection2(cartesian_product2(esk3_0,X1),cartesian_product2(esk4_0,X2))),inference(spm,[status(thm)],[18,35,theory(equality)])).
% cnf(72,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[31,54,theory(equality)]),12,theory(equality)]),34,theory(equality)])).
% cnf(73,negated_conjecture,($false),inference(cn,[status(thm)],[72,theory(equality)])).
% cnf(74,negated_conjecture,($false),73,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 29
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections : 0
% # Paramodulations : 29
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 15
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 30 leaves, 1.17+/-0.582 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.575 terms/leaf
% # Paramod-into index: 24 leaves, 1.17+/-0.624 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 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/SystemOnTPTP6126/SET971+1.tptp
%
%------------------------------------------------------------------------------