TSTP Solution File: GEO084+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO084+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 : art01.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:20:25 EST 2010
% Result : Theorem 1.27s
% Output : Solution 1.27s
% 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/SystemOnTPTP5677/GEO084+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5677/GEO084+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5677/GEO084+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 5773
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(?[X3]:meet(X3,X1,X2)=>?[X4]:X4=sum(X1,X2)),file('/tmp/SRASS.s.p', c8)).
% fof(3, axiom,![X4]:![X1]:(part_of(X1,X4)<=>![X3]:(incident_c(X3,X1)=>incident_c(X3,X4))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(10, axiom,![X4]:![X1]:![X2]:(X4=sum(X1,X2)<=>![X6]:(incident_c(X6,X4)<=>(incident_c(X6,X1)|incident_c(X6,X2)))),file('/tmp/SRASS.s.p', sum_defn)).
% fof(17, conjecture,![X1]:![X2]:![X5]:![X3]:(((part_of(X1,X5)&part_of(X2,X5))&meet(X3,X1,X2))=>part_of(sum(X1,X2),X5)),file('/tmp/SRASS.s.p', corollary_2_6_2)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X5]:![X3]:(((part_of(X1,X5)&part_of(X2,X5))&meet(X3,X1,X2))=>part_of(sum(X1,X2),X5))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X1]:![X2]:(![X3]:~(meet(X3,X1,X2))|?[X4]:X4=sum(X1,X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X5]:![X6]:(![X7]:~(meet(X7,X5,X6))|?[X8]:X8=sum(X5,X6)),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X5]:![X6]:(![X7]:~(meet(X7,X5,X6))|esk1_2(X5,X6)=sum(X5,X6)),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X5]:![X6]:![X7]:(~(meet(X7,X5,X6))|esk1_2(X5,X6)=sum(X5,X6)),inference(shift_quantors,[status(thm)],[22])).
% cnf(24,plain,(esk1_2(X1,X2)=sum(X1,X2)|~meet(X3,X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(29, plain,![X4]:![X1]:((~(part_of(X1,X4))|![X3]:(~(incident_c(X3,X1))|incident_c(X3,X4)))&(?[X3]:(incident_c(X3,X1)&~(incident_c(X3,X4)))|part_of(X1,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(30, 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)],[29])).
% fof(31, plain,![X5]:![X6]:((~(part_of(X6,X5))|![X7]:(~(incident_c(X7,X6))|incident_c(X7,X5)))&((incident_c(esk2_2(X5,X6),X6)&~(incident_c(esk2_2(X5,X6),X5)))|part_of(X6,X5))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:(((~(incident_c(X7,X6))|incident_c(X7,X5))|~(part_of(X6,X5)))&((incident_c(esk2_2(X5,X6),X6)&~(incident_c(esk2_2(X5,X6),X5)))|part_of(X6,X5))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X5]:![X6]:![X7]:(((~(incident_c(X7,X6))|incident_c(X7,X5))|~(part_of(X6,X5)))&((incident_c(esk2_2(X5,X6),X6)|part_of(X6,X5))&(~(incident_c(esk2_2(X5,X6),X5))|part_of(X6,X5)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(part_of(X1,X2)|~incident_c(esk2_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(part_of(X1,X2)|incident_c(esk2_2(X2,X1),X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(71, plain,![X4]:![X1]:![X2]:((~(X4=sum(X1,X2))|![X6]:((~(incident_c(X6,X4))|(incident_c(X6,X1)|incident_c(X6,X2)))&((~(incident_c(X6,X1))&~(incident_c(X6,X2)))|incident_c(X6,X4))))&(?[X6]:((~(incident_c(X6,X4))|(~(incident_c(X6,X1))&~(incident_c(X6,X2))))&(incident_c(X6,X4)|(incident_c(X6,X1)|incident_c(X6,X2))))|X4=sum(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(72, 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)],[71])).
% fof(73, 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(esk8_3(X7,X8,X9),X7))|(~(incident_c(esk8_3(X7,X8,X9),X8))&~(incident_c(esk8_3(X7,X8,X9),X9))))&(incident_c(esk8_3(X7,X8,X9),X7)|(incident_c(esk8_3(X7,X8,X9),X8)|incident_c(esk8_3(X7,X8,X9),X9))))|X7=sum(X8,X9))),inference(skolemize,[status(esa)],[72])).
% fof(74, 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(esk8_3(X7,X8,X9),X7))|(~(incident_c(esk8_3(X7,X8,X9),X8))&~(incident_c(esk8_3(X7,X8,X9),X9))))&(incident_c(esk8_3(X7,X8,X9),X7)|(incident_c(esk8_3(X7,X8,X9),X8)|incident_c(esk8_3(X7,X8,X9),X9))))|X7=sum(X8,X9))),inference(shift_quantors,[status(thm)],[73])).
% fof(75, 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(esk8_3(X7,X8,X9),X8))|~(incident_c(esk8_3(X7,X8,X9),X7)))|X7=sum(X8,X9))&((~(incident_c(esk8_3(X7,X8,X9),X9))|~(incident_c(esk8_3(X7,X8,X9),X7)))|X7=sum(X8,X9)))&((incident_c(esk8_3(X7,X8,X9),X7)|(incident_c(esk8_3(X7,X8,X9),X8)|incident_c(esk8_3(X7,X8,X9),X9)))|X7=sum(X8,X9)))),inference(distribute,[status(thm)],[74])).
% cnf(81,plain,(incident_c(X4,X3)|incident_c(X4,X2)|X1!=sum(X2,X3)|~incident_c(X4,X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(122, negated_conjecture,?[X1]:?[X2]:?[X5]:?[X3]:(((part_of(X1,X5)&part_of(X2,X5))&meet(X3,X1,X2))&~(part_of(sum(X1,X2),X5))),inference(fof_nnf,[status(thm)],[18])).
% fof(123, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((part_of(X6,X8)&part_of(X7,X8))&meet(X9,X6,X7))&~(part_of(sum(X6,X7),X8))),inference(variable_rename,[status(thm)],[122])).
% fof(124, negated_conjecture,(((part_of(esk14_0,esk16_0)&part_of(esk15_0,esk16_0))&meet(esk17_0,esk14_0,esk15_0))&~(part_of(sum(esk14_0,esk15_0),esk16_0))),inference(skolemize,[status(esa)],[123])).
% cnf(125,negated_conjecture,(~part_of(sum(esk14_0,esk15_0),esk16_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(126,negated_conjecture,(meet(esk17_0,esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(127,negated_conjecture,(part_of(esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(128,negated_conjecture,(part_of(esk14_0,esk16_0)),inference(split_conjunct,[status(thm)],[124])).
% cnf(142,negated_conjecture,(sum(esk14_0,esk15_0)=esk1_2(esk14_0,esk15_0)),inference(spm,[status(thm)],[24,126,theory(equality)])).
% cnf(149,negated_conjecture,(incident_c(X1,esk16_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[36,127,theory(equality)])).
% cnf(150,negated_conjecture,(incident_c(X1,esk16_0)|~incident_c(X1,esk14_0)),inference(spm,[status(thm)],[36,128,theory(equality)])).
% cnf(174,plain,(incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X3,X2))),inference(er,[status(thm)],[81,theory(equality)])).
% cnf(268,negated_conjecture,(~part_of(esk1_2(esk14_0,esk15_0),esk16_0)),inference(rw,[status(thm)],[125,142,theory(equality)])).
% cnf(269,negated_conjecture,(incident_c(esk2_2(esk16_0,esk1_2(esk14_0,esk15_0)),esk1_2(esk14_0,esk15_0))),inference(spm,[status(thm)],[268,35,theory(equality)])).
% cnf(1885,negated_conjecture,(incident_c(X1,esk14_0)|incident_c(X1,esk15_0)|~incident_c(X1,esk1_2(esk14_0,esk15_0))),inference(spm,[status(thm)],[174,142,theory(equality)])).
% cnf(3651,negated_conjecture,(incident_c(esk2_2(esk16_0,esk1_2(esk14_0,esk15_0)),esk15_0)|incident_c(esk2_2(esk16_0,esk1_2(esk14_0,esk15_0)),esk14_0)),inference(spm,[status(thm)],[1885,269,theory(equality)])).
% cnf(3714,negated_conjecture,(incident_c(esk2_2(esk16_0,esk1_2(esk14_0,esk15_0)),esk16_0)|incident_c(esk2_2(esk16_0,esk1_2(esk14_0,esk15_0)),esk15_0)),inference(spm,[status(thm)],[150,3651,theory(equality)])).
% cnf(3720,negated_conjecture,(incident_c(esk2_2(esk16_0,esk1_2(esk14_0,esk15_0)),esk16_0)),inference(csr,[status(thm)],[3714,149])).
% cnf(3728,negated_conjecture,(part_of(esk1_2(esk14_0,esk15_0),esk16_0)),inference(spm,[status(thm)],[34,3720,theory(equality)])).
% cnf(3734,negated_conjecture,($false),inference(sr,[status(thm)],[3728,268,theory(equality)])).
% cnf(3735,negated_conjecture,($false),3734,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 344
% # ...of these trivial : 2
% # ...subsumed : 37
% # ...remaining for further processing: 305
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 9
% # Generated clauses : 3159
% # ...of the previous two non-trivial : 2862
% # Contextual simplify-reflections : 32
% # Paramodulations : 3094
% # Factorizations : 48
% # Equation resolutions : 15
% # Current number of processed clauses: 241
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 205
% # Current number of unprocessed clauses: 2392
% # ...number of literals in the above : 11955
% # Clause-clause subsumption calls (NU) : 1238
% # Rec. Clause-clause subsumption calls : 958
% # Unit Clause-clause subsumption calls : 137
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 25
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 242 leaves, 1.48+/-1.234 terms/leaf
% # Paramod-from index: 117 leaves, 1.27+/-0.649 terms/leaf
% # Paramod-into index: 191 leaves, 1.40+/-0.897 terms/leaf
% # -------------------------------------------------
% # User time : 0.155 s
% # System time : 0.008 s
% # Total time : 0.163 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.41 WC
% FINAL PrfWatch: 0.32 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP5677/GEO084+1.tptp
%
%------------------------------------------------------------------------------