TMTP Model File: GRP394-3.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : E---1.9
% Problem : GRP394-3 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : eprover --auto-schedule --tstp-format -s --proof-object --memory-limit=2048 --cpu-limit=%d %s
% Computer : n179.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-504.16.2.el6.x86_64
% CPULimit : 300s
% DateTime : Mon May 18 09:27:35 EDT 2015
% Result : Satisfiable 0.02s
% Output : Saturation 0.02s
% Verified :
% Statistics : Number of clauses : 18 ( 191 expanded)
% Number of leaves : 3 ( 118 expanded)
% Depth : 8
% Number of atoms : 18 ( 191 expanded)
% Number of equality atoms : 18 ( 191 expanded)
% Maximal clause size : 1 ( 1 average)
% Maximal term depth : 4 ( 2 average)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_0,axiom,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity)).
cnf(c_0_1,axiom,
( multiply(inverse(X1),X1) = identity ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse)).
cnf(c_0_2,axiom,
( multiply(identity,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity)).
cnf(c_0_3,plain,
( multiply(inverse(X1),multiply(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_0,c_0_1]),c_0_2]),
[final]).
cnf(c_0_4,plain,
( multiply(inverse(inverse(X1)),X2) = multiply(X1,X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_3])).
cnf(c_0_5,plain,
( multiply(X1,inverse(X1)) = identity ),
inference(spm,[status(thm)],[c_0_1,c_0_4]),
[final]).
cnf(c_0_6,plain,
( multiply(inverse(X1),identity) = inverse(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_5])).
cnf(c_0_7,plain,
( multiply(X1,identity) = inverse(inverse(X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6])).
cnf(c_0_8,plain,
( multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3))) = X3 ),
inference(spm,[status(thm)],[c_0_3,c_0_0])).
cnf(c_0_9,plain,
( inverse(inverse(X1)) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_1]),c_0_4]),c_0_7]),
[final]).
cnf(c_0_10,plain,
( multiply(inverse(multiply(X1,X2)),X1) = inverse(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_5]),c_0_7]),c_0_9])).
cnf(c_0_11,plain,
( inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_3]),
[final]).
cnf(c_0_12,plain,
( multiply(X1,multiply(inverse(X1),X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_0,c_0_5]),c_0_2]),
[final]).
cnf(c_0_13,plain,
( multiply(X1,identity) = X1 ),
inference(rw,[status(thm)],[c_0_7,c_0_9]),
[final]).
cnf(c_0_14,plain,
( inverse(identity) = identity ),
inference(spm,[status(thm)],[c_0_2,c_0_5]),
[final]).
cnf(c_0_15,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_0,
[final]).
cnf(c_0_16,plain,
( multiply(inverse(X1),X1) = identity ),
c_0_1,
[final]).
cnf(c_0_17,plain,
( multiply(identity,X1) = X1 ),
c_0_2,
[final]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP394-3 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : eprover --auto-schedule --tstp-format -s --proof-object --memory-limit=2048 --cpu-limit=%d %s
% 0.02/1.07 % Computer : n179.star.cs.uiowa.edu
% 0.02/1.07 % Model : x86_64 x86_64
% 0.02/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.07 % Memory : 32286.75MB
% 0.02/1.07 % OS : Linux 2.6.32-504.16.2.el6.x86_64
% 0.02/1.07 % CPULimit : 300
% 0.02/1.07 % DateTime : Sun May 17 09:42:58 CDT 2015
% 0.02/1.07 % CPUTime :
% 0.02/1.07 # No SInE strategy applied
% 0.02/1.07 # Trying AutoSched0 for 151 seconds
% 0.02/1.08 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.02/1.08 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.02/1.08 #
% 0.02/1.08 # Presaturation interreduction done
% 0.02/1.08
% 0.02/1.08 # No proof found!
% 0.02/1.08 # SZS status Satisfiable
% 0.02/1.08 # SZS output start Saturation.
% 0.02/1.08 cnf(c_0_0,axiom,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax', associativity)).
% 0.02/1.08 cnf(c_0_1,axiom,(multiply(inverse(X1),X1)=identity), file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax', left_inverse)).
% 0.02/1.08 cnf(c_0_2,axiom,(multiply(identity,X1)=X1), file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax', left_identity)).
% 0.02/1.08 cnf(c_0_3,plain,(multiply(inverse(X1),multiply(X1,X2))=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_0, c_0_1]), c_0_2]), ['final']).
% 0.02/1.08 cnf(c_0_4,plain,(multiply(inverse(inverse(X1)),X2)=multiply(X1,X2)), inference(spm,[status(thm)],[c_0_3, c_0_3])).
% 0.02/1.08 cnf(c_0_5,plain,(multiply(X1,inverse(X1))=identity), inference(spm,[status(thm)],[c_0_1, c_0_4]), ['final']).
% 0.02/1.08 cnf(c_0_6,plain,(multiply(inverse(X1),identity)=inverse(X1)), inference(spm,[status(thm)],[c_0_3, c_0_5])).
% 0.02/1.08 cnf(c_0_7,plain,(multiply(X1,identity)=inverse(inverse(X1))), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 0.02/1.08 cnf(c_0_8,plain,(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X3)))=X3), inference(spm,[status(thm)],[c_0_3, c_0_0])).
% 0.02/1.08 cnf(c_0_9,plain,(inverse(inverse(X1))=X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_1]), c_0_4]), c_0_7]), ['final']).
% 0.02/1.08 cnf(c_0_10,plain,(multiply(inverse(multiply(X1,X2)),X1)=inverse(X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_5]), c_0_7]), c_0_9])).
% 0.02/1.08 cnf(c_0_11,plain,(inverse(multiply(X1,X2))=multiply(inverse(X2),inverse(X1))), inference(spm,[status(thm)],[c_0_10, c_0_3]), ['final']).
% 0.02/1.08 cnf(c_0_12,plain,(multiply(X1,multiply(inverse(X1),X2))=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_0, c_0_5]), c_0_2]), ['final']).
% 0.02/1.08 cnf(c_0_13,plain,(multiply(X1,identity)=X1), inference(rw,[status(thm)],[c_0_7, c_0_9]), ['final']).
% 0.02/1.08 cnf(c_0_14,plain,(inverse(identity)=identity), inference(spm,[status(thm)],[c_0_2, c_0_5]), ['final']).
% 0.02/1.08 cnf(c_0_15,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_0, ['final']).
% 0.02/1.08 cnf(c_0_16,plain,(multiply(inverse(X1),X1)=identity), c_0_1, ['final']).
% 0.02/1.08 cnf(c_0_17,plain,(multiply(identity,X1)=X1), c_0_2, ['final']).
% 0.02/1.08 # SZS output end Saturation.
%------------------------------------------------------------------------------