TMTP Model File: GRP394+3.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : ET---1.0
% Problem : GRP394+3 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : do_ET %s
% Computer : n005.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16127.75MB
% OS : Linux 2.6.32-504.16.2.el6.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 12 20:03:17 EDT 2015
% Result : Satisfiable 147.22s
% Output : Saturation 147.22s
% Verified :
% Statistics : Number of formulae : 33 ( 875 expanded)
% Number of clauses : 24 ( 530 expanded)
% Number of leaves : 3 ( 115 expanded)
% Depth : 14
% Number of atoms : 33 ( 875 expanded)
% Number of equality atoms : 33 ( 875 expanded)
% Maximal formula depth : 4 ( 1 average)
% Maximal clause size : 1 ( 1 average)
% Maximal term depth : 4 ( 2 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: ET---1.0 format not known, defaulting to TPTP
fof(c_0_0,axiom,(
! [X1,X2,X3] : multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004+0.ax',associativity)).
fof(c_0_1,axiom,(
! [X1] : multiply(inverse(X1),X1) = identity ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004+0.ax',left_inverse)).
fof(c_0_2,axiom,(
! [X1] : multiply(identity,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004+0.ax',left_identity)).
fof(c_0_3,axiom,(
! [X1,X2,X3] : multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_0).
fof(c_0_4,axiom,(
! [X1] : multiply(inverse(X1),X1) = identity ),
c_0_1).
fof(c_0_5,axiom,(
! [X1] : multiply(identity,X1) = X1 ),
c_0_2).
fof(c_0_6,plain,(
! [X4,X5,X6] : multiply(multiply(X4,X5),X6) = multiply(X4,multiply(X5,X6)) ),
inference(variable_rename,[status(thm)],[c_0_3])).
fof(c_0_7,plain,(
! [X2] : multiply(inverse(X2),X2) = identity ),
inference(variable_rename,[status(thm)],[c_0_4])).
fof(c_0_8,plain,(
! [X2] : multiply(identity,X2) = X2 ),
inference(variable_rename,[status(thm)],[c_0_5])).
cnf(c_0_9,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10,plain,
( multiply(inverse(X1),X1) = identity ),
inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_11,plain,
( multiply(identity,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_9).
cnf(c_0_13,plain,
( multiply(inverse(X1),X1) = identity ),
c_0_10).
cnf(c_0_14,plain,
( multiply(identity,X1) = X1 ),
c_0_11).
cnf(c_0_15,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_12).
cnf(c_0_16,plain,
( multiply(inverse(X1),X1) = identity ),
c_0_13).
cnf(c_0_17,plain,
( multiply(identity,X1) = X1 ),
c_0_14).
cnf(c_0_18,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_15,
[final]).
cnf(c_0_19,plain,
( multiply(inverse(X1),X1) = identity ),
c_0_16,
[final]).
cnf(c_0_20,plain,
( multiply(identity,X1) = X1 ),
c_0_17,
[final]).
cnf(c_0_21,plain,
( multiply(inverse(X1),multiply(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19,theory(equality)]),c_0_20,theory(equality)]),
[final]).
cnf(c_0_22,plain,
( multiply(inverse(inverse(X1)),X2) = multiply(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_21,theory(equality)])).
cnf(c_0_23,plain,
( multiply(X1,inverse(X1)) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_22,theory(equality)]),
[final]).
cnf(c_0_24,plain,
( multiply(inverse(X1),identity) = inverse(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_23,theory(equality)])).
cnf(c_0_25,plain,
( multiply(X1,identity) = inverse(inverse(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_24,theory(equality)])).
cnf(c_0_26,plain,
( multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3 ),
inference(spm,[status(thm)],[c_0_21,c_0_18,theory(equality)])).
cnf(c_0_27,plain,
( inverse(inverse(X1)) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19,theory(equality)]),c_0_22,theory(equality)]),c_0_25,theory(equality)]),
[final]).
cnf(c_0_28,plain,
( multiply(inverse(multiply(X1,X2)),X1) = inverse(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23,theory(equality)]),c_0_25,theory(equality)]),c_0_27,theory(equality)])).
cnf(c_0_29,plain,
( inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_21,theory(equality)]),
[final]).
cnf(c_0_30,plain,
( multiply(X1,multiply(inverse(X1),X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23,theory(equality)]),c_0_20,theory(equality)]),
[final]).
cnf(c_0_31,plain,
( multiply(X1,identity) = X1 ),
inference(rw,[status(thm)],[c_0_25,c_0_27,theory(equality)]),
[final]).
cnf(c_0_32,plain,
( inverse(identity) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_23,theory(equality)]),
[final]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.03 % Problem : GRP394+3 : TPTP v6.2.0. Released v2.5.0.
% 0.01/0.03 % Command : do_ET %s
% 0.02/1.08 % Computer : n005.star.cs.uiowa.edu
% 0.02/1.08 % Model : x86_64 x86_64
% 0.02/1.08 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.08 % Memory : 16127.75MB
% 0.02/1.08 % OS : Linux 2.6.32-504.16.2.el6.x86_64
% 0.02/1.08 % CPULimit : 300
% 0.02/1.08 % DateTime : Fri Jun 12 11:59:39 CDT 2015
% 0.02/1.08 % CPUTime :
% 0.03/1.13 # No SInE strategy applied
% 0.03/1.13 # Trying AutoSched4 for 18 seconds
% 18.02/19.13 # AutoSched4-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 18.02/19.13 # and selection function SelectNewComplexAHPNS.
% 18.02/19.13 #
% 18.02/19.13 # Preprocessing time : 0.005 s
% 18.02/19.13 # Presaturation interreduction done
% 18.02/19.18 # No success with AutoSched4
% 18.02/19.18 # Trying AutoSched3 for 18 seconds
% 36.02/37.18 # AutoSched3-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 36.02/37.18 # and selection function SelectNewComplexAHPNS.
% 36.02/37.18 #
% 36.02/37.18 # Preprocessing time : 0.005 s
% 36.02/37.18 # Presaturation interreduction done
% 36.12/37.22 # No success with AutoSched3
% 36.12/37.22 # Trying AutoSched2 for 37 seconds
% 73.13/74.22 # AutoSched2-Mode selected heuristic G_E___208_C18_F1_AE_CS_SP_PS_S0a
% 73.13/74.22 # and selection function SelectNegativeLiterals.
% 73.13/74.22 #
% 73.13/74.22 # Preprocessing time : 0.005 s
% 73.13/74.22 # Presaturation interreduction done
% 73.13/74.28 # No success with AutoSched2
% 73.13/74.28 # Trying AutoSched1 for 74 seconds
% 147.22/148.32 # AutoSched1-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0i
% 147.22/148.32 # and selection function SelectDiffNegLit.
% 147.22/148.32 #
% 147.22/148.32 # Preprocessing time : 0.005 s
% 147.22/148.32 # Presaturation interreduction done
% 147.22/148.37 # No success with AutoSched1
% 147.22/148.37 # Trying AutoSched0 for 152 seconds
% 147.22/148.38 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 147.22/148.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 147.22/148.38 #
% 147.22/148.38 # Preprocessing time : 0.006 s
% 147.22/148.38 # Presaturation interreduction done
% 147.22/148.38
% 147.22/148.38 # No proof found!
% 147.22/148.38 # SZS status Satisfiable
% 147.22/148.38 # SZS output start Saturation.
% 147.22/148.38 fof(c_0_0, axiom, (![X1]:![X2]:![X3]:multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), file('/export/starexec/sandbox2/benchmark/Axioms/GRP004+0.ax', associativity)).
% 147.22/148.38 fof(c_0_1, axiom, (![X1]:multiply(inverse(X1),X1)=identity), file('/export/starexec/sandbox2/benchmark/Axioms/GRP004+0.ax', left_inverse)).
% 147.22/148.38 fof(c_0_2, axiom, (![X1]:multiply(identity,X1)=X1), file('/export/starexec/sandbox2/benchmark/Axioms/GRP004+0.ax', left_identity)).
% 147.22/148.38 fof(c_0_3, axiom, (![X1]:![X2]:![X3]:multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_0).
% 147.22/148.38 fof(c_0_4, axiom, (![X1]:multiply(inverse(X1),X1)=identity), c_0_1).
% 147.22/148.38 fof(c_0_5, axiom, (![X1]:multiply(identity,X1)=X1), c_0_2).
% 147.22/148.38 fof(c_0_6, plain, (![X4]:![X5]:![X6]:multiply(multiply(X4,X5),X6)=multiply(X4,multiply(X5,X6))), inference(variable_rename,[status(thm)],[c_0_3])).
% 147.22/148.38 fof(c_0_7, plain, (![X2]:multiply(inverse(X2),X2)=identity), inference(variable_rename,[status(thm)],[c_0_4])).
% 147.22/148.38 fof(c_0_8, plain, (![X2]:multiply(identity,X2)=X2), inference(variable_rename,[status(thm)],[c_0_5])).
% 147.22/148.38 cnf(c_0_9,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 147.22/148.38 cnf(c_0_10,plain,(multiply(inverse(X1),X1)=identity), inference(split_conjunct,[status(thm)],[c_0_7])).
% 147.22/148.38 cnf(c_0_11,plain,(multiply(identity,X1)=X1), inference(split_conjunct,[status(thm)],[c_0_8])).
% 147.22/148.38 cnf(c_0_12,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_9).
% 147.22/148.38 cnf(c_0_13,plain,(multiply(inverse(X1),X1)=identity), c_0_10).
% 147.22/148.38 cnf(c_0_14,plain,(multiply(identity,X1)=X1), c_0_11).
% 147.22/148.38 cnf(c_0_15,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_12).
% 147.22/148.38 cnf(c_0_16,plain,(multiply(inverse(X1),X1)=identity), c_0_13).
% 147.22/148.38 cnf(c_0_17,plain,(multiply(identity,X1)=X1), c_0_14).
% 147.22/148.38 cnf(c_0_18,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_15, ['final']).
% 147.22/148.38 cnf(c_0_19,plain,(multiply(inverse(X1),X1)=identity), c_0_16, ['final']).
% 147.22/148.38 cnf(c_0_20,plain,(multiply(identity,X1)=X1), c_0_17, ['final']).
% 147.22/148.38 cnf(c_0_21,plain,(multiply(inverse(X1),multiply(X1,X2))=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19, theory(equality)]), c_0_20, theory(equality)]), ['final']).
% 147.22/148.38 cnf(c_0_22,plain,(multiply(inverse(inverse(X1)),X2)=multiply(X1,X2)), inference(spm,[status(thm)],[c_0_21, c_0_21, theory(equality)])).
% 147.22/148.38 cnf(c_0_23,plain,(multiply(X1,inverse(X1))=identity), inference(spm,[status(thm)],[c_0_19, c_0_22, theory(equality)]), ['final']).
% 147.22/148.38 cnf(c_0_24,plain,(multiply(inverse(X1),identity)=inverse(X1)), inference(spm,[status(thm)],[c_0_21, c_0_23, theory(equality)])).
% 147.22/148.38 cnf(c_0_25,plain,(multiply(X1,identity)=inverse(inverse(X1))), inference(spm,[status(thm)],[c_0_22, c_0_24, theory(equality)])).
% 147.22/148.38 cnf(c_0_26,plain,(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3)))=X3), inference(spm,[status(thm)],[c_0_21, c_0_18, theory(equality)])).
% 147.22/148.38 cnf(c_0_27,plain,(inverse(inverse(X1))=X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_19, theory(equality)]), c_0_22, theory(equality)]), c_0_25, theory(equality)]), ['final']).
% 147.22/148.38 cnf(c_0_28,plain,(multiply(inverse(multiply(X1,X2)),X1)=inverse(X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_23, theory(equality)]), c_0_25, theory(equality)]), c_0_27, theory(equality)])).
% 147.22/148.38 cnf(c_0_29,plain,(inverse(multiply(X1,X2))=multiply(inverse(X2),inverse(X1))), inference(spm,[status(thm)],[c_0_28, c_0_21, theory(equality)]), ['final']).
% 147.22/148.38 cnf(c_0_30,plain,(multiply(X1,multiply(inverse(X1),X2))=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_23, theory(equality)]), c_0_20, theory(equality)]), ['final']).
% 147.22/148.38 cnf(c_0_31,plain,(multiply(X1,identity)=X1), inference(rw,[status(thm)],[c_0_25, c_0_27, theory(equality)]), ['final']).
% 147.22/148.38 cnf(c_0_32,plain,(inverse(identity)=identity), inference(spm,[status(thm)],[c_0_20, c_0_23, theory(equality)]), ['final']).
% 147.22/148.38 # SZS output end Saturation.
% 147.22/148.38 # Parsed axioms : 3
% 147.22/148.38 # Removed by relevancy pruning/SinE : 0
% 147.22/148.38 # Initial clauses : 3
% 147.22/148.38 # Removed in clause preprocessing : 0
% 147.22/148.38 # Initial clauses in saturation : 3
% 147.22/148.38 # Processed clauses : 24
% 147.22/148.38 # ...of these trivial : 4
% 147.22/148.38 # ...subsumed : 0
% 147.22/148.38 # ...remaining for further processing : 20
% 147.22/148.38 # Other redundant clauses eliminated : 0
% 147.22/148.38 # Clauses deleted for lack of memory : 0
% 147.22/148.38 # Backward-subsumed : 0
% 147.22/148.38 # Backward-rewritten : 7
% 147.22/148.38 # Generated clauses : 124
% 147.22/148.38 # ...of the previous two non-trivial : 46
% 147.22/148.38 # Contextual simplify-reflections : 0
% 147.22/148.38 # Paramodulations : 124
% 147.22/148.38 # Factorizations : 0
% 147.22/148.38 # Equation resolutions : 0
% 147.22/148.38 # Current number of processed clauses : 10
% 147.22/148.38 # Positive orientable unit clauses : 10
% 147.22/148.38 # Positive unorientable unit clauses: 0
% 147.22/148.38 # Negative unit clauses : 0
% 147.22/148.38 # Non-unit-clauses : 0
% 147.22/148.38 # Current number of unprocessed clauses: 0
% 147.22/148.38 # ...number of literals in the above : 0
% 147.22/148.38 # Clause-clause subsumption calls (NU) : 0
% 147.22/148.38 # Rec. Clause-clause subsumption calls : 0
% 147.22/148.38 # Non-unit clause-clause subsumptions : 0
% 147.22/148.38 # Unit Clause-clause subsumption calls : 0
% 147.22/148.38 # Rewrite failures with RHS unbound : 0
% 147.22/148.38 # BW rewrite match attempts : 6
% 147.22/148.38 # BW rewrite match successes : 5
% 147.22/148.38 # Condensation attempts : 0
% 147.22/148.38 # Condensation successes : 0
% 147.22/148.38
% 147.22/148.38 # -------------------------------------------------
% 147.22/148.38 # User time : 0.006 s
% 147.22/148.38 # System time : 0.001 s
% 147.22/148.38 # Total time : 0.007 s
% 147.22/148.38 # Maximum resident set size: 2480 pages
% 147.22/148.38
% 147.22/148.38 # -------------------------------------------------
% 147.22/148.38 # User time : 145.377 s
% 147.22/148.38 # System time : 1.908 s
% 147.22/148.38 # Total time : 147.285 s
% 147.22/148.38 # Maximum resident set size: 4012 pages
% 147.22/148.38 145.37user 1.90system 2:27.27elapsed 100%CPU (0avgtext+0avgdata 3731440maxresident)k
% 147.22/148.38 0inputs+936outputs (0major+845034minor)pagefaults 0swaps
%------------------------------------------------------------------------------