TMTP Model File: GRP393-2.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : ET---1.0
% Problem : GRP393-2 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : do_ET %s
% Computer : n026.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 0.03s
% Output : Saturation 0.03s
% Verified :
% Statistics : Number of clauses : 4 ( 4 expanded)
% Number of leaves : 1 ( 1 expanded)
% Depth : 3
% Number of atoms : 4 ( 4 expanded)
% Number of equality atoms : 4 ( 4 expanded)
% Maximal clause size : 1 ( 1 average)
% Maximal term depth : 3 ( 3 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/sandbox/benchmark/Axioms/GRP008-0.ax',associativity_of_multiply)).
cnf(c_0_1,axiom,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_0).
cnf(c_0_2,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_1).
cnf(c_0_3,plain,
( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
c_0_2,
[final]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP393-2 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : do_ET %s
% 0.01/1.07 % Computer : n026.star.cs.uiowa.edu
% 0.01/1.07 % Model : x86_64 x86_64
% 0.01/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.01/1.07 % Memory : 16127.75MB
% 0.01/1.07 % OS : Linux 2.6.32-504.16.2.el6.x86_64
% 0.01/1.07 % CPULimit : 300
% 0.01/1.07 % DateTime : Fri Jun 12 11:59:35 CDT 2015
% 0.01/1.07 % CPUTime :
% 0.03/1.12 # No SInE strategy applied
% 0.03/1.12 # Trying AutoSched4 for 18 seconds
% 0.03/1.12 # AutoSched4-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.03/1.12 # and selection function SelectNewComplexAHPNS.
% 0.03/1.12 #
% 0.03/1.12 # Preprocessing time : 0.005 s
% 0.03/1.12 # Presaturation interreduction done
% 0.03/1.12
% 0.03/1.12 # No proof found!
% 0.03/1.12 # SZS status Satisfiable
% 0.03/1.12 # SZS output start Saturation.
% 0.03/1.12 cnf(c_0_0,axiom,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), file('/export/starexec/sandbox/benchmark/Axioms/GRP008-0.ax', associativity_of_multiply)).
% 0.03/1.12 cnf(c_0_1,axiom,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_0).
% 0.03/1.12 cnf(c_0_2,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_1).
% 0.03/1.12 cnf(c_0_3,plain,(multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3))), c_0_2, ['final']).
% 0.03/1.12 # SZS output end Saturation.
% 0.03/1.12 # Parsed axioms : 1
% 0.03/1.12 # Removed by relevancy pruning/SinE : 0
% 0.03/1.12 # Initial clauses : 1
% 0.03/1.12 # Removed in clause preprocessing : 0
% 0.03/1.12 # Initial clauses in saturation : 1
% 0.03/1.12 # Processed clauses : 2
% 0.03/1.12 # ...of these trivial : 0
% 0.03/1.12 # ...subsumed : 0
% 0.03/1.12 # ...remaining for further processing : 2
% 0.03/1.12 # Other redundant clauses eliminated : 0
% 0.03/1.12 # Clauses deleted for lack of memory : 0
% 0.03/1.12 # Backward-subsumed : 0
% 0.03/1.12 # Backward-rewritten : 0
% 0.03/1.12 # Generated clauses : 1
% 0.03/1.12 # ...of the previous two non-trivial : 0
% 0.03/1.12 # Contextual simplify-reflections : 0
% 0.03/1.12 # Paramodulations : 1
% 0.03/1.12 # Factorizations : 0
% 0.03/1.12 # Equation resolutions : 0
% 0.03/1.12 # Current number of processed clauses : 1
% 0.03/1.12 # Positive orientable unit clauses : 1
% 0.03/1.12 # Positive unorientable unit clauses: 0
% 0.03/1.12 # Negative unit clauses : 0
% 0.03/1.12 # Non-unit-clauses : 0
% 0.03/1.12 # Current number of unprocessed clauses: 0
% 0.03/1.12 # ...number of literals in the above : 0
% 0.03/1.12 # Clause-clause subsumption calls (NU) : 0
% 0.03/1.12 # Rec. Clause-clause subsumption calls : 0
% 0.03/1.12 # Non-unit clause-clause subsumptions : 0
% 0.03/1.12 # Unit Clause-clause subsumption calls : 0
% 0.03/1.12 # Rewrite failures with RHS unbound : 0
% 0.03/1.12 # BW rewrite match attempts : 0
% 0.03/1.12 # BW rewrite match successes : 0
% 0.03/1.12 # Condensation attempts : 0
% 0.03/1.12 # Condensation successes : 0
% 0.03/1.12
% 0.03/1.12 # -------------------------------------------------
% 0.03/1.12 # User time : 0.005 s
% 0.03/1.12 # System time : 0.000 s
% 0.03/1.12 # Total time : 0.005 s
% 0.03/1.12 # Maximum resident set size: 2368 pages
% 0.03/1.12
% 0.03/1.12 # -------------------------------------------------
% 0.03/1.12 # User time : 0.025 s
% 0.03/1.12 # System time : 0.007 s
% 0.03/1.12 # Total time : 0.032 s
% 0.03/1.12 # Maximum resident set size: 4008 pages
% 0.03/1.13 0.02user 0.00system 0:00.03elapsed 90%CPU (0avgtext+0avgdata 16032maxresident)k
% 0.03/1.13 0inputs+936outputs (0major+2859minor)pagefaults 0swaps
%------------------------------------------------------------------------------