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