TSTP Solution File: SET162+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET162+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 : art07.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:05:59 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP24518/SET162+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24518/SET162+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24518/SET162+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 24614
% 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]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(2, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_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(9, conjecture,![X1]:union(X1,empty_set)=X1,file('/tmp/SRASS.s.p', prove_union_empty_set)).
% fof(10, negated_conjecture,~(![X1]:union(X1,empty_set)=X1),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(13, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(14,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[11])).
% cnf(16,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, 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(18, 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)],[17])).
% fof(19, 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)],[18])).
% cnf(20,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[19])).
% fof(32, 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(33, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[32])).
% fof(34, 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)],[33])).
% cnf(35,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(40, 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(41, 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)],[40])).
% fof(42, 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)],[41])).
% fof(43, 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)],[42])).
% fof(44, 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)],[43])).
% cnf(45,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(54, negated_conjecture,?[X1]:~(union(X1,empty_set)=X1),inference(fof_nnf,[status(thm)],[10])).
% fof(55, negated_conjecture,?[X2]:~(union(X2,empty_set)=X2),inference(variable_rename,[status(thm)],[54])).
% fof(56, negated_conjecture,~(union(esk4_0,empty_set)=esk4_0),inference(skolemize,[status(esa)],[55])).
% cnf(57,negated_conjecture,(union(esk4_0,empty_set)!=esk4_0),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,negated_conjecture,(union(empty_set,esk4_0)!=esk4_0),inference(rw,[status(thm)],[57,14,theory(equality)])).
% cnf(77,plain,(member(esk2_2(union(X1,X2),X3),X1)|member(esk2_2(union(X1,X2),X3),X2)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[22,46,theory(equality)])).
% cnf(79,plain,(subset(X1,union(X2,X3))|~member(esk2_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[45,20,theory(equality)])).
% cnf(187,plain,(subset(union(empty_set,X1),X2)|member(esk2_2(union(empty_set,X1),X2),X1)),inference(spm,[status(thm)],[16,77,theory(equality)])).
% cnf(276,plain,(subset(X1,union(X2,X1))),inference(spm,[status(thm)],[79,46,theory(equality)])).
% cnf(2965,plain,(subset(union(empty_set,X1),X1)),inference(spm,[status(thm)],[45,187,theory(equality)])).
% cnf(2982,plain,(X1=union(empty_set,X1)|~subset(X1,union(empty_set,X1))),inference(spm,[status(thm)],[35,2965,theory(equality)])).
% cnf(2996,plain,(X1=union(empty_set,X1)|$false),inference(rw,[status(thm)],[2982,276,theory(equality)])).
% cnf(2997,plain,(X1=union(empty_set,X1)),inference(cn,[status(thm)],[2996,theory(equality)])).
% cnf(3068,negated_conjecture,($false),inference(rw,[status(thm)],[58,2997,theory(equality)])).
% cnf(3069,negated_conjecture,($false),inference(cn,[status(thm)],[3068,theory(equality)])).
% cnf(3070,negated_conjecture,($false),3069,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 452
% # ...of these trivial : 2
% # ...subsumed : 323
% # ...remaining for further processing: 127
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 47
% # Generated clauses : 1899
% # ...of the previous two non-trivial : 1416
% # Contextual simplify-reflections : 16
% # Paramodulations : 1845
% # Factorizations : 52
% # Equation resolutions : 2
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 301
% # ...number of literals in the above : 1025
% # Clause-clause subsumption calls (NU) : 3719
% # Rec. Clause-clause subsumption calls : 3097
% # Unit Clause-clause subsumption calls : 100
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 43
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 54 leaves, 1.78+/-1.707 terms/leaf
% # Paramod-from index: 20 leaves, 2.35+/-2.351 terms/leaf
% # Paramod-into index: 51 leaves, 1.69+/-1.651 terms/leaf
% # -------------------------------------------------
% # User time : 0.071 s
% # System time : 0.004 s
% # Total time : 0.075 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP24518/SET162+3.tptp
%
%------------------------------------------------------------------------------