TSTP Solution File: COM008+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM008+1 : TPTP v5.0.0. Released v3.2.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 : Tue Dec 28 22:38:17 EST 2010
% Result : Theorem 2.74s
% Output : Solution 2.74s
% 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/SystemOnTPTP5223/COM008+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5223/COM008+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5223/COM008+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 5319
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.91 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:((transitive_reflexive_rewrite(X1,X2)&transitive_reflexive_rewrite(X2,X3))=>transitive_reflexive_rewrite(X1,X3)),file('/tmp/SRASS.s.p', transitivity_of_transitive_reflexive_rewrite)).
% fof(2, axiom,(transitive_reflexive_rewrite(a,b)&transitive_reflexive_rewrite(a,c)),file('/tmp/SRASS.s.p', assumption)).
% fof(3, axiom,![X1]:((transitive_reflexive_rewrite(b,X1)&transitive_reflexive_rewrite(c,X1))=>goal),file('/tmp/SRASS.s.p', found)).
% fof(4, axiom,![X1]:equalish(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(5, axiom,![X1]:![X2]:(equalish(X1,X2)=>equalish(X2,X1)),file('/tmp/SRASS.s.p', symmetry)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((rewrite(a,X1)&transitive_reflexive_rewrite(X1,X2))&transitive_reflexive_rewrite(X1,X3))=>?[X4]:(transitive_reflexive_rewrite(X2,X4)&transitive_reflexive_rewrite(X3,X4))),file('/tmp/SRASS.s.p', ih_cfl)).
% fof(7, axiom,![X1]:![X2]:(transitive_reflexive_rewrite(X1,X2)=>(equalish(X1,X2)|?[X3]:(rewrite(X1,X3)&transitive_reflexive_rewrite(X3,X2)))),file('/tmp/SRASS.s.p', equalish_or_rewrite)).
% fof(8, axiom,![X1]:![X2]:(equalish(X1,X2)=>transitive_reflexive_rewrite(X1,X2)),file('/tmp/SRASS.s.p', equality_in_transitive_reflexive_rewrite)).
% fof(10, axiom,![X1]:![X2]:![X3]:((rewrite(X1,X2)&rewrite(X1,X3))=>?[X4]:(transitive_reflexive_rewrite(X2,X4)&transitive_reflexive_rewrite(X3,X4))),file('/tmp/SRASS.s.p', lo_cfl)).
% fof(11, conjecture,goal,file('/tmp/SRASS.s.p', goal_to_be_proved)).
% fof(12, negated_conjecture,~(goal),inference(assume_negation,[status(cth)],[11])).
% fof(13, negated_conjecture,~(goal),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(14, plain,![X1]:![X2]:![X3]:((~(transitive_reflexive_rewrite(X1,X2))|~(transitive_reflexive_rewrite(X2,X3)))|transitive_reflexive_rewrite(X1,X3)),inference(fof_nnf,[status(thm)],[1])).
% fof(15, plain,![X4]:![X5]:![X6]:((~(transitive_reflexive_rewrite(X4,X5))|~(transitive_reflexive_rewrite(X5,X6)))|transitive_reflexive_rewrite(X4,X6)),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X3,X2)|~transitive_reflexive_rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,plain,(transitive_reflexive_rewrite(a,c)),inference(split_conjunct,[status(thm)],[2])).
% cnf(18,plain,(transitive_reflexive_rewrite(a,b)),inference(split_conjunct,[status(thm)],[2])).
% fof(19, plain,![X1]:((~(transitive_reflexive_rewrite(b,X1))|~(transitive_reflexive_rewrite(c,X1)))|goal),inference(fof_nnf,[status(thm)],[3])).
% fof(20, plain,![X2]:((~(transitive_reflexive_rewrite(b,X2))|~(transitive_reflexive_rewrite(c,X2)))|goal),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(goal|~transitive_reflexive_rewrite(c,X1)|~transitive_reflexive_rewrite(b,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X2]:equalish(X2,X2),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(equalish(X1,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:(~(equalish(X1,X2))|equalish(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(25, plain,![X3]:![X4]:(~(equalish(X3,X4))|equalish(X4,X3)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(equalish(X1,X2)|~equalish(X2,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:(((~(rewrite(a,X1))|~(transitive_reflexive_rewrite(X1,X2)))|~(transitive_reflexive_rewrite(X1,X3)))|?[X4]:(transitive_reflexive_rewrite(X2,X4)&transitive_reflexive_rewrite(X3,X4))),inference(fof_nnf,[status(thm)],[6])).
% fof(28, plain,![X5]:![X6]:![X7]:(((~(rewrite(a,X5))|~(transitive_reflexive_rewrite(X5,X6)))|~(transitive_reflexive_rewrite(X5,X7)))|?[X8]:(transitive_reflexive_rewrite(X6,X8)&transitive_reflexive_rewrite(X7,X8))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X5]:![X6]:![X7]:(((~(rewrite(a,X5))|~(transitive_reflexive_rewrite(X5,X6)))|~(transitive_reflexive_rewrite(X5,X7)))|(transitive_reflexive_rewrite(X6,esk1_3(X5,X6,X7))&transitive_reflexive_rewrite(X7,esk1_3(X5,X6,X7)))),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X5]:![X6]:![X7]:((transitive_reflexive_rewrite(X6,esk1_3(X5,X6,X7))|((~(rewrite(a,X5))|~(transitive_reflexive_rewrite(X5,X6)))|~(transitive_reflexive_rewrite(X5,X7))))&(transitive_reflexive_rewrite(X7,esk1_3(X5,X6,X7))|((~(rewrite(a,X5))|~(transitive_reflexive_rewrite(X5,X6)))|~(transitive_reflexive_rewrite(X5,X7))))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(transitive_reflexive_rewrite(X2,esk1_3(X1,X3,X2))|~transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X1,X3)|~rewrite(a,X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(transitive_reflexive_rewrite(X3,esk1_3(X1,X3,X2))|~transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X1,X3)|~rewrite(a,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(33, plain,![X1]:![X2]:(~(transitive_reflexive_rewrite(X1,X2))|(equalish(X1,X2)|?[X3]:(rewrite(X1,X3)&transitive_reflexive_rewrite(X3,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(34, plain,![X4]:![X5]:(~(transitive_reflexive_rewrite(X4,X5))|(equalish(X4,X5)|?[X6]:(rewrite(X4,X6)&transitive_reflexive_rewrite(X6,X5)))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:(~(transitive_reflexive_rewrite(X4,X5))|(equalish(X4,X5)|(rewrite(X4,esk2_2(X4,X5))&transitive_reflexive_rewrite(esk2_2(X4,X5),X5)))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X4]:![X5]:(((rewrite(X4,esk2_2(X4,X5))|equalish(X4,X5))|~(transitive_reflexive_rewrite(X4,X5)))&((transitive_reflexive_rewrite(esk2_2(X4,X5),X5)|equalish(X4,X5))|~(transitive_reflexive_rewrite(X4,X5)))),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(equalish(X1,X2)|transitive_reflexive_rewrite(esk2_2(X1,X2),X2)|~transitive_reflexive_rewrite(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(equalish(X1,X2)|rewrite(X1,esk2_2(X1,X2))|~transitive_reflexive_rewrite(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(39, plain,![X1]:![X2]:(~(equalish(X1,X2))|transitive_reflexive_rewrite(X1,X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(40, plain,![X3]:![X4]:(~(equalish(X3,X4))|transitive_reflexive_rewrite(X3,X4)),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(transitive_reflexive_rewrite(X1,X2)|~equalish(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(45, plain,![X1]:![X2]:![X3]:((~(rewrite(X1,X2))|~(rewrite(X1,X3)))|?[X4]:(transitive_reflexive_rewrite(X2,X4)&transitive_reflexive_rewrite(X3,X4))),inference(fof_nnf,[status(thm)],[10])).
% fof(46, plain,![X5]:![X6]:![X7]:((~(rewrite(X5,X6))|~(rewrite(X5,X7)))|?[X8]:(transitive_reflexive_rewrite(X6,X8)&transitive_reflexive_rewrite(X7,X8))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X5]:![X6]:![X7]:((~(rewrite(X5,X6))|~(rewrite(X5,X7)))|(transitive_reflexive_rewrite(X6,esk3_3(X5,X6,X7))&transitive_reflexive_rewrite(X7,esk3_3(X5,X6,X7)))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X5]:![X6]:![X7]:((transitive_reflexive_rewrite(X6,esk3_3(X5,X6,X7))|(~(rewrite(X5,X6))|~(rewrite(X5,X7))))&(transitive_reflexive_rewrite(X7,esk3_3(X5,X6,X7))|(~(rewrite(X5,X6))|~(rewrite(X5,X7))))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(transitive_reflexive_rewrite(X2,esk3_3(X1,X3,X2))|~rewrite(X1,X2)|~rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(transitive_reflexive_rewrite(X3,esk3_3(X1,X3,X2))|~rewrite(X1,X2)|~rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,negated_conjecture,(~goal),inference(split_conjunct,[status(thm)],[13])).
% cnf(52,plain,(~transitive_reflexive_rewrite(b,X1)|~transitive_reflexive_rewrite(c,X1)),inference(sr,[status(thm)],[21,51,theory(equality)])).
% cnf(53,plain,(transitive_reflexive_rewrite(X1,X1)),inference(spm,[status(thm)],[41,23,theory(equality)])).
% cnf(56,plain,(transitive_reflexive_rewrite(X1,c)|~transitive_reflexive_rewrite(X1,a)),inference(spm,[status(thm)],[16,17,theory(equality)])).
% cnf(57,plain,(transitive_reflexive_rewrite(X1,b)|~transitive_reflexive_rewrite(X1,a)),inference(spm,[status(thm)],[16,18,theory(equality)])).
% cnf(65,plain,(transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X4))|~transitive_reflexive_rewrite(X1,X3)|~rewrite(a,X2)|~transitive_reflexive_rewrite(X2,X3)|~transitive_reflexive_rewrite(X2,X4)),inference(spm,[status(thm)],[16,32,theory(equality)])).
% cnf(66,plain,(~transitive_reflexive_rewrite(b,esk1_3(X1,X2,c))|~rewrite(a,X1)|~transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X1,c)),inference(spm,[status(thm)],[52,31,theory(equality)])).
% cnf(69,plain,(~transitive_reflexive_rewrite(b,c)),inference(spm,[status(thm)],[52,53,theory(equality)])).
% cnf(73,plain,(~transitive_reflexive_rewrite(b,b)|~transitive_reflexive_rewrite(c,a)),inference(spm,[status(thm)],[52,57,theory(equality)])).
% cnf(75,plain,($false|~transitive_reflexive_rewrite(c,a)),inference(rw,[status(thm)],[73,53,theory(equality)])).
% cnf(76,plain,(~transitive_reflexive_rewrite(c,a)),inference(cn,[status(thm)],[75,theory(equality)])).
% cnf(77,plain,(~transitive_reflexive_rewrite(b,a)),inference(spm,[status(thm)],[69,56,theory(equality)])).
% cnf(136,plain,(~rewrite(a,X1)|~transitive_reflexive_rewrite(X1,c)|~transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(b,X2)),inference(spm,[status(thm)],[66,65,theory(equality)])).
% cnf(137,plain,(equalish(a,X1)|~transitive_reflexive_rewrite(esk2_2(a,X1),c)|~transitive_reflexive_rewrite(b,X2)|~transitive_reflexive_rewrite(esk2_2(a,X1),X2)|~transitive_reflexive_rewrite(a,X1)),inference(spm,[status(thm)],[136,38,theory(equality)])).
% cnf(254,plain,(equalish(a,c)|~transitive_reflexive_rewrite(esk2_2(a,c),X1)|~transitive_reflexive_rewrite(b,X1)|~transitive_reflexive_rewrite(a,c)),inference(spm,[status(thm)],[137,37,theory(equality)])).
% cnf(257,plain,(equalish(a,c)|~transitive_reflexive_rewrite(esk2_2(a,c),X1)|~transitive_reflexive_rewrite(b,X1)|$false),inference(rw,[status(thm)],[254,17,theory(equality)])).
% cnf(258,plain,(equalish(a,c)|~transitive_reflexive_rewrite(esk2_2(a,c),X1)|~transitive_reflexive_rewrite(b,X1)),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(270,plain,(equalish(a,c)|~transitive_reflexive_rewrite(b,esk1_3(X1,X2,X3))|~rewrite(a,X1)|~transitive_reflexive_rewrite(esk2_2(a,c),X2)|~transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X1,X3)),inference(spm,[status(thm)],[258,65,theory(equality)])).
% cnf(606,plain,(equalish(a,c)|~rewrite(a,X1)|~transitive_reflexive_rewrite(esk2_2(a,c),X2)|~transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X1,b)),inference(spm,[status(thm)],[270,31,theory(equality)])).
% cnf(609,plain,(equalish(a,c)|~rewrite(a,X1)|~transitive_reflexive_rewrite(X1,b)|~transitive_reflexive_rewrite(X1,esk3_3(X2,esk2_2(a,c),X3))|~rewrite(X2,esk2_2(a,c))|~rewrite(X2,X3)),inference(spm,[status(thm)],[606,50,theory(equality)])).
% cnf(30035,plain,(equalish(a,c)|~rewrite(X1,esk2_2(a,c))|~rewrite(a,X2)|~rewrite(X1,X2)|~transitive_reflexive_rewrite(X2,b)),inference(spm,[status(thm)],[609,49,theory(equality)])).
% cnf(30089,plain,(equalish(a,c)|~rewrite(a,X1)|~transitive_reflexive_rewrite(X1,b)|~transitive_reflexive_rewrite(a,c)),inference(spm,[status(thm)],[30035,38,theory(equality)])).
% cnf(30090,plain,(equalish(a,c)|~rewrite(a,X1)|~transitive_reflexive_rewrite(X1,b)|$false),inference(rw,[status(thm)],[30089,17,theory(equality)])).
% cnf(30091,plain,(equalish(a,c)|~rewrite(a,X1)|~transitive_reflexive_rewrite(X1,b)),inference(cn,[status(thm)],[30090,theory(equality)])).
% cnf(30163,plain,(equalish(a,c)|equalish(a,X1)|~transitive_reflexive_rewrite(esk2_2(a,X1),b)|~transitive_reflexive_rewrite(a,X1)),inference(spm,[status(thm)],[30091,38,theory(equality)])).
% cnf(30171,plain,(equalish(a,c)|equalish(a,b)|~transitive_reflexive_rewrite(a,b)),inference(spm,[status(thm)],[30163,37,theory(equality)])).
% cnf(30193,plain,(equalish(a,c)|equalish(a,b)|$false),inference(rw,[status(thm)],[30171,18,theory(equality)])).
% cnf(30194,plain,(equalish(a,c)|equalish(a,b)),inference(cn,[status(thm)],[30193,theory(equality)])).
% cnf(30203,plain,(equalish(c,a)|equalish(a,b)),inference(spm,[status(thm)],[26,30194,theory(equality)])).
% cnf(30205,plain,(transitive_reflexive_rewrite(c,a)|equalish(a,b)),inference(spm,[status(thm)],[41,30203,theory(equality)])).
% cnf(30207,plain,(equalish(a,b)),inference(sr,[status(thm)],[30205,76,theory(equality)])).
% cnf(30209,plain,(equalish(b,a)),inference(spm,[status(thm)],[26,30207,theory(equality)])).
% cnf(30271,plain,(transitive_reflexive_rewrite(b,a)),inference(spm,[status(thm)],[41,30209,theory(equality)])).
% cnf(30273,plain,($false),inference(sr,[status(thm)],[30271,77,theory(equality)])).
% cnf(30274,plain,($false),30273,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2157
% # ...of these trivial : 0
% # ...subsumed : 1441
% # ...remaining for further processing: 716
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 51
% # Backward-rewritten : 60
% # Generated clauses : 21687
% # ...of the previous two non-trivial : 20226
% # Contextual simplify-reflections : 2525
% # Paramodulations : 21687
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 590
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 576
% # Current number of unprocessed clauses: 15692
% # ...number of literals in the above : 156813
% # Clause-clause subsumption calls (NU) : 113099
% # Rec. Clause-clause subsumption calls : 41350
% # Unit Clause-clause subsumption calls : 195
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 201 leaves, 2.71+/-3.644 terms/leaf
% # Paramod-from index: 82 leaves, 1.48+/-1.096 terms/leaf
% # Paramod-into index: 177 leaves, 2.11+/-2.684 terms/leaf
% # -------------------------------------------------
% # User time : 1.363 s
% # System time : 0.033 s
% # Total time : 1.396 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.94 CPU 2.04 WC
% FINAL PrfWatch: 1.94 CPU 2.04 WC
% SZS output end Solution for /tmp/SystemOnTPTP5223/COM008+1.tptp
%
%------------------------------------------------------------------------------