TSTP Solution File: ANA018-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA018-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:43 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ANA018-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.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 03:00:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 13 Number of unprocessed: 13
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 13 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 5 conjectures.
% 0.13/0.38 # There are 5 start rule candidates:
% 0.13/0.38 # Found 5 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 5 start rule tableaux created.
% 0.13/0.38 # 8 extension rule candidate clauses
% 0.13/0.38 # 5 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 5
% 0.13/0.38 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 10 tableaux to operate on
% 0.13/0.38 # There were 2 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 2 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 2 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_18, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))).
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_less(c_0,v_ca,t_b))).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_f(X1),t_b),c_times(v_c,c_HOL_Oabs(v_g(X1),t_b),t_b),t_b))).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_x(X1),t_b),c_times(v_ca,c_HOL_Oabs(v_f(X1),t_b),t_b),t_b))).
% 0.13/0.38 cnf(i_0_17, negated_conjecture, (~c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(c_times(v_ca,v_c,t_b),c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b))).
% 0.13/0.38 cnf(i_0_24, plain, (class_OrderedGroup_Osemigroup__mult(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.13/0.38 cnf(i_0_26, plain, (class_Ring__and__Field_Opordered__semiring(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.13/0.38 cnf(i_0_23, plain, (class_Orderings_Oorder(X1)|~class_LOrder_Ojoin__semilorder(X1))).
% 0.13/0.38 cnf(i_0_25, plain, (class_LOrder_Ojoin__semilorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 0.13/0.38 cnf(i_0_21, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_less(X1,X2,X3))).
% 0.13/0.38 cnf(i_0_20, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_lessequals(X1,X4,X3)|~c_lessequals(X4,X2,X3))).
% 0.13/0.38 cnf(i_0_19, 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.13/0.38 cnf(i_0_22, 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.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 6 steps
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(v_ca,c_HOL_Oabs(v_f(v_xa),t_b),t_b),t_b)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_28, plain, (c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(v_ca,c_HOL_Oabs(v_f(v_xa),t_b),t_b),t_b)), inference(extension_rule, [i_0_20])).
% 0.13/0.38 cnf(i_0_64, plain, (c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(c_times(v_ca,v_c,t_b),c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b)), inference(closure_rule, [i_0_17])).
% 0.13/0.38 cnf(i_0_65, plain, (~class_Orderings_Oorder(t_b)), inference(extension_rule, [i_0_23])).
% 0.13/0.38 cnf(i_0_67, plain, (~c_lessequals(c_times(v_ca,c_HOL_Oabs(v_f(v_xa),t_b),t_b),c_times(c_times(v_ca,v_c,t_b),c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b)), inference(etableau_closure_rule, [i_0_67, ...])).
% 0.13/0.38 cnf(i_0_100, plain, (~class_LOrder_Ojoin__semilorder(t_b)), inference(etableau_closure_rule, [i_0_100, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (12818) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------