TSTP Solution File: ANA017-2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : ANA017-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 14 18:54:43 EDT 2022

% Result   : Unsatisfiable 0.20s 0.40s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : ANA017-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Fri Jul  8 04:08:24 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.38  # No SInE strategy applied
% 0.20/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38  #
% 0.20/0.38  # Presaturation interreduction done
% 0.20/0.38  # Number of axioms: 10 Number of unprocessed: 10
% 0.20/0.38  # Tableaux proof search.
% 0.20/0.38  # APR header successfully linked.
% 0.20/0.38  # Hello from C++
% 0.20/0.40  # The folding up rule is enabled...
% 0.20/0.40  # Local unification is enabled...
% 0.20/0.40  # Any saturation attempts will use folding labels...
% 0.20/0.40  # 10 beginning clauses after preprocessing and clausification
% 0.20/0.40  # Creating start rules for all 3 conjectures.
% 0.20/0.40  # There are 3 start rule candidates:
% 0.20/0.40  # Found 3 unit axioms.
% 0.20/0.40  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.40  # 3 start rule tableaux created.
% 0.20/0.40  # 7 extension rule candidate clauses
% 0.20/0.40  # 3 unit axiom clauses
% 0.20/0.40  
% 0.20/0.40  # Requested 8, 32 cores available to the main process.
% 0.20/0.40  # There are not enough tableaux to fork, creating more from the initial 3
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_13, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))).
% 0.20/0.40  cnf(i_0_11, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_b(X1),t_b),c_times(v_ca,c_HOL_Oabs(v_f(X1),t_b),t_b),t_b))).
% 0.20/0.40  cnf(i_0_12, negated_conjecture, (~c_lessequals(c_HOL_Oabs(c_times(v_c,v_b(v_x(X1)),t_b),t_b),c_times(X1,c_HOL_Oabs(v_f(v_x(X1)),t_b),t_b),t_b))).
% 0.20/0.40  cnf(i_0_20, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.20/0.40  cnf(i_0_18, plain, (class_OrderedGroup_Osemigroup__mult(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.20/0.40  cnf(i_0_19, plain, (class_Ring__and__Field_Opordered__semiring(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.20/0.40  cnf(i_0_14, plain, (c_lessequals(c_0,c_HOL_Oabs(X1,X2),X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))).
% 0.20/0.40  cnf(i_0_15, plain, (c_times(c_times(X1,X2,X3),X4,X3)=c_times(X1,c_times(X2,X4,X3),X3)|~class_OrderedGroup_Osemigroup__mult(X3))).
% 0.20/0.40  cnf(i_0_16, plain, (c_times(c_HOL_Oabs(X1,X2),c_HOL_Oabs(X3,X2),X2)=c_HOL_Oabs(c_times(X1,X3,X2),X2)|~class_Ring__and__Field_Oordered__idom(X2))).
% 0.20/0.40  cnf(i_0_17, plain, (c_lessequals(c_times(X1,X2,X3),c_times(X1,X4,X3),X3)|~class_Ring__and__Field_Opordered__semiring(X3)|~c_lessequals(c_0,X1,X3)|~c_lessequals(X2,X4,X3))).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 4 steps
% 0.20/0.40  cnf(i_0_13, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)), inference(start_rule)).
% 0.20/0.40  cnf(i_0_23, plain, (class_Ring__and__Field_Oordered__idom(t_b)), inference(extension_rule, [i_0_18])).
% 0.20/0.40  cnf(i_0_58, plain, (class_OrderedGroup_Osemigroup__mult(t_b)), inference(extension_rule, [i_0_15])).
% 0.20/0.40  cnf(i_0_144, plain, (c_times(c_times(X5,X6,t_b),X8,t_b)=c_times(X5,c_times(X6,X8,t_b),t_b)), inference(etableau_closure_rule, [i_0_144, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.40  # We now have 3 tableaux to operate on
% 0.20/0.40  # Found closed tableau during pool population.
% 0.20/0.40  # Proof search is over...
% 0.20/0.40  # Freeing feature tree
%------------------------------------------------------------------------------