TSTP Solution File: SET076+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET076+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : gettysburg.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 11:06:30 EDT 2012
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP4482/SET076+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4482/SET076+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4482/SET076+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 4580
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-Mode selected heuristic G_E___107_C45_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 44
% # Removed by relevancy pruning : 0
% # Initial clauses : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 1959
% # ...of these trivial : 19
% # ...subsumed : 1093
% # ...remaining for further processing: 847
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 65
% # Backward-rewritten : 74
% # Generated clauses : 19946
% # ...of the previous two non-trivial : 17749
% # Contextual simplify-reflections : 338
% # Paramodulations : 19903
% # Factorizations : 23
% # Equation resolutions : 17
% # Current number of processed clauses: 703
% # Positive orientable unit clauses: 114
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 567
% # Current number of unprocessed clauses: 12967
% # ...number of literals in the above : 44475
% # Clause-clause subsumption calls (NU) : 58893
% # Rec. Clause-clause subsumption calls : 43862
% # Non-unit clause-clause subsumptions: 993
% # Unit Clause-clause subsumption calls : 6089
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 76
% # BW rewrite match successes : 19
% # Backwards rewriting index : 3487 nodes, 760 leaves, 1.67+/-2.255 terms/leaf
% # Paramod-from index : 1252 nodes, 262 leaves, 1.26+/-0.721 terms/leaf
% # Paramod-into index : 2429 nodes, 503 leaves, 1.62+/-2.402 terms/leaf
% # Paramod-neg-atom index : 738 nodes, 166 leaves, 1.49+/-1.085 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(4, axiom,![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(44, conjecture,![X1]:![X2]:![X4]:((member(X1,X4)&member(X2,X4))=>subclass(unordered_pair(X1,X2),X4)),file('/tmp/SRASS.s.p', unordered_pair_is_subset)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X4]:((member(X1,X4)&member(X2,X4))=>subclass(unordered_pair(X1,X2),X4))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X1]:![X2]:((~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,(![X1]:![X2]:(~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&![X1]:![X2]:(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:(?[X9]:(member(X9,X7)&~(member(X9,X8)))|subclass(X7,X8))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)|subclass(X7,X8))&(~(member(esk1_2(X7,X8),X8))|subclass(X7,X8)))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(61, plain,![X3]:![X1]:![X2]:((~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(62, plain,(![X3]:![X1]:![X2]:(~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&![X3]:![X1]:![X2]:((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(shift_quantors,[status(thm)],[61])).
% fof(63, plain,(![X4]:![X5]:![X6]:(~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&![X7]:![X8]:![X9]:((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X4,universal_class)|~(member(X4,unordered_pair(X5,X6))))&((X4=X5|X4=X6)|~(member(X4,unordered_pair(X5,X6)))))&(((~(X7=X8)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9)))&((~(X7=X9)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9))))),inference(distribute,[status(thm)],[64])).
% cnf(68,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[65])).
% fof(273, negated_conjecture,?[X1]:?[X2]:?[X4]:((member(X1,X4)&member(X2,X4))&~(subclass(unordered_pair(X1,X2),X4))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X5]:?[X6]:?[X7]:((member(X5,X7)&member(X6,X7))&~(subclass(unordered_pair(X5,X6),X7))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,((member(esk8_0,esk10_0)&member(esk9_0,esk10_0))&~(subclass(unordered_pair(esk8_0,esk9_0),esk10_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~subclass(unordered_pair(esk8_0,esk9_0),esk10_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(member(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(member(esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(352,plain,(esk1_2(unordered_pair(X1,X2),X3)=X1|esk1_2(unordered_pair(X1,X2),X3)=X2|subclass(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[68,55,theory(equality)])).
% cnf(775,plain,(subclass(unordered_pair(X1,X2),X3)|esk1_2(unordered_pair(X1,X2),X3)=X2|~member(X1,X3)),inference(spm,[status(thm)],[54,352,theory(equality)])).
% cnf(21886,plain,(subclass(unordered_pair(X1,X2),X3)|~member(X2,X3)|~member(X1,X3)),inference(spm,[status(thm)],[54,775,theory(equality)])).
% cnf(24780,negated_conjecture,(~member(esk9_0,esk10_0)|~member(esk8_0,esk10_0)),inference(spm,[status(thm)],[276,21886,theory(equality)])).
% cnf(24806,negated_conjecture,($false|~member(esk8_0,esk10_0)),inference(rw,[status(thm)],[24780,277,theory(equality)])).
% cnf(24807,negated_conjecture,($false|$false),inference(rw,[status(thm)],[24806,278,theory(equality)])).
% cnf(24808,negated_conjecture,($false),inference(cn,[status(thm)],[24807,theory(equality)])).
% cnf(24809,negated_conjecture,($false),24808,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.71 CPU 0.51 WC
% FINAL PrfWatch: 0.71 CPU 0.51 WC
% SZS output end Solution for /tmp/SystemOnTPTP4482/SET076+1.tptp
%
%------------------------------------------------------------------------------