TSTP Solution File: SET624+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET624+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:23:05 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP13810/SET624+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13810/SET624+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13810/SET624+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 13942
% 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]:(intersect(X1,X2)=>intersect(X2,X1)),file('/tmp/SRASS.s.p', symmetry_of_intersect)).
% 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]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(4, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(6, conjecture,![X1]:![X2]:![X3]:(intersect(X1,union(X2,X3))<=>(intersect(X1,X2)|intersect(X1,X3))),file('/tmp/SRASS.s.p', prove_intersect_with_union)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:(intersect(X1,union(X2,X3))<=>(intersect(X1,X2)|intersect(X1,X3)))),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X1]:![X2]:(~(intersect(X1,X2))|intersect(X2,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(9, plain,![X3]:![X4]:(~(intersect(X3,X4))|intersect(X4,X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(10,plain,(intersect(X1,X2)|~intersect(X2,X1)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, 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(12, 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)],[11])).
% fof(13, 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)],[12])).
% cnf(14,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[13])).
% cnf(16,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[13])).
% fof(17, plain,![X1]:![X2]:((~(intersect(X1,X2))|?[X3]:(member(X3,X1)&member(X3,X2)))&(![X3]:(~(member(X3,X1))|~(member(X3,X2)))|intersect(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X4]:![X5]:((~(intersect(X4,X5))|?[X6]:(member(X6,X4)&member(X6,X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:((~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&(~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&((member(esk1_2(X4,X5),X4)|~(intersect(X4,X5)))&(member(esk1_2(X4,X5),X5)|~(intersect(X4,X5))))),inference(distribute,[status(thm)],[20])).
% cnf(22,plain,(member(esk1_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(member(esk1_2(X1,X2),X1)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,plain,(intersect(X1,X2)|~member(X3,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(25, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(36, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(intersect(X1,union(X2,X3)))|(~(intersect(X1,X2))&~(intersect(X1,X3))))&(intersect(X1,union(X2,X3))|(intersect(X1,X2)|intersect(X1,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(37, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(intersect(X4,union(X5,X6)))|(~(intersect(X4,X5))&~(intersect(X4,X6))))&(intersect(X4,union(X5,X6))|(intersect(X4,X5)|intersect(X4,X6)))),inference(variable_rename,[status(thm)],[36])).
% fof(38, negated_conjecture,((~(intersect(esk3_0,union(esk4_0,esk5_0)))|(~(intersect(esk3_0,esk4_0))&~(intersect(esk3_0,esk5_0))))&(intersect(esk3_0,union(esk4_0,esk5_0))|(intersect(esk3_0,esk4_0)|intersect(esk3_0,esk5_0)))),inference(skolemize,[status(esa)],[37])).
% fof(39, negated_conjecture,(((~(intersect(esk3_0,esk4_0))|~(intersect(esk3_0,union(esk4_0,esk5_0))))&(~(intersect(esk3_0,esk5_0))|~(intersect(esk3_0,union(esk4_0,esk5_0)))))&(intersect(esk3_0,union(esk4_0,esk5_0))|(intersect(esk3_0,esk4_0)|intersect(esk3_0,esk5_0)))),inference(distribute,[status(thm)],[38])).
% cnf(40,negated_conjecture,(intersect(esk3_0,esk5_0)|intersect(esk3_0,esk4_0)|intersect(esk3_0,union(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,negated_conjecture,(~intersect(esk3_0,union(esk4_0,esk5_0))|~intersect(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,negated_conjecture,(~intersect(esk3_0,union(esk4_0,esk5_0))|~intersect(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(50,plain,(intersect(X1,X2)|~member(esk1_2(X3,X2),X1)|~intersect(X3,X2)),inference(spm,[status(thm)],[24,22,theory(equality)])).
% cnf(51,plain,(intersect(X1,X2)|~member(esk1_2(X2,X3),X1)|~intersect(X2,X3)),inference(spm,[status(thm)],[24,23,theory(equality)])).
% cnf(56,plain,(member(esk1_2(X1,union(X2,X3)),X2)|member(esk1_2(X1,union(X2,X3)),X3)|~intersect(X1,union(X2,X3))),inference(spm,[status(thm)],[16,22,theory(equality)])).
% cnf(70,plain,(intersect(union(X1,X2),X3)|~intersect(X4,X3)|~member(esk1_2(X4,X3),X2)),inference(spm,[status(thm)],[50,14,theory(equality)])).
% cnf(114,plain,(intersect(union(X1,X2),X3)|~intersect(X2,X3)),inference(spm,[status(thm)],[70,23,theory(equality)])).
% cnf(116,plain,(intersect(X1,union(X2,X3))|~intersect(X3,X1)),inference(spm,[status(thm)],[10,114,theory(equality)])).
% cnf(315,negated_conjecture,(~intersect(esk3_0,esk5_0)|~intersect(esk5_0,esk3_0)),inference(spm,[status(thm)],[41,116,theory(equality)])).
% cnf(322,plain,(intersect(X1,union(X3,X2))|~intersect(X3,X1)),inference(spm,[status(thm)],[116,26,theory(equality)])).
% cnf(331,negated_conjecture,(~intersect(esk3_0,esk5_0)),inference(csr,[status(thm)],[315,10])).
% cnf(332,negated_conjecture,(intersect(esk3_0,union(esk4_0,esk5_0))|intersect(esk3_0,esk4_0)),inference(sr,[status(thm)],[40,331,theory(equality)])).
% cnf(486,negated_conjecture,(~intersect(esk3_0,esk4_0)|~intersect(esk4_0,esk3_0)),inference(spm,[status(thm)],[42,322,theory(equality)])).
% cnf(496,negated_conjecture,(~intersect(esk3_0,esk4_0)),inference(csr,[status(thm)],[486,10])).
% cnf(497,negated_conjecture,(intersect(esk3_0,union(esk4_0,esk5_0))),inference(sr,[status(thm)],[332,496,theory(equality)])).
% cnf(508,negated_conjecture,(member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk5_0)|member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk4_0)),inference(spm,[status(thm)],[56,497,theory(equality)])).
% cnf(2417,negated_conjecture,(intersect(esk5_0,esk3_0)|member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk4_0)|~intersect(esk3_0,union(esk4_0,esk5_0))),inference(spm,[status(thm)],[51,508,theory(equality)])).
% cnf(2430,negated_conjecture,(intersect(esk5_0,esk3_0)|member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk4_0)|$false),inference(rw,[status(thm)],[2417,497,theory(equality)])).
% cnf(2431,negated_conjecture,(intersect(esk5_0,esk3_0)|member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk4_0)),inference(cn,[status(thm)],[2430,theory(equality)])).
% cnf(2460,negated_conjecture,(intersect(esk4_0,esk3_0)|intersect(esk5_0,esk3_0)|~intersect(esk3_0,union(esk4_0,esk5_0))),inference(spm,[status(thm)],[51,2431,theory(equality)])).
% cnf(2473,negated_conjecture,(intersect(esk4_0,esk3_0)|intersect(esk5_0,esk3_0)|$false),inference(rw,[status(thm)],[2460,497,theory(equality)])).
% cnf(2474,negated_conjecture,(intersect(esk4_0,esk3_0)|intersect(esk5_0,esk3_0)),inference(cn,[status(thm)],[2473,theory(equality)])).
% cnf(2496,negated_conjecture,(intersect(esk3_0,esk5_0)|intersect(esk4_0,esk3_0)),inference(spm,[status(thm)],[10,2474,theory(equality)])).
% cnf(2506,negated_conjecture,(intersect(esk4_0,esk3_0)),inference(sr,[status(thm)],[2496,331,theory(equality)])).
% cnf(2512,negated_conjecture,(intersect(esk3_0,esk4_0)),inference(spm,[status(thm)],[10,2506,theory(equality)])).
% cnf(2522,negated_conjecture,($false),inference(sr,[status(thm)],[2512,496,theory(equality)])).
% cnf(2523,negated_conjecture,($false),2522,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 328
% # ...of these trivial : 94
% # ...subsumed : 78
% # ...remaining for further processing: 156
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 1736
% # ...of the previous two non-trivial : 1128
% # Contextual simplify-reflections : 4
% # Paramodulations : 1711
% # Factorizations : 14
% # Equation resolutions : 0
% # Current number of processed clauses: 127
% # Positive orientable unit clauses: 65
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 59
% # Current number of unprocessed clauses: 775
% # ...number of literals in the above : 1605
% # Clause-clause subsumption calls (NU) : 1563
% # Rec. Clause-clause subsumption calls : 1499
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 245
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 71 leaves, 2.73+/-3.382 terms/leaf
% # Paramod-from index: 37 leaves, 2.22+/-3.281 terms/leaf
% # Paramod-into index: 63 leaves, 2.60+/-3.225 terms/leaf
% # -------------------------------------------------
% # User time : 0.047 s
% # System time : 0.005 s
% # Total time : 0.052 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.23 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP13810/SET624+3.tptp
%
%------------------------------------------------------------------------------