TSTP Solution File: SET607+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET607+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 : art01.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 : Wed Dec 29 23:15:22 EST 2010
% Result : Theorem 24.45s
% Output : Solution 24.45s
% 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/SystemOnTPTP25046/SET607+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25046/SET607+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25046/SET607+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 25142
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.93 CPU 4.03 WC
% PrfWatch: 5.92 CPU 6.04 WC
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.89 CPU 10.05 WC
% PrfWatch: 11.88 CPU 12.06 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.85 CPU 14.06 WC
% PrfWatch: 15.84 CPU 16.07 WC
% PrfWatch: 17.83 CPU 18.08 WC
% PrfWatch: 19.82 CPU 20.08 WC
% PrfWatch: 21.82 CPU 22.09 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(3, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(5, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(8, conjecture,![X1]:![X2]:union(X1,difference(X2,X1))=union(X1,X2),file('/tmp/SRASS.s.p', prove_th79)).
% fof(9, negated_conjecture,~(![X1]:![X2]:union(X1,difference(X2,X1))=union(X1,X2)),inference(assume_negation,[status(cth)],[8])).
% fof(10, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(11, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(14, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[14])).
% cnf(16,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(18,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[15])).
% fof(19, 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)],[3])).
% fof(20, 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)],[19])).
% fof(21, 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)],[20])).
% cnf(22,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[21])).
% fof(34, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(35, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(42, 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)],[7])).
% fof(43, 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)],[42])).
% fof(44, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[43])).
% fof(45, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[45])).
% cnf(47,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(50, negated_conjecture,?[X1]:?[X2]:~(union(X1,difference(X2,X1))=union(X1,X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(51, negated_conjecture,?[X3]:?[X4]:~(union(X3,difference(X4,X3))=union(X3,X4)),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,~(union(esk3_0,difference(esk4_0,esk3_0))=union(esk3_0,esk4_0)),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(union(esk3_0,difference(esk4_0,esk3_0))!=union(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(64,plain,(subset(X1,union(X2,X3))|~member(esk2_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[47,22,theory(equality)])).
% cnf(65,plain,(subset(X1,union(X2,X3))|~member(esk2_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[47,23,theory(equality)])).
% cnf(74,plain,(member(esk2_2(union(X1,X2),X3),X2)|member(esk2_2(union(X1,X2),X3),X1)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[24,48,theory(equality)])).
% cnf(198,plain,(subset(X1,union(difference(X2,X3),X4))|member(esk2_2(X1,union(difference(X2,X3),X4)),X3)|~member(esk2_2(X1,union(difference(X2,X3),X4)),X2)),inference(spm,[status(thm)],[65,16,theory(equality)])).
% cnf(304,plain,(member(esk2_2(union(X1,difference(X2,X3)),X4),X2)|subset(union(X1,difference(X2,X3)),X4)|member(esk2_2(union(X1,difference(X2,X3)),X4),X1)),inference(spm,[status(thm)],[18,74,theory(equality)])).
% cnf(310,plain,(subset(union(X1,X2),union(X3,X2))|member(esk2_2(union(X1,X2),union(X3,X2)),X1)),inference(spm,[status(thm)],[64,74,theory(equality)])).
% cnf(9081,plain,(subset(union(X1,difference(X2,X3)),union(X2,X4))|member(esk2_2(union(X1,difference(X2,X3)),union(X2,X4)),X1)),inference(spm,[status(thm)],[65,304,theory(equality)])).
% cnf(11572,plain,(subset(union(X1,X2),union(difference(X1,X3),X2))|member(esk2_2(union(X1,X2),union(difference(X1,X3),X2)),X3)),inference(spm,[status(thm)],[198,310,theory(equality)])).
% cnf(631689,plain,(subset(union(X1,difference(X2,X3)),union(X2,X1))),inference(spm,[status(thm)],[64,9081,theory(equality)])).
% cnf(935790,plain,(subset(union(X1,X2),union(difference(X1,X2),X2))),inference(spm,[status(thm)],[64,11572,theory(equality)])).
% cnf(936160,plain,(subset(union(X1,X2),union(X2,difference(X1,X2)))),inference(rw,[status(thm)],[935790,12,theory(equality)])).
% cnf(936572,plain,(union(X1,difference(X2,X1))=union(X2,X1)|~subset(union(X1,difference(X2,X1)),union(X2,X1))),inference(spm,[status(thm)],[37,936160,theory(equality)])).
% cnf(936895,plain,(union(X1,difference(X2,X1))=union(X2,X1)|$false),inference(rw,[status(thm)],[936572,631689,theory(equality)])).
% cnf(936896,plain,(union(X1,difference(X2,X1))=union(X2,X1)),inference(cn,[status(thm)],[936895,theory(equality)])).
% cnf(939125,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[53,936896,theory(equality)]),12,theory(equality)])).
% cnf(939126,negated_conjecture,($false),inference(cn,[status(thm)],[939125,theory(equality)])).
% cnf(939127,negated_conjecture,($false),939126,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17165
% # ...of these trivial : 945
% # ...subsumed : 14985
% # ...remaining for further processing: 1235
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 130
% # Generated clauses : 533303
% # ...of the previous two non-trivial : 370297
% # Contextual simplify-reflections : 432
% # Paramodulations : 532505
% # Factorizations : 796
% # Equation resolutions : 2
% # Current number of processed clauses: 1090
% # Positive orientable unit clauses: 415
% # Positive unorientable unit clauses: 99
% # Negative unit clauses : 5
% # Non-unit-clauses : 571
% # Current number of unprocessed clauses: 308473
% # ...number of literals in the above : 803236
% # Clause-clause subsumption calls (NU) : 121831
% # Rec. Clause-clause subsumption calls : 64796
% # Unit Clause-clause subsumption calls : 36939
% # Rewrite failures with RHS unbound : 3640
% # Indexed BW rewrite attempts : 24413
% # Indexed BW rewrite successes : 925
% # Backwards rewriting index: 394 leaves, 5.79+/-10.428 terms/leaf
% # Paramod-from index: 149 leaves, 7.09+/-13.351 terms/leaf
% # Paramod-into index: 345 leaves, 5.73+/-10.460 terms/leaf
% # -------------------------------------------------
% # User time : 12.529 s
% # System time : 0.504 s
% # Total time : 13.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 23.43 CPU 23.73 WC
% FINAL PrfWatch: 23.43 CPU 23.73 WC
% SZS output end Solution for /tmp/SystemOnTPTP25046/SET607+3.tptp
%
%------------------------------------------------------------------------------