TSTP Solution File: PRO011+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO011+1 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 21:10:43 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP13812/PRO011+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13812/PRO011+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13812/PRO011+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 13908
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,~(atomic(tptp0)),file('/tmp/SRASS.s.p', sos_37)).
% fof(9, axiom,![X24]:(occurrence_of(X24,tptp0)=>?[X25]:?[X26]:?[X27]:((((((occurrence_of(X25,tptp3)&root_occ(X25,X24))&occurrence_of(X26,tptp4))&next_subocc(X25,X26,tptp0))&(occurrence_of(X27,tptp1)|occurrence_of(X27,tptp2)))&next_subocc(X26,X27,tptp0))&leaf_occ(X27,X24))),file('/tmp/SRASS.s.p', sos_35)).
% fof(19, axiom,![X48]:![X49]:![X50]:((occurrence_of(X48,X49)&occurrence_of(X48,X50))=>X49=X50),file('/tmp/SRASS.s.p', sos_02)).
% fof(35, axiom,![X82]:![X83]:![X84]:(min_precedes(X83,X84,X82)=>?[X85]:?[X86]:(((subactivity(X85,X82)&subactivity(X86,X82))&atocc(X83,X85))&atocc(X84,X86))),file('/tmp/SRASS.s.p', sos_11)).
% fof(44, axiom,![X98]:![X99]:(atocc(X98,X99)<=>?[X100]:((subactivity(X99,X100)&atomic(X100))&occurrence_of(X98,X100))),file('/tmp/SRASS.s.p', sos_23)).
% fof(49, conjecture,![X110]:(occurrence_of(X110,tptp0)=>?[X111]:?[X112]:((leaf_occ(X112,X110)&(occurrence_of(X112,tptp1)=>~(?[X113]:((occurrence_of(X113,tptp2)&subactivity_occurrence(X113,X110))&min_precedes(X111,X113,tptp0)))))&(occurrence_of(X112,tptp2)=>~(?[X114]:((occurrence_of(X114,tptp1)&subactivity_occurrence(X114,X110))&min_precedes(X111,X114,tptp0)))))),file('/tmp/SRASS.s.p', goals)).
% fof(50, negated_conjecture,~(![X110]:(occurrence_of(X110,tptp0)=>?[X111]:?[X112]:((leaf_occ(X112,X110)&(occurrence_of(X112,tptp1)=>~(?[X113]:((occurrence_of(X113,tptp2)&subactivity_occurrence(X113,X110))&min_precedes(X111,X113,tptp0)))))&(occurrence_of(X112,tptp2)=>~(?[X114]:((occurrence_of(X114,tptp1)&subactivity_occurrence(X114,X110))&min_precedes(X111,X114,tptp0))))))),inference(assume_negation,[status(cth)],[49])).
% fof(52, plain,~(atomic(tptp0)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% cnf(91,plain,(~atomic(tptp0)),inference(split_conjunct,[status(thm)],[52])).
% fof(92, plain,![X24]:(~(occurrence_of(X24,tptp0))|?[X25]:?[X26]:?[X27]:((((((occurrence_of(X25,tptp3)&root_occ(X25,X24))&occurrence_of(X26,tptp4))&next_subocc(X25,X26,tptp0))&(occurrence_of(X27,tptp1)|occurrence_of(X27,tptp2)))&next_subocc(X26,X27,tptp0))&leaf_occ(X27,X24))),inference(fof_nnf,[status(thm)],[9])).
% fof(93, plain,![X28]:(~(occurrence_of(X28,tptp0))|?[X29]:?[X30]:?[X31]:((((((occurrence_of(X29,tptp3)&root_occ(X29,X28))&occurrence_of(X30,tptp4))&next_subocc(X29,X30,tptp0))&(occurrence_of(X31,tptp1)|occurrence_of(X31,tptp2)))&next_subocc(X30,X31,tptp0))&leaf_occ(X31,X28))),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,![X28]:(~(occurrence_of(X28,tptp0))|((((((occurrence_of(esk4_1(X28),tptp3)&root_occ(esk4_1(X28),X28))&occurrence_of(esk5_1(X28),tptp4))&next_subocc(esk4_1(X28),esk5_1(X28),tptp0))&(occurrence_of(esk6_1(X28),tptp1)|occurrence_of(esk6_1(X28),tptp2)))&next_subocc(esk5_1(X28),esk6_1(X28),tptp0))&leaf_occ(esk6_1(X28),X28))),inference(skolemize,[status(esa)],[93])).
% fof(95, plain,![X28]:(((((((occurrence_of(esk4_1(X28),tptp3)|~(occurrence_of(X28,tptp0)))&(root_occ(esk4_1(X28),X28)|~(occurrence_of(X28,tptp0))))&(occurrence_of(esk5_1(X28),tptp4)|~(occurrence_of(X28,tptp0))))&(next_subocc(esk4_1(X28),esk5_1(X28),tptp0)|~(occurrence_of(X28,tptp0))))&((occurrence_of(esk6_1(X28),tptp1)|occurrence_of(esk6_1(X28),tptp2))|~(occurrence_of(X28,tptp0))))&(next_subocc(esk5_1(X28),esk6_1(X28),tptp0)|~(occurrence_of(X28,tptp0))))&(leaf_occ(esk6_1(X28),X28)|~(occurrence_of(X28,tptp0)))),inference(distribute,[status(thm)],[94])).
% cnf(96,plain,(leaf_occ(esk6_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[95])).
% fof(133, plain,![X48]:![X49]:![X50]:((~(occurrence_of(X48,X49))|~(occurrence_of(X48,X50)))|X49=X50),inference(fof_nnf,[status(thm)],[19])).
% fof(134, plain,![X51]:![X52]:![X53]:((~(occurrence_of(X51,X52))|~(occurrence_of(X51,X53)))|X52=X53),inference(variable_rename,[status(thm)],[133])).
% cnf(135,plain,(X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(193, plain,![X82]:![X83]:![X84]:(~(min_precedes(X83,X84,X82))|?[X85]:?[X86]:(((subactivity(X85,X82)&subactivity(X86,X82))&atocc(X83,X85))&atocc(X84,X86))),inference(fof_nnf,[status(thm)],[35])).
% fof(194, plain,![X87]:![X88]:![X89]:(~(min_precedes(X88,X89,X87))|?[X90]:?[X91]:(((subactivity(X90,X87)&subactivity(X91,X87))&atocc(X88,X90))&atocc(X89,X91))),inference(variable_rename,[status(thm)],[193])).
% fof(195, plain,![X87]:![X88]:![X89]:(~(min_precedes(X88,X89,X87))|(((subactivity(esk14_3(X87,X88,X89),X87)&subactivity(esk15_3(X87,X88,X89),X87))&atocc(X88,esk14_3(X87,X88,X89)))&atocc(X89,esk15_3(X87,X88,X89)))),inference(skolemize,[status(esa)],[194])).
% fof(196, plain,![X87]:![X88]:![X89]:((((subactivity(esk14_3(X87,X88,X89),X87)|~(min_precedes(X88,X89,X87)))&(subactivity(esk15_3(X87,X88,X89),X87)|~(min_precedes(X88,X89,X87))))&(atocc(X88,esk14_3(X87,X88,X89))|~(min_precedes(X88,X89,X87))))&(atocc(X89,esk15_3(X87,X88,X89))|~(min_precedes(X88,X89,X87)))),inference(distribute,[status(thm)],[195])).
% cnf(198,plain,(atocc(X1,esk14_3(X3,X1,X2))|~min_precedes(X1,X2,X3)),inference(split_conjunct,[status(thm)],[196])).
% fof(226, plain,![X98]:![X99]:((~(atocc(X98,X99))|?[X100]:((subactivity(X99,X100)&atomic(X100))&occurrence_of(X98,X100)))&(![X100]:((~(subactivity(X99,X100))|~(atomic(X100)))|~(occurrence_of(X98,X100)))|atocc(X98,X99))),inference(fof_nnf,[status(thm)],[44])).
% fof(227, plain,![X101]:![X102]:((~(atocc(X101,X102))|?[X103]:((subactivity(X102,X103)&atomic(X103))&occurrence_of(X101,X103)))&(![X104]:((~(subactivity(X102,X104))|~(atomic(X104)))|~(occurrence_of(X101,X104)))|atocc(X101,X102))),inference(variable_rename,[status(thm)],[226])).
% fof(228, plain,![X101]:![X102]:((~(atocc(X101,X102))|((subactivity(X102,esk17_2(X101,X102))&atomic(esk17_2(X101,X102)))&occurrence_of(X101,esk17_2(X101,X102))))&(![X104]:((~(subactivity(X102,X104))|~(atomic(X104)))|~(occurrence_of(X101,X104)))|atocc(X101,X102))),inference(skolemize,[status(esa)],[227])).
% fof(229, plain,![X101]:![X102]:![X104]:((((~(subactivity(X102,X104))|~(atomic(X104)))|~(occurrence_of(X101,X104)))|atocc(X101,X102))&(~(atocc(X101,X102))|((subactivity(X102,esk17_2(X101,X102))&atomic(esk17_2(X101,X102)))&occurrence_of(X101,esk17_2(X101,X102))))),inference(shift_quantors,[status(thm)],[228])).
% fof(230, plain,![X101]:![X102]:![X104]:((((~(subactivity(X102,X104))|~(atomic(X104)))|~(occurrence_of(X101,X104)))|atocc(X101,X102))&(((subactivity(X102,esk17_2(X101,X102))|~(atocc(X101,X102)))&(atomic(esk17_2(X101,X102))|~(atocc(X101,X102))))&(occurrence_of(X101,esk17_2(X101,X102))|~(atocc(X101,X102))))),inference(distribute,[status(thm)],[229])).
% cnf(231,plain,(occurrence_of(X1,esk17_2(X1,X2))|~atocc(X1,X2)),inference(split_conjunct,[status(thm)],[230])).
% cnf(232,plain,(atomic(esk17_2(X1,X2))|~atocc(X1,X2)),inference(split_conjunct,[status(thm)],[230])).
% fof(253, negated_conjecture,?[X110]:(occurrence_of(X110,tptp0)&![X111]:![X112]:((~(leaf_occ(X112,X110))|(occurrence_of(X112,tptp1)&?[X113]:((occurrence_of(X113,tptp2)&subactivity_occurrence(X113,X110))&min_precedes(X111,X113,tptp0))))|(occurrence_of(X112,tptp2)&?[X114]:((occurrence_of(X114,tptp1)&subactivity_occurrence(X114,X110))&min_precedes(X111,X114,tptp0))))),inference(fof_nnf,[status(thm)],[50])).
% fof(254, negated_conjecture,?[X115]:(occurrence_of(X115,tptp0)&![X116]:![X117]:((~(leaf_occ(X117,X115))|(occurrence_of(X117,tptp1)&?[X118]:((occurrence_of(X118,tptp2)&subactivity_occurrence(X118,X115))&min_precedes(X116,X118,tptp0))))|(occurrence_of(X117,tptp2)&?[X119]:((occurrence_of(X119,tptp1)&subactivity_occurrence(X119,X115))&min_precedes(X116,X119,tptp0))))),inference(variable_rename,[status(thm)],[253])).
% fof(255, negated_conjecture,(occurrence_of(esk19_0,tptp0)&![X116]:![X117]:((~(leaf_occ(X117,esk19_0))|(occurrence_of(X117,tptp1)&((occurrence_of(esk20_2(X116,X117),tptp2)&subactivity_occurrence(esk20_2(X116,X117),esk19_0))&min_precedes(X116,esk20_2(X116,X117),tptp0))))|(occurrence_of(X117,tptp2)&((occurrence_of(esk21_2(X116,X117),tptp1)&subactivity_occurrence(esk21_2(X116,X117),esk19_0))&min_precedes(X116,esk21_2(X116,X117),tptp0))))),inference(skolemize,[status(esa)],[254])).
% fof(256, negated_conjecture,![X116]:![X117]:(((~(leaf_occ(X117,esk19_0))|(occurrence_of(X117,tptp1)&((occurrence_of(esk20_2(X116,X117),tptp2)&subactivity_occurrence(esk20_2(X116,X117),esk19_0))&min_precedes(X116,esk20_2(X116,X117),tptp0))))|(occurrence_of(X117,tptp2)&((occurrence_of(esk21_2(X116,X117),tptp1)&subactivity_occurrence(esk21_2(X116,X117),esk19_0))&min_precedes(X116,esk21_2(X116,X117),tptp0))))&occurrence_of(esk19_0,tptp0)),inference(shift_quantors,[status(thm)],[255])).
% fof(257, negated_conjecture,![X116]:![X117]:((((occurrence_of(X117,tptp2)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0))))&(((occurrence_of(esk21_2(X116,X117),tptp1)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0))))&(subactivity_occurrence(esk21_2(X116,X117),esk19_0)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0)))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0))))))&((((occurrence_of(X117,tptp2)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0))))&(((occurrence_of(esk21_2(X116,X117),tptp1)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0))))&(subactivity_occurrence(esk21_2(X116,X117),esk19_0)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0)))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0))))))&((occurrence_of(X117,tptp2)|(subactivity_occurrence(esk20_2(X116,X117),esk19_0)|~(leaf_occ(X117,esk19_0))))&(((occurrence_of(esk21_2(X116,X117),tptp1)|(subactivity_occurrence(esk20_2(X116,X117),esk19_0)|~(leaf_occ(X117,esk19_0))))&(subactivity_occurrence(esk21_2(X116,X117),esk19_0)|(subactivity_occurrence(esk20_2(X116,X117),esk19_0)|~(leaf_occ(X117,esk19_0)))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(subactivity_occurrence(esk20_2(X116,X117),esk19_0)|~(leaf_occ(X117,esk19_0)))))))&((occurrence_of(X117,tptp2)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0))))&(((occurrence_of(esk21_2(X116,X117),tptp1)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0))))&(subactivity_occurrence(esk21_2(X116,X117),esk19_0)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0)))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0))))))))&occurrence_of(esk19_0,tptp0)),inference(distribute,[status(thm)],[256])).
% cnf(258,negated_conjecture,(occurrence_of(esk19_0,tptp0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(259,negated_conjecture,(min_precedes(X2,esk20_2(X2,X1),tptp0)|min_precedes(X2,esk21_2(X2,X1),tptp0)|~leaf_occ(X1,esk19_0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(275,negated_conjecture,(X1=tptp0|~occurrence_of(esk19_0,X1)),inference(spm,[status(thm)],[135,258,theory(equality)])).
% cnf(525,negated_conjecture,(esk17_2(esk19_0,X1)=tptp0|~atocc(esk19_0,X1)),inference(spm,[status(thm)],[275,231,theory(equality)])).
% cnf(650,negated_conjecture,(atomic(tptp0)|~atocc(esk19_0,X1)),inference(spm,[status(thm)],[232,525,theory(equality)])).
% cnf(653,negated_conjecture,(~atocc(esk19_0,X1)),inference(sr,[status(thm)],[650,91,theory(equality)])).
% cnf(657,negated_conjecture,(~min_precedes(esk19_0,X2,X1)),inference(spm,[status(thm)],[653,198,theory(equality)])).
% cnf(669,negated_conjecture,(min_precedes(esk19_0,esk21_2(esk19_0,X1),tptp0)|~leaf_occ(X1,esk19_0)),inference(spm,[status(thm)],[657,259,theory(equality)])).
% cnf(672,negated_conjecture,(~leaf_occ(X1,esk19_0)),inference(sr,[status(thm)],[669,657,theory(equality)])).
% cnf(673,negated_conjecture,(~occurrence_of(esk19_0,tptp0)),inference(spm,[status(thm)],[672,96,theory(equality)])).
% cnf(674,negated_conjecture,($false),inference(rw,[status(thm)],[673,258,theory(equality)])).
% cnf(675,negated_conjecture,($false),inference(cn,[status(thm)],[674,theory(equality)])).
% cnf(676,negated_conjecture,($false),675,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 146
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 133
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 343
% # ...of the previous two non-trivial : 315
% # Contextual simplify-reflections : 1
% # Paramodulations : 343
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 133
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 13
% # Non-unit-clauses : 111
% # Current number of unprocessed clauses: 271
% # ...number of literals in the above : 978
% # Clause-clause subsumption calls (NU) : 222
% # Rec. Clause-clause subsumption calls : 180
% # Unit Clause-clause subsumption calls : 25
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 116 leaves, 1.59+/-1.427 terms/leaf
% # Paramod-from index: 59 leaves, 1.05+/-0.220 terms/leaf
% # Paramod-into index: 108 leaves, 1.37+/-0.929 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.004 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP13812/PRO011+1.tptp
%
%------------------------------------------------------------------------------