TSTP Solution File: GEO093+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO093+1 : TPTP v5.0.0. Released v2.4.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 04:22:57 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/SystemOnTPTP1101/GEO093+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1101/GEO093+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1101/GEO093+1.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 1198
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:((part_of(X2,X1)&~(X2=X1))=>open(X2)),file('/tmp/SRASS.s.p', c1)).
% fof(2, axiom,![X2]:![X3]:(?[X4]:meet(X4,X2,X3)=>?[X1]:X1=sum(X2,X3)),file('/tmp/SRASS.s.p', c8)).
% fof(3, axiom,![X1]:(open(X1)<=>?[X4]:end_point(X4,X1)),file('/tmp/SRASS.s.p', open_defn)).
% fof(5, axiom,![X1]:![X2]:(part_of(X2,X1)<=>![X4]:(incident_c(X4,X2)=>incident_c(X4,X1))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(7, axiom,![X1]:(closed(X1)<=>~(?[X4]:end_point(X4,X1))),file('/tmp/SRASS.s.p', closed_defn)).
% fof(11, axiom,![X1]:![X2]:![X3]:(X1=sum(X2,X3)<=>![X6]:(incident_c(X6,X1)<=>(incident_c(X6,X2)|incident_c(X6,X3)))),file('/tmp/SRASS.s.p', sum_defn)).
% fof(17, conjecture,![X1]:![X2]:![X3]:![X4]:((((open(X1)&part_of(X2,X1))&part_of(X3,X1))&meet(X4,X2,X3))=>open(sum(X2,X3))),file('/tmp/SRASS.s.p', proposition_2_14_2)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((((open(X1)&part_of(X2,X1))&part_of(X3,X1))&meet(X4,X2,X3))=>open(sum(X2,X3)))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X1]:![X2]:((~(part_of(X2,X1))|X2=X1)|open(X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X3]:![X4]:((~(part_of(X4,X3))|X4=X3)|open(X4)),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(open(X1)|X1=X2|~part_of(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:![X3]:(![X4]:~(meet(X4,X2,X3))|?[X1]:X1=sum(X2,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(24, plain,![X5]:![X6]:(![X7]:~(meet(X7,X5,X6))|?[X8]:X8=sum(X5,X6)),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:(![X7]:~(meet(X7,X5,X6))|esk1_2(X5,X6)=sum(X5,X6)),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:(~(meet(X7,X5,X6))|esk1_2(X5,X6)=sum(X5,X6)),inference(shift_quantors,[status(thm)],[25])).
% cnf(27,plain,(esk1_2(X1,X2)=sum(X1,X2)|~meet(X3,X1,X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:((~(open(X1))|?[X4]:end_point(X4,X1))&(![X4]:~(end_point(X4,X1))|open(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X5]:((~(open(X5))|?[X6]:end_point(X6,X5))&(![X7]:~(end_point(X7,X5))|open(X5))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X5]:((~(open(X5))|end_point(esk2_1(X5),X5))&(![X7]:~(end_point(X7,X5))|open(X5))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X5]:![X7]:((~(end_point(X7,X5))|open(X5))&(~(open(X5))|end_point(esk2_1(X5),X5))),inference(shift_quantors,[status(thm)],[30])).
% cnf(32,plain,(end_point(esk2_1(X1),X1)|~open(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(open(X1)|~end_point(X2,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(38, plain,![X1]:![X2]:((~(part_of(X2,X1))|![X4]:(~(incident_c(X4,X2))|incident_c(X4,X1)))&(?[X4]:(incident_c(X4,X2)&~(incident_c(X4,X1)))|part_of(X2,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(39, plain,![X5]:![X6]:((~(part_of(X6,X5))|![X7]:(~(incident_c(X7,X6))|incident_c(X7,X5)))&(?[X8]:(incident_c(X8,X6)&~(incident_c(X8,X5)))|part_of(X6,X5))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:((~(part_of(X6,X5))|![X7]:(~(incident_c(X7,X6))|incident_c(X7,X5)))&((incident_c(esk3_2(X5,X6),X6)&~(incident_c(esk3_2(X5,X6),X5)))|part_of(X6,X5))),inference(skolemize,[status(esa)],[39])).
% fof(41, plain,![X5]:![X6]:![X7]:(((~(incident_c(X7,X6))|incident_c(X7,X5))|~(part_of(X6,X5)))&((incident_c(esk3_2(X5,X6),X6)&~(incident_c(esk3_2(X5,X6),X5)))|part_of(X6,X5))),inference(shift_quantors,[status(thm)],[40])).
% fof(42, plain,![X5]:![X6]:![X7]:(((~(incident_c(X7,X6))|incident_c(X7,X5))|~(part_of(X6,X5)))&((incident_c(esk3_2(X5,X6),X6)|part_of(X6,X5))&(~(incident_c(esk3_2(X5,X6),X5))|part_of(X6,X5)))),inference(distribute,[status(thm)],[41])).
% cnf(43,plain,(part_of(X1,X2)|~incident_c(esk3_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(part_of(X1,X2)|incident_c(esk3_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(52, plain,![X1]:((~(closed(X1))|![X4]:~(end_point(X4,X1)))&(?[X4]:end_point(X4,X1)|closed(X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(53, plain,![X5]:((~(closed(X5))|![X6]:~(end_point(X6,X5)))&(?[X7]:end_point(X7,X5)|closed(X5))),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,![X5]:((~(closed(X5))|![X6]:~(end_point(X6,X5)))&(end_point(esk6_1(X5),X5)|closed(X5))),inference(skolemize,[status(esa)],[53])).
% fof(55, plain,![X5]:![X6]:((~(end_point(X6,X5))|~(closed(X5)))&(end_point(esk6_1(X5),X5)|closed(X5))),inference(shift_quantors,[status(thm)],[54])).
% cnf(56,plain,(closed(X1)|end_point(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(~closed(X1)|~end_point(X2,X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(77, plain,![X1]:![X2]:![X3]:((~(X1=sum(X2,X3))|![X6]:((~(incident_c(X6,X1))|(incident_c(X6,X2)|incident_c(X6,X3)))&((~(incident_c(X6,X2))&~(incident_c(X6,X3)))|incident_c(X6,X1))))&(?[X6]:((~(incident_c(X6,X1))|(~(incident_c(X6,X2))&~(incident_c(X6,X3))))&(incident_c(X6,X1)|(incident_c(X6,X2)|incident_c(X6,X3))))|X1=sum(X2,X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(78, plain,![X7]:![X8]:![X9]:((~(X7=sum(X8,X9))|![X10]:((~(incident_c(X10,X7))|(incident_c(X10,X8)|incident_c(X10,X9)))&((~(incident_c(X10,X8))&~(incident_c(X10,X9)))|incident_c(X10,X7))))&(?[X11]:((~(incident_c(X11,X7))|(~(incident_c(X11,X8))&~(incident_c(X11,X9))))&(incident_c(X11,X7)|(incident_c(X11,X8)|incident_c(X11,X9))))|X7=sum(X8,X9))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X7]:![X8]:![X9]:((~(X7=sum(X8,X9))|![X10]:((~(incident_c(X10,X7))|(incident_c(X10,X8)|incident_c(X10,X9)))&((~(incident_c(X10,X8))&~(incident_c(X10,X9)))|incident_c(X10,X7))))&(((~(incident_c(esk9_3(X7,X8,X9),X7))|(~(incident_c(esk9_3(X7,X8,X9),X8))&~(incident_c(esk9_3(X7,X8,X9),X9))))&(incident_c(esk9_3(X7,X8,X9),X7)|(incident_c(esk9_3(X7,X8,X9),X8)|incident_c(esk9_3(X7,X8,X9),X9))))|X7=sum(X8,X9))),inference(skolemize,[status(esa)],[78])).
% fof(80, plain,![X7]:![X8]:![X9]:![X10]:((((~(incident_c(X10,X7))|(incident_c(X10,X8)|incident_c(X10,X9)))&((~(incident_c(X10,X8))&~(incident_c(X10,X9)))|incident_c(X10,X7)))|~(X7=sum(X8,X9)))&(((~(incident_c(esk9_3(X7,X8,X9),X7))|(~(incident_c(esk9_3(X7,X8,X9),X8))&~(incident_c(esk9_3(X7,X8,X9),X9))))&(incident_c(esk9_3(X7,X8,X9),X7)|(incident_c(esk9_3(X7,X8,X9),X8)|incident_c(esk9_3(X7,X8,X9),X9))))|X7=sum(X8,X9))),inference(shift_quantors,[status(thm)],[79])).
% fof(81, plain,![X7]:![X8]:![X9]:![X10]:((((~(incident_c(X10,X7))|(incident_c(X10,X8)|incident_c(X10,X9)))|~(X7=sum(X8,X9)))&(((~(incident_c(X10,X8))|incident_c(X10,X7))|~(X7=sum(X8,X9)))&((~(incident_c(X10,X9))|incident_c(X10,X7))|~(X7=sum(X8,X9)))))&((((~(incident_c(esk9_3(X7,X8,X9),X8))|~(incident_c(esk9_3(X7,X8,X9),X7)))|X7=sum(X8,X9))&((~(incident_c(esk9_3(X7,X8,X9),X9))|~(incident_c(esk9_3(X7,X8,X9),X7)))|X7=sum(X8,X9)))&((incident_c(esk9_3(X7,X8,X9),X7)|(incident_c(esk9_3(X7,X8,X9),X8)|incident_c(esk9_3(X7,X8,X9),X9)))|X7=sum(X8,X9)))),inference(distribute,[status(thm)],[80])).
% cnf(87,plain,(incident_c(X4,X3)|incident_c(X4,X2)|X1!=sum(X2,X3)|~incident_c(X4,X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(122, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((((open(X1)&part_of(X2,X1))&part_of(X3,X1))&meet(X4,X2,X3))&~(open(sum(X2,X3)))),inference(fof_nnf,[status(thm)],[18])).
% fof(123, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((((open(X5)&part_of(X6,X5))&part_of(X7,X5))&meet(X8,X6,X7))&~(open(sum(X6,X7)))),inference(variable_rename,[status(thm)],[122])).
% fof(124, negated_conjecture,((((open(esk14_0)&part_of(esk15_0,esk14_0))&part_of(esk16_0,esk14_0))&meet(esk17_0,esk15_0,esk16_0))&~(open(sum(esk15_0,esk16_0)))),inference(skolemize,[status(esa)],[123])).
% cnf(125,negated_conjecture,(~open(sum(esk15_0,esk16_0))),inference(split_conjunct,[status(thm)],[124])).
% cnf(126,negated_conjecture,(meet(esk17_0,esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(127,negated_conjecture,(part_of(esk16_0,esk14_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(128,negated_conjecture,(part_of(esk15_0,esk14_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(129,negated_conjecture,(open(esk14_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(135,negated_conjecture,(end_point(esk2_1(esk14_0),esk14_0)),inference(spm,[status(thm)],[32,129,theory(equality)])).
% cnf(136,plain,(open(X1)|closed(X1)),inference(spm,[status(thm)],[33,56,theory(equality)])).
% cnf(140,negated_conjecture,(sum(esk15_0,esk16_0)=esk1_2(esk15_0,esk16_0)),inference(spm,[status(thm)],[27,126,theory(equality)])).
% cnf(143,plain,(X1=X2|open(X1)|incident_c(esk3_2(X2,X1),X1)),inference(spm,[status(thm)],[22,44,theory(equality)])).
% cnf(148,negated_conjecture,(incident_c(X1,esk14_0)|~incident_c(X1,esk16_0)),inference(spm,[status(thm)],[45,127,theory(equality)])).
% cnf(149,negated_conjecture,(incident_c(X1,esk14_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[45,128,theory(equality)])).
% cnf(172,plain,(incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X3,X2))),inference(er,[status(thm)],[87,theory(equality)])).
% cnf(268,negated_conjecture,(~open(esk1_2(esk15_0,esk16_0))),inference(rw,[status(thm)],[125,140,theory(equality)])).
% cnf(288,negated_conjecture,(closed(esk1_2(esk15_0,esk16_0))),inference(spm,[status(thm)],[268,136,theory(equality)])).
% cnf(292,negated_conjecture,(~closed(esk14_0)),inference(spm,[status(thm)],[57,135,theory(equality)])).
% cnf(1459,negated_conjecture,(incident_c(X1,esk15_0)|incident_c(X1,esk16_0)|~incident_c(X1,esk1_2(esk15_0,esk16_0))),inference(spm,[status(thm)],[172,140,theory(equality)])).
% cnf(2991,negated_conjecture,(incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk16_0)|incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk15_0)|esk1_2(esk15_0,esk16_0)=X1|open(esk1_2(esk15_0,esk16_0))),inference(spm,[status(thm)],[1459,143,theory(equality)])).
% cnf(3026,negated_conjecture,(incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk16_0)|incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk15_0)|esk1_2(esk15_0,esk16_0)=X1),inference(sr,[status(thm)],[2991,268,theory(equality)])).
% cnf(3352,negated_conjecture,(incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk14_0)|esk1_2(esk15_0,esk16_0)=X1|incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk15_0)),inference(spm,[status(thm)],[148,3026,theory(equality)])).
% cnf(3662,negated_conjecture,(esk1_2(esk15_0,esk16_0)=X1|incident_c(esk3_2(X1,esk1_2(esk15_0,esk16_0)),esk14_0)),inference(csr,[status(thm)],[3352,149])).
% cnf(3671,negated_conjecture,(part_of(esk1_2(esk15_0,esk16_0),esk14_0)|esk1_2(esk15_0,esk16_0)=esk14_0),inference(spm,[status(thm)],[43,3662,theory(equality)])).
% cnf(3675,negated_conjecture,(esk1_2(esk15_0,esk16_0)=esk14_0|open(esk1_2(esk15_0,esk16_0))),inference(spm,[status(thm)],[22,3671,theory(equality)])).
% cnf(3678,negated_conjecture,(esk1_2(esk15_0,esk16_0)=esk14_0),inference(sr,[status(thm)],[3675,268,theory(equality)])).
% cnf(3716,negated_conjecture,(closed(esk14_0)),inference(rw,[status(thm)],[288,3678,theory(equality)])).
% cnf(3717,negated_conjecture,($false),inference(sr,[status(thm)],[3716,292,theory(equality)])).
% cnf(3718,negated_conjecture,($false),3717,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 401
% # ...of these trivial : 3
% # ...subsumed : 57
% # ...remaining for further processing: 341
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 27
% # Backward-rewritten : 30
% # Generated clauses : 3111
% # ...of the previous two non-trivial : 2842
% # Contextual simplify-reflections : 37
% # Paramodulations : 3058
% # Factorizations : 36
% # Equation resolutions : 15
% # Current number of processed clauses: 234
% # Positive orientable unit clauses: 37
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 190
% # Current number of unprocessed clauses: 2154
% # ...number of literals in the above : 10595
% # Clause-clause subsumption calls (NU) : 1180
% # Rec. Clause-clause subsumption calls : 880
% # Unit Clause-clause subsumption calls : 132
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 238 leaves, 1.47+/-1.256 terms/leaf
% # Paramod-from index: 120 leaves, 1.22+/-0.608 terms/leaf
% # Paramod-into index: 188 leaves, 1.35+/-0.872 terms/leaf
% # -------------------------------------------------
% # User time : 0.152 s
% # System time : 0.006 s
% # Total time : 0.158 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.29 CPU 0.37 WC
% FINAL PrfWatch: 0.29 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP1101/GEO093+1.tptp
%
%------------------------------------------------------------------------------