TSTP Solution File: SEU130+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU130+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Thu Dec 30 01:12:17 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP16457/SEU130+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16457/SEU130+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16457/SEU130+2.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 16553
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(3, axiom,![X1]:![X2]:set_intersection2(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence_k3_xboole_0)).
% fof(5, axiom,![X1]:![X2]:subset(set_intersection2(X1,X2),X1),file('/tmp/SRASS.s.p', t17_xboole_1)).
% fof(8, axiom,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_intersection2(X1,X3),set_intersection2(X2,X3))),file('/tmp/SRASS.s.p', t26_xboole_1)).
% fof(38, conjecture,![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(39, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1)),inference(assume_negation,[status(cth)],[38])).
% fof(47, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(48,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(50, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[49])).
% fof(51, 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)],[50])).
% cnf(52,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(55, plain,![X3]:![X4]:set_intersection2(X3,X3)=X3,inference(variable_rename,[status(thm)],[3])).
% cnf(56,plain,(set_intersection2(X1,X1)=X1),inference(split_conjunct,[status(thm)],[55])).
% fof(59, plain,![X3]:![X4]:subset(set_intersection2(X3,X4),X3),inference(variable_rename,[status(thm)],[5])).
% cnf(60,plain,(subset(set_intersection2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(67, plain,![X1]:![X2]:![X3]:(~(subset(X1,X2))|subset(set_intersection2(X1,X3),set_intersection2(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(68, plain,![X4]:![X5]:![X6]:(~(subset(X4,X5))|subset(set_intersection2(X4,X6),set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(subset(set_intersection2(X1,X2),set_intersection2(X3,X2))|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[68])).
% fof(176, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(set_intersection2(X1,X2)=X1)),inference(fof_nnf,[status(thm)],[39])).
% fof(177, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(set_intersection2(X3,X4)=X3)),inference(variable_rename,[status(thm)],[176])).
% fof(178, negated_conjecture,(subset(esk9_0,esk10_0)&~(set_intersection2(esk9_0,esk10_0)=esk9_0)),inference(skolemize,[status(esa)],[177])).
% cnf(179,negated_conjecture,(set_intersection2(esk9_0,esk10_0)!=esk9_0),inference(split_conjunct,[status(thm)],[178])).
% cnf(180,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[178])).
% cnf(191,plain,(subset(set_intersection2(X2,X1),X1)),inference(spm,[status(thm)],[60,48,theory(equality)])).
% cnf(264,plain,(subset(X1,set_intersection2(X2,X1))|~subset(X1,X2)),inference(spm,[status(thm)],[69,56,theory(equality)])).
% cnf(1114,plain,(set_intersection2(X1,X2)=X2|~subset(set_intersection2(X1,X2),X2)|~subset(X2,X1)),inference(spm,[status(thm)],[52,264,theory(equality)])).
% cnf(1130,plain,(set_intersection2(X1,X2)=X2|$false|~subset(X2,X1)),inference(rw,[status(thm)],[1114,191,theory(equality)])).
% cnf(1131,plain,(set_intersection2(X1,X2)=X2|~subset(X2,X1)),inference(cn,[status(thm)],[1130,theory(equality)])).
% cnf(1147,plain,(X2=set_intersection2(X2,X1)|~subset(X2,X1)),inference(spm,[status(thm)],[48,1131,theory(equality)])).
% cnf(1204,negated_conjecture,(~subset(esk9_0,esk10_0)),inference(spm,[status(thm)],[179,1147,theory(equality)])).
% cnf(1239,negated_conjecture,($false),inference(rw,[status(thm)],[1204,180,theory(equality)])).
% cnf(1240,negated_conjecture,($false),inference(cn,[status(thm)],[1239,theory(equality)])).
% cnf(1241,negated_conjecture,($false),1240,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 195
% # ...of these trivial : 8
% # ...subsumed : 34
% # ...remaining for further processing: 153
% # Other redundant clauses eliminated : 29
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 862
% # ...of the previous two non-trivial : 606
% # Contextual simplify-reflections : 3
% # Paramodulations : 821
% # Factorizations : 6
% # Equation resolutions : 35
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 26
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 8
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 510
% # ...number of literals in the above : 1597
% # Clause-clause subsumption calls (NU) : 181
% # Rec. Clause-clause subsumption calls : 176
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 40
% # Indexed BW rewrite successes : 30
% # Backwards rewriting index: 63 leaves, 1.59+/-1.217 terms/leaf
% # Paramod-from index: 32 leaves, 1.50+/-0.707 terms/leaf
% # Paramod-into index: 59 leaves, 1.51+/-0.998 terms/leaf
% # -------------------------------------------------
% # User time : 0.037 s
% # System time : 0.003 s
% # Total time : 0.040 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP16457/SEU130+2.tptp
%
%------------------------------------------------------------------------------