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 : n007.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.30s
% Output : Saturation 147.30s
% Verified :
% Statistics : Number of clauses : 24 ( 530 expanded)
% Number of leaves : 3 ( 115 expanded)
% Depth : 11
% Number of atoms : 24 ( 530 expanded)
% Number of equality atoms : 24 ( 530 expanded)
% Maximal clause size : 1 ( 1 average)
% Maximal term depth : 4 ( 2 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: ET---1.0 format not known, defaulting to TPTP
cnf(c_0_0,axiom,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity)).
cnf(c_0_1,axiom,
( multiply(inverse(X1),X1) = identity ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse)).
cnf(c_0_2,axiom,
( multiply(identity,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity)).
cnf(c_0_3,axiom,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_0).
cnf(c_0_4,axiom,
( multiply(inverse(X1),X1) = identity ),
c_0_1).
cnf(c_0_5,axiom,
( multiply(identity,X1) = X1 ),
c_0_2).
cnf(c_0_6,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_3).
cnf(c_0_7,plain,
( multiply(inverse(X1),X1) = identity ),
c_0_4).
cnf(c_0_8,plain,
( multiply(identity,X1) = X1 ),
c_0_5).
cnf(c_0_9,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_6,
[final]).
cnf(c_0_10,plain,
( multiply(inverse(X1),X1) = identity ),
c_0_7,
[final]).
cnf(c_0_11,plain,
( multiply(identity,X1) = X1 ),
c_0_8,
[final]).
cnf(c_0_12,plain,
( multiply(inverse(X1),multiply(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10,theory(equality)]),c_0_11,theory(equality)]),
[final]).
cnf(c_0_13,plain,
( multiply(inverse(inverse(X1)),X2) = multiply(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_12,theory(equality)])).
cnf(c_0_14,plain,
( multiply(X1,inverse(X1)) = identity ),
inference(spm,[status(thm)],[c_0_10,c_0_13,theory(equality)]),
[final]).
cnf(c_0_15,plain,
( multiply(inverse(X1),identity) = inverse(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_14,theory(equality)])).
cnf(c_0_16,plain,
( multiply(X1,identity) = inverse(inverse(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_15,theory(equality)])).
cnf(c_0_17,plain,
( multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3 ),
inference(spm,[status(thm)],[c_0_12,c_0_9,theory(equality)])).
cnf(c_0_18,plain,
( inverse(inverse(X1)) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10,theory(equality)]),c_0_13,theory(equality)]),c_0_16,theory(equality)]),
[final]).
cnf(c_0_19,plain,
( multiply(inverse(multiply(X1,X2)),X1) = inverse(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14,theory(equality)]),c_0_16,theory(equality)]),c_0_18,theory(equality)])).
cnf(c_0_20,plain,
( inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_12,theory(equality)]),
[final]).
cnf(c_0_21,plain,
( multiply(X1,multiply(inverse(X1),X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14,theory(equality)]),c_0_11,theory(equality)]),
[final]).
cnf(c_0_22,plain,
( multiply(X1,identity) = X1 ),
inference(rw,[status(thm)],[c_0_16,c_0_18,theory(equality)]),
[final]).
cnf(c_0_23,plain,
( inverse(identity) = identity ),
inference(spm,[status(thm)],[c_0_11,c_0_14,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 : n007.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.01/19.15 # AutoSched4-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 18.01/19.15 # and selection function SelectNewComplexAHPNS.
% 18.01/19.15 #
% 18.01/19.15 # Preprocessing time : 0.005 s
% 18.01/19.15 # Presaturation interreduction done
% 18.01/19.19 # No success with AutoSched4
% 18.01/19.19 # Trying AutoSched3 for 18 seconds
% 36.10/37.20 # AutoSched3-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 36.10/37.20 # and selection function SelectNewComplexAHPNS.
% 36.10/37.20 #
% 36.10/37.20 # Preprocessing time : 0.005 s
% 36.10/37.20 # Presaturation interreduction done
% 36.10/37.24 # No success with AutoSched3
% 36.10/37.24 # Trying AutoSched2 for 37 seconds
% 73.09/74.27 # AutoSched2-Mode selected heuristic G_E___208_C18_F1_AE_CS_SP_PS_S0a
% 73.09/74.27 # and selection function SelectNegativeLiterals.
% 73.09/74.27 #
% 73.09/74.27 # Preprocessing time : 0.005 s
% 73.09/74.27 # Presaturation interreduction done
% 73.19/74.32 # No success with AutoSched2
% 73.19/74.32 # Trying AutoSched1 for 74 seconds
% 147.20/148.35 # AutoSched1-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0i
% 147.20/148.35 # and selection function SelectDiffNegLit.
% 147.20/148.35 #
% 147.20/148.35 # Preprocessing time : 0.005 s
% 147.20/148.35 # Presaturation interreduction done
% 147.20/148.40 # No success with AutoSched1
% 147.20/148.40 # Trying AutoSched0 for 152 seconds
% 147.30/148.41 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 147.30/148.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 147.30/148.41 #
% 147.30/148.41 # Preprocessing time : 0.005 s
% 147.30/148.41 # Presaturation interreduction done
% 147.30/148.41
% 147.30/148.41 # No proof found!
% 147.30/148.41 # SZS status Satisfiable
% 147.30/148.41 # SZS output start Saturation.
% 147.30/148.41 cnf(c_0_0,axiom,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax', associativity)).
% 147.30/148.41 cnf(c_0_1,axiom,(multiply(inverse(X1),X1)=identity), file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax', left_inverse)).
% 147.30/148.41 cnf(c_0_2,axiom,(multiply(identity,X1)=X1), file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax', left_identity)).
% 147.30/148.41 cnf(c_0_3,axiom,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_0).
% 147.30/148.41 cnf(c_0_4,axiom,(multiply(inverse(X1),X1)=identity), c_0_1).
% 147.30/148.41 cnf(c_0_5,axiom,(multiply(identity,X1)=X1), c_0_2).
% 147.30/148.41 cnf(c_0_6,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_3).
% 147.30/148.41 cnf(c_0_7,plain,(multiply(inverse(X1),X1)=identity), c_0_4).
% 147.30/148.41 cnf(c_0_8,plain,(multiply(identity,X1)=X1), c_0_5).
% 147.30/148.41 cnf(c_0_9,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_6, ['final']).
% 147.30/148.41 cnf(c_0_10,plain,(multiply(inverse(X1),X1)=identity), c_0_7, ['final']).
% 147.30/148.41 cnf(c_0_11,plain,(multiply(identity,X1)=X1), c_0_8, ['final']).
% 147.30/148.41 cnf(c_0_12,plain,(multiply(inverse(X1),multiply(X1,X2))=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10, theory(equality)]), c_0_11, theory(equality)]), ['final']).
% 147.30/148.41 cnf(c_0_13,plain,(multiply(inverse(inverse(X1)),X2)=multiply(X1,X2)), inference(spm,[status(thm)],[c_0_12, c_0_12, theory(equality)])).
% 147.30/148.41 cnf(c_0_14,plain,(multiply(X1,inverse(X1))=identity), inference(spm,[status(thm)],[c_0_10, c_0_13, theory(equality)]), ['final']).
% 147.30/148.41 cnf(c_0_15,plain,(multiply(inverse(X1),identity)=inverse(X1)), inference(spm,[status(thm)],[c_0_12, c_0_14, theory(equality)])).
% 147.30/148.41 cnf(c_0_16,plain,(multiply(X1,identity)=inverse(inverse(X1))), inference(spm,[status(thm)],[c_0_13, c_0_15, theory(equality)])).
% 147.30/148.41 cnf(c_0_17,plain,(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3)))=X3), inference(spm,[status(thm)],[c_0_12, c_0_9, theory(equality)])).
% 147.30/148.41 cnf(c_0_18,plain,(inverse(inverse(X1))=X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_10, theory(equality)]), c_0_13, theory(equality)]), c_0_16, theory(equality)]), ['final']).
% 147.30/148.41 cnf(c_0_19,plain,(multiply(inverse(multiply(X1,X2)),X1)=inverse(X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_14, theory(equality)]), c_0_16, theory(equality)]), c_0_18, theory(equality)])).
% 147.30/148.41 cnf(c_0_20,plain,(inverse(multiply(X1,X2))=multiply(inverse(X2),inverse(X1))), inference(spm,[status(thm)],[c_0_19, c_0_12, theory(equality)]), ['final']).
% 147.30/148.41 cnf(c_0_21,plain,(multiply(X1,multiply(inverse(X1),X2))=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_14, theory(equality)]), c_0_11, theory(equality)]), ['final']).
% 147.30/148.41 cnf(c_0_22,plain,(multiply(X1,identity)=X1), inference(rw,[status(thm)],[c_0_16, c_0_18, theory(equality)]), ['final']).
% 147.30/148.41 cnf(c_0_23,plain,(inverse(identity)=identity), inference(spm,[status(thm)],[c_0_11, c_0_14, theory(equality)]), ['final']).
% 147.30/148.41 # SZS output end Saturation.
% 147.30/148.41 # Parsed axioms : 3
% 147.30/148.41 # Removed by relevancy pruning/SinE : 0
% 147.30/148.41 # Initial clauses : 3
% 147.30/148.41 # Removed in clause preprocessing : 0
% 147.30/148.41 # Initial clauses in saturation : 3
% 147.30/148.41 # Processed clauses : 24
% 147.30/148.41 # ...of these trivial : 4
% 147.30/148.41 # ...subsumed : 0
% 147.30/148.41 # ...remaining for further processing : 20
% 147.30/148.41 # Other redundant clauses eliminated : 0
% 147.30/148.41 # Clauses deleted for lack of memory : 0
% 147.30/148.41 # Backward-subsumed : 0
% 147.30/148.41 # Backward-rewritten : 7
% 147.30/148.41 # Generated clauses : 124
% 147.30/148.41 # ...of the previous two non-trivial : 46
% 147.30/148.41 # Contextual simplify-reflections : 0
% 147.30/148.41 # Paramodulations : 124
% 147.30/148.41 # Factorizations : 0
% 147.30/148.41 # Equation resolutions : 0
% 147.30/148.41 # Current number of processed clauses : 10
% 147.30/148.41 # Positive orientable unit clauses : 10
% 147.30/148.41 # Positive unorientable unit clauses: 0
% 147.30/148.41 # Negative unit clauses : 0
% 147.30/148.41 # Non-unit-clauses : 0
% 147.30/148.41 # Current number of unprocessed clauses: 0
% 147.30/148.41 # ...number of literals in the above : 0
% 147.30/148.41 # Clause-clause subsumption calls (NU) : 0
% 147.30/148.41 # Rec. Clause-clause subsumption calls : 0
% 147.30/148.41 # Non-unit clause-clause subsumptions : 0
% 147.30/148.41 # Unit Clause-clause subsumption calls : 0
% 147.30/148.41 # Rewrite failures with RHS unbound : 0
% 147.30/148.41 # BW rewrite match attempts : 6
% 147.30/148.41 # BW rewrite match successes : 5
% 147.30/148.41 # Condensation attempts : 0
% 147.30/148.41 # Condensation successes : 0
% 147.30/148.41
% 147.30/148.41 # -------------------------------------------------
% 147.30/148.41 # User time : 0.006 s
% 147.30/148.41 # System time : 0.000 s
% 147.30/148.41 # Total time : 0.006 s
% 147.30/148.41 # Maximum resident set size: 2444 pages
% 147.30/148.41
% 147.30/148.41 # -------------------------------------------------
% 147.30/148.41 # User time : 145.367 s
% 147.30/148.41 # System time : 1.924 s
% 147.30/148.41 # Total time : 147.291 s
% 147.30/148.41 # Maximum resident set size: 4008 pages
% 147.30/148.41 145.36user 1.92system 2:27.30elapsed 99%CPU (0avgtext+0avgdata 3731296maxresident)k
% 147.30/148.41 0inputs+936outputs (0major+842976minor)pagefaults 0swaps
%------------------------------------------------------------------------------