TSTP Solution File: SET617+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET617+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:21:41 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP13460/SET617+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13460/SET617+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13460/SET617+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 13592
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:union(X1,empty_set)=X1,file('/tmp/SRASS.s.p', union_empty_set)).
% fof(3, axiom,![X1]:difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', no_difference_with_empty_set1)).
% fof(4, axiom,![X1]:difference(empty_set,X1)=empty_set,file('/tmp/SRASS.s.p', no_difference_with_empty_set2)).
% fof(6, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(7, axiom,![X1]:![X2]:symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1)),file('/tmp/SRASS.s.p', symmetric_difference_defn)).
% fof(13, conjecture,![X1]:(symmetric_difference(X1,empty_set)=X1&symmetric_difference(empty_set,X1)=X1),file('/tmp/SRASS.s.p', prove_th92)).
% fof(14, negated_conjecture,~(![X1]:(symmetric_difference(X1,empty_set)=X1&symmetric_difference(empty_set,X1)=X1)),inference(assume_negation,[status(cth)],[13])).
% fof(19, plain,![X2]:union(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,(union(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,(difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:difference(empty_set,X2)=empty_set,inference(variable_rename,[status(thm)],[4])).
% cnf(24,plain,(difference(empty_set,X1)=empty_set),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(28,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:symmetric_difference(X3,X4)=union(difference(X3,X4),difference(X4,X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(30,plain,(symmetric_difference(X1,X2)=union(difference(X1,X2),difference(X2,X1))),inference(split_conjunct,[status(thm)],[29])).
% fof(62, negated_conjecture,?[X1]:(~(symmetric_difference(X1,empty_set)=X1)|~(symmetric_difference(empty_set,X1)=X1)),inference(fof_nnf,[status(thm)],[14])).
% fof(63, negated_conjecture,?[X2]:(~(symmetric_difference(X2,empty_set)=X2)|~(symmetric_difference(empty_set,X2)=X2)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(symmetric_difference(esk4_0,empty_set)=esk4_0)|~(symmetric_difference(empty_set,esk4_0)=esk4_0)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(symmetric_difference(empty_set,esk4_0)!=esk4_0|symmetric_difference(esk4_0,empty_set)!=esk4_0),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,negated_conjecture,(union(difference(empty_set,esk4_0),difference(esk4_0,empty_set))!=esk4_0|union(difference(esk4_0,empty_set),difference(empty_set,esk4_0))!=esk4_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[65,30,theory(equality)]),30,theory(equality)]),['unfolding']).
% cnf(68,negated_conjecture,(union(empty_set,difference(esk4_0,empty_set))!=esk4_0|union(difference(esk4_0,empty_set),difference(empty_set,esk4_0))!=esk4_0),inference(rw,[status(thm)],[67,24,theory(equality)])).
% cnf(69,negated_conjecture,(union(empty_set,difference(esk4_0,empty_set))!=esk4_0|union(difference(esk4_0,empty_set),empty_set)!=esk4_0),inference(rw,[status(thm)],[68,24,theory(equality)])).
% cnf(77,plain,(union(empty_set,X1)=X1),inference(spm,[status(thm)],[20,28,theory(equality)])).
% cnf(99,negated_conjecture,($false|union(difference(esk4_0,empty_set),empty_set)!=esk4_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[69,22,theory(equality)]),77,theory(equality)])).
% cnf(100,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[99,22,theory(equality)]),20,theory(equality)])).
% cnf(101,negated_conjecture,($false),inference(cn,[status(thm)],[100,theory(equality)])).
% cnf(102,negated_conjecture,($false),101,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 3
% # ...subsumed : 0
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 22
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 0
% # Paramodulations : 18
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 19
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 12
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 20 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-into index: 19 leaves, 1.26+/-0.547 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.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP13460/SET617+3.tptp
%
%------------------------------------------------------------------------------