TSTP Solution File: GRP194+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP194+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 05:49:17 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP32222/GRP194+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32222/GRP194+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32222/GRP194+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 32318
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(group_member(X1,f)=>group_member(phi(X1),h)),file('/tmp/SRASS.s.p', homomorphism1)).
% fof(2, axiom,left_zero(f,f_left_zero),file('/tmp/SRASS.s.p', left_zero_for_f)).
% fof(3, axiom,![X1]:(group_member(X1,h)=>?[X2]:(group_member(X2,f)&phi(X2)=X1)),file('/tmp/SRASS.s.p', surjective)).
% fof(4, axiom,![X1]:![X2]:((group_member(X1,f)&group_member(X2,f))=>multiply(h,phi(X1),phi(X2))=phi(multiply(f,X1,X2))),file('/tmp/SRASS.s.p', homomorphism2)).
% fof(5, axiom,![X3]:![X1]:(left_zero(X3,X1)<=>(group_member(X1,X3)&![X2]:(group_member(X2,X3)=>multiply(X3,X1,X2)=X1))),file('/tmp/SRASS.s.p', left_zero)).
% fof(6, axiom,![X3]:![X1]:![X2]:((group_member(X1,X3)&group_member(X2,X3))=>group_member(multiply(X3,X1,X2),X3)),file('/tmp/SRASS.s.p', total_function)).
% fof(8, conjecture,left_zero(h,phi(f_left_zero)),file('/tmp/SRASS.s.p', prove_left_zero_h)).
% fof(9, negated_conjecture,~(left_zero(h,phi(f_left_zero))),inference(assume_negation,[status(cth)],[8])).
% fof(10, negated_conjecture,~(left_zero(h,phi(f_left_zero))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(11, plain,![X1]:(~(group_member(X1,f))|group_member(phi(X1),h)),inference(fof_nnf,[status(thm)],[1])).
% fof(12, plain,![X2]:(~(group_member(X2,f))|group_member(phi(X2),h)),inference(variable_rename,[status(thm)],[11])).
% cnf(13,plain,(group_member(phi(X1),h)|~group_member(X1,f)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(left_zero(f,f_left_zero)),inference(split_conjunct,[status(thm)],[2])).
% fof(15, plain,![X1]:(~(group_member(X1,h))|?[X2]:(group_member(X2,f)&phi(X2)=X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X3]:(~(group_member(X3,h))|?[X4]:(group_member(X4,f)&phi(X4)=X3)),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X3]:(~(group_member(X3,h))|(group_member(esk1_1(X3),f)&phi(esk1_1(X3))=X3)),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X3]:((group_member(esk1_1(X3),f)|~(group_member(X3,h)))&(phi(esk1_1(X3))=X3|~(group_member(X3,h)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(phi(esk1_1(X1))=X1|~group_member(X1,h)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(group_member(esk1_1(X1),f)|~group_member(X1,h)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X1]:![X2]:((~(group_member(X1,f))|~(group_member(X2,f)))|multiply(h,phi(X1),phi(X2))=phi(multiply(f,X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X3]:![X4]:((~(group_member(X3,f))|~(group_member(X4,f)))|multiply(h,phi(X3),phi(X4))=phi(multiply(f,X3,X4))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(multiply(h,phi(X1),phi(X2))=phi(multiply(f,X1,X2))|~group_member(X2,f)|~group_member(X1,f)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X1]:((~(left_zero(X3,X1))|(group_member(X1,X3)&![X2]:(~(group_member(X2,X3))|multiply(X3,X1,X2)=X1)))&((~(group_member(X1,X3))|?[X2]:(group_member(X2,X3)&~(multiply(X3,X1,X2)=X1)))|left_zero(X3,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(25, plain,![X4]:![X5]:((~(left_zero(X4,X5))|(group_member(X5,X4)&![X6]:(~(group_member(X6,X4))|multiply(X4,X5,X6)=X5)))&((~(group_member(X5,X4))|?[X7]:(group_member(X7,X4)&~(multiply(X4,X5,X7)=X5)))|left_zero(X4,X5))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:((~(left_zero(X4,X5))|(group_member(X5,X4)&![X6]:(~(group_member(X6,X4))|multiply(X4,X5,X6)=X5)))&((~(group_member(X5,X4))|(group_member(esk2_2(X4,X5),X4)&~(multiply(X4,X5,esk2_2(X4,X5))=X5)))|left_zero(X4,X5))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:((((~(group_member(X6,X4))|multiply(X4,X5,X6)=X5)&group_member(X5,X4))|~(left_zero(X4,X5)))&((~(group_member(X5,X4))|(group_member(esk2_2(X4,X5),X4)&~(multiply(X4,X5,esk2_2(X4,X5))=X5)))|left_zero(X4,X5))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:((((~(group_member(X6,X4))|multiply(X4,X5,X6)=X5)|~(left_zero(X4,X5)))&(group_member(X5,X4)|~(left_zero(X4,X5))))&(((group_member(esk2_2(X4,X5),X4)|~(group_member(X5,X4)))|left_zero(X4,X5))&((~(multiply(X4,X5,esk2_2(X4,X5))=X5)|~(group_member(X5,X4)))|left_zero(X4,X5)))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(left_zero(X1,X2)|~group_member(X2,X1)|multiply(X1,X2,esk2_2(X1,X2))!=X2),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(left_zero(X1,X2)|group_member(esk2_2(X1,X2),X1)|~group_member(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(group_member(X2,X1)|~left_zero(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(32,plain,(multiply(X1,X2,X3)=X2|~left_zero(X1,X2)|~group_member(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(33, plain,![X3]:![X1]:![X2]:((~(group_member(X1,X3))|~(group_member(X2,X3)))|group_member(multiply(X3,X1,X2),X3)),inference(fof_nnf,[status(thm)],[6])).
% fof(34, plain,![X4]:![X5]:![X6]:((~(group_member(X5,X4))|~(group_member(X6,X4)))|group_member(multiply(X4,X5,X6),X4)),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(group_member(multiply(X1,X2,X3),X1)|~group_member(X3,X1)|~group_member(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(39,negated_conjecture,(~left_zero(h,phi(f_left_zero))),inference(split_conjunct,[status(thm)],[10])).
% cnf(40,plain,(group_member(f_left_zero,f)),inference(spm,[status(thm)],[31,14,theory(equality)])).
% cnf(42,plain,(multiply(f,f_left_zero,X1)=f_left_zero|~group_member(X1,f)),inference(spm,[status(thm)],[32,14,theory(equality)])).
% cnf(43,plain,(group_member(phi(multiply(f,X1,X2)),h)|~group_member(phi(X2),h)|~group_member(phi(X1),h)|~group_member(X2,f)|~group_member(X1,f)),inference(spm,[status(thm)],[35,23,theory(equality)])).
% cnf(44,plain,(multiply(h,phi(X1),X2)=phi(multiply(f,X1,esk1_1(X2)))|~group_member(esk1_1(X2),f)|~group_member(X1,f)|~group_member(X2,h)),inference(spm,[status(thm)],[23,19,theory(equality)])).
% cnf(61,plain,(group_member(phi(multiply(f,X1,X2)),h)|~group_member(phi(X2),h)|~group_member(X2,f)|~group_member(X1,f)),inference(csr,[status(thm)],[43,13])).
% cnf(62,plain,(group_member(phi(multiply(f,X1,X2)),h)|~group_member(X2,f)|~group_member(X1,f)),inference(csr,[status(thm)],[61,13])).
% cnf(64,plain,(group_member(phi(f_left_zero),h)|~group_member(X1,f)|~group_member(f_left_zero,f)),inference(spm,[status(thm)],[62,42,theory(equality)])).
% cnf(65,plain,(group_member(phi(f_left_zero),h)|~group_member(X1,f)|$false),inference(rw,[status(thm)],[64,40,theory(equality)])).
% cnf(66,plain,(group_member(phi(f_left_zero),h)|~group_member(X1,f)),inference(cn,[status(thm)],[65,theory(equality)])).
% cnf(70,plain,(group_member(phi(f_left_zero),h)),inference(spm,[status(thm)],[66,40,theory(equality)])).
% cnf(146,plain,(phi(multiply(f,X1,esk1_1(X2)))=multiply(h,phi(X1),X2)|~group_member(X1,f)|~group_member(X2,h)),inference(csr,[status(thm)],[44,20])).
% cnf(152,plain,(phi(f_left_zero)=multiply(h,phi(f_left_zero),X1)|~group_member(f_left_zero,f)|~group_member(X1,h)|~group_member(esk1_1(X1),f)),inference(spm,[status(thm)],[146,42,theory(equality)])).
% cnf(153,plain,(phi(f_left_zero)=multiply(h,phi(f_left_zero),X1)|$false|~group_member(X1,h)|~group_member(esk1_1(X1),f)),inference(rw,[status(thm)],[152,40,theory(equality)])).
% cnf(154,plain,(phi(f_left_zero)=multiply(h,phi(f_left_zero),X1)|~group_member(X1,h)|~group_member(esk1_1(X1),f)),inference(cn,[status(thm)],[153,theory(equality)])).
% cnf(155,plain,(multiply(h,phi(f_left_zero),X1)=phi(f_left_zero)|~group_member(X1,h)),inference(csr,[status(thm)],[154,20])).
% cnf(158,plain,(left_zero(h,phi(f_left_zero))|~group_member(phi(f_left_zero),h)|~group_member(esk2_2(h,phi(f_left_zero)),h)),inference(spm,[status(thm)],[29,155,theory(equality)])).
% cnf(165,plain,(left_zero(h,phi(f_left_zero))|$false|~group_member(esk2_2(h,phi(f_left_zero)),h)),inference(rw,[status(thm)],[158,70,theory(equality)])).
% cnf(166,plain,(left_zero(h,phi(f_left_zero))|~group_member(esk2_2(h,phi(f_left_zero)),h)),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(167,plain,(~group_member(esk2_2(h,phi(f_left_zero)),h)),inference(sr,[status(thm)],[166,39,theory(equality)])).
% cnf(170,plain,(left_zero(h,phi(f_left_zero))|~group_member(phi(f_left_zero),h)),inference(spm,[status(thm)],[167,30,theory(equality)])).
% cnf(171,plain,(left_zero(h,phi(f_left_zero))|$false),inference(rw,[status(thm)],[170,70,theory(equality)])).
% cnf(172,plain,(left_zero(h,phi(f_left_zero))),inference(cn,[status(thm)],[171,theory(equality)])).
% cnf(173,plain,($false),inference(sr,[status(thm)],[172,39,theory(equality)])).
% cnf(174,plain,($false),173,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 38
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 59
% # ...of the previous two non-trivial : 52
% # Contextual simplify-reflections : 4
% # Paramodulations : 59
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 90
% # Clause-clause subsumption calls (NU) : 47
% # Rec. Clause-clause subsumption calls : 44
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 31 leaves, 1.55+/-0.910 terms/leaf
% # Paramod-from index: 14 leaves, 1.14+/-0.515 terms/leaf
% # Paramod-into index: 27 leaves, 1.30+/-0.532 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.002 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP32222/GRP194+1.tptp
%
%------------------------------------------------------------------------------