TMTP Model File: HWC004-2.004-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : ET---1.0
% Problem : HWC004-2 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : do_ET %s
% Computer : n010.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:04:19 EDT 2015
% Result : Satisfiable 0.03s
% Output : Saturation 0.03s
% Verified :
% Statistics : Number of clauses : 24 ( 24 expanded)
% Number of leaves : 6 ( 6 expanded)
% Depth : 3
% Number of atoms : 24 ( 24 expanded)
% Number of equality atoms : 24 ( 24 expanded)
% Maximal clause size : 1 ( 1 average)
% Maximal term depth : 2 ( 2 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: ET---1.0 format not known, defaulting to TPTP
cnf(c_0_0,axiom,
( or(X1,n0) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',or_definition1)).
cnf(c_0_1,axiom,
( and(X1,n1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',and_definition2)).
cnf(c_0_2,axiom,
( or(X1,n1) = n1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',or_definition2)).
cnf(c_0_3,axiom,
( and(X1,n0) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',and_definition1)).
cnf(c_0_4,axiom,
( not(n1) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition2)).
cnf(c_0_5,axiom,
( not(n0) = n1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition1)).
cnf(c_0_6,axiom,
( or(X1,n0) = X1 ),
c_0_0).
cnf(c_0_7,axiom,
( and(X1,n1) = X1 ),
c_0_1).
cnf(c_0_8,axiom,
( or(X1,n1) = n1 ),
c_0_2).
cnf(c_0_9,axiom,
( and(X1,n0) = n0 ),
c_0_3).
cnf(c_0_10,axiom,
( not(n1) = n0 ),
c_0_4).
cnf(c_0_11,axiom,
( not(n0) = n1 ),
c_0_5).
cnf(c_0_12,plain,
( or(X1,n0) = X1 ),
c_0_6).
cnf(c_0_13,plain,
( and(X1,n1) = X1 ),
c_0_7).
cnf(c_0_14,plain,
( or(X1,n1) = n1 ),
c_0_8).
cnf(c_0_15,plain,
( and(X1,n0) = n0 ),
c_0_9).
cnf(c_0_16,plain,
( not(n1) = n0 ),
c_0_10).
cnf(c_0_17,plain,
( not(n0) = n1 ),
c_0_11).
cnf(c_0_18,plain,
( or(X1,n0) = X1 ),
c_0_12,
[final]).
cnf(c_0_19,plain,
( and(X1,n1) = X1 ),
c_0_13,
[final]).
cnf(c_0_20,plain,
( or(X1,n1) = n1 ),
c_0_14,
[final]).
cnf(c_0_21,plain,
( and(X1,n0) = n0 ),
c_0_15,
[final]).
cnf(c_0_22,plain,
( not(n1) = n0 ),
c_0_16,
[final]).
cnf(c_0_23,plain,
( not(n0) = n1 ),
c_0_17,
[final]).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWC004-2 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : do_ET %s
% 0.01/1.07 % Computer : n010.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 12:47:44 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.13 # AutoSched4-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.03/1.13 # and selection function SelectNewComplexAHPNS.
% 0.03/1.13 #
% 0.03/1.13 # Preprocessing time : 0.005 s
% 0.03/1.13 # Presaturation interreduction done
% 0.03/1.13
% 0.03/1.13 # No proof found!
% 0.03/1.13 # SZS status Satisfiable
% 0.03/1.13 # SZS output start Saturation.
% 0.03/1.13 cnf(c_0_0,axiom,(or(X1,n0)=X1), file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax', or_definition1)).
% 0.03/1.13 cnf(c_0_1,axiom,(and(X1,n1)=X1), file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax', and_definition2)).
% 0.03/1.13 cnf(c_0_2,axiom,(or(X1,n1)=n1), file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax', or_definition2)).
% 0.03/1.13 cnf(c_0_3,axiom,(and(X1,n0)=n0), file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax', and_definition1)).
% 0.03/1.13 cnf(c_0_4,axiom,(not(n1)=n0), file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax', not_definition2)).
% 0.03/1.13 cnf(c_0_5,axiom,(not(n0)=n1), file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax', not_definition1)).
% 0.03/1.13 cnf(c_0_6,axiom,(or(X1,n0)=X1), c_0_0).
% 0.03/1.13 cnf(c_0_7,axiom,(and(X1,n1)=X1), c_0_1).
% 0.03/1.13 cnf(c_0_8,axiom,(or(X1,n1)=n1), c_0_2).
% 0.03/1.13 cnf(c_0_9,axiom,(and(X1,n0)=n0), c_0_3).
% 0.03/1.13 cnf(c_0_10,axiom,(not(n1)=n0), c_0_4).
% 0.03/1.13 cnf(c_0_11,axiom,(not(n0)=n1), c_0_5).
% 0.03/1.13 cnf(c_0_12,plain,(or(X1,n0)=X1), c_0_6).
% 0.03/1.13 cnf(c_0_13,plain,(and(X1,n1)=X1), c_0_7).
% 0.03/1.13 cnf(c_0_14,plain,(or(X1,n1)=n1), c_0_8).
% 0.03/1.13 cnf(c_0_15,plain,(and(X1,n0)=n0), c_0_9).
% 0.03/1.13 cnf(c_0_16,plain,(not(n1)=n0), c_0_10).
% 0.03/1.13 cnf(c_0_17,plain,(not(n0)=n1), c_0_11).
% 0.03/1.13 cnf(c_0_18,plain,(or(X1,n0)=X1), c_0_12, ['final']).
% 0.03/1.13 cnf(c_0_19,plain,(and(X1,n1)=X1), c_0_13, ['final']).
% 0.03/1.13 cnf(c_0_20,plain,(or(X1,n1)=n1), c_0_14, ['final']).
% 0.03/1.13 cnf(c_0_21,plain,(and(X1,n0)=n0), c_0_15, ['final']).
% 0.03/1.13 cnf(c_0_22,plain,(not(n1)=n0), c_0_16, ['final']).
% 0.03/1.13 cnf(c_0_23,plain,(not(n0)=n1), c_0_17, ['final']).
% 0.03/1.13 # SZS output end Saturation.
% 0.03/1.13 # Parsed axioms : 6
% 0.03/1.13 # Removed by relevancy pruning/SinE : 0
% 0.03/1.13 # Initial clauses : 6
% 0.03/1.13 # Removed in clause preprocessing : 0
% 0.03/1.13 # Initial clauses in saturation : 6
% 0.03/1.13 # Processed clauses : 12
% 0.03/1.13 # ...of these trivial : 0
% 0.03/1.13 # ...subsumed : 0
% 0.03/1.13 # ...remaining for further processing : 12
% 0.03/1.13 # Other redundant clauses eliminated : 0
% 0.03/1.13 # Clauses deleted for lack of memory : 0
% 0.03/1.13 # Backward-subsumed : 0
% 0.03/1.13 # Backward-rewritten : 0
% 0.03/1.13 # Generated clauses : 0
% 0.03/1.13 # ...of the previous two non-trivial : 0
% 0.03/1.13 # Contextual simplify-reflections : 0
% 0.03/1.13 # Paramodulations : 0
% 0.03/1.13 # Factorizations : 0
% 0.03/1.13 # Equation resolutions : 0
% 0.03/1.13 # Current number of processed clauses : 6
% 0.03/1.13 # Positive orientable unit clauses : 6
% 0.03/1.13 # Positive unorientable unit clauses: 0
% 0.03/1.13 # Negative unit clauses : 0
% 0.03/1.13 # Non-unit-clauses : 0
% 0.03/1.13 # Current number of unprocessed clauses: 0
% 0.03/1.13 # ...number of literals in the above : 0
% 0.03/1.13 # Clause-clause subsumption calls (NU) : 0
% 0.03/1.13 # Rec. Clause-clause subsumption calls : 0
% 0.03/1.13 # Non-unit clause-clause subsumptions : 0
% 0.03/1.13 # Unit Clause-clause subsumption calls : 0
% 0.03/1.13 # Rewrite failures with RHS unbound : 0
% 0.03/1.13 # BW rewrite match attempts : 0
% 0.03/1.13 # BW rewrite match successes : 0
% 0.03/1.13 # Condensation attempts : 0
% 0.03/1.13 # Condensation successes : 0
% 0.03/1.13
% 0.03/1.13 # -------------------------------------------------
% 0.03/1.13 # User time : 0.005 s
% 0.03/1.13 # System time : 0.000 s
% 0.03/1.13 # Total time : 0.005 s
% 0.03/1.13 # Maximum resident set size: 2412 pages
% 0.03/1.13
% 0.03/1.13 # -------------------------------------------------
% 0.03/1.13 # User time : 0.029 s
% 0.03/1.13 # System time : 0.003 s
% 0.03/1.13 # Total time : 0.032 s
% 0.03/1.13 # Maximum resident set size: 4012 pages
% 0.03/1.13 0.02user 0.00system 0:00.03elapsed 90%CPU (0avgtext+0avgdata 16048maxresident)k
% 0.03/1.13 0inputs+936outputs (0major+2868minor)pagefaults 0swaps
%------------------------------------------------------------------------------