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