TSTP Solution File: ANA014-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA014-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 : n003.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:41 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.13/0.13 % Problem : ANA014-2 : TPTP v8.1.0. Released v3.2.0.
% 0.13/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 : n003.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 05:58:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 13 Number of unprocessed: 13
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # 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 3 conjectures.
% 0.13/0.38 # There are 3 start rule candidates:
% 0.13/0.38 # Found 3 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 3 start rule tableaux created.
% 0.13/0.38 # 10 extension rule candidate clauses
% 0.13/0.38 # 3 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 3
% 0.13/0.38 # There were 1 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 1 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 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/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_16, negated_conjecture, (class_Ring__and__Field_Oordered__field(t_a))).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (v_c!=c_0)).
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (~c_lessequals(c_HOL_Oabs(v_f(v_x(X1)),t_a),c_times(X1,c_times(c_HOL_Oabs(v_c,t_a),c_HOL_Oabs(v_f(v_x(X1)),t_a),t_a),t_a),t_a))).
% 0.13/0.38 cnf(i_0_26, plain, (class_Orderings_Oorder(X1)|~class_Ring__and__Field_Oordered__field(X1))).
% 0.13/0.38 cnf(i_0_25, plain, (class_Ring__and__Field_Oordered__idom(X1)|~class_Ring__and__Field_Oordered__field(X1))).
% 0.13/0.38 cnf(i_0_24, plain, (class_Ring__and__Field_Ofield(X1)|~class_Ring__and__Field_Oordered__field(X1))).
% 0.13/0.38 cnf(i_0_22, plain, (class_OrderedGroup_Omonoid__mult(X1)|~class_Ring__and__Field_Ofield(X1))).
% 0.13/0.38 cnf(i_0_23, plain, (class_OrderedGroup_Osemigroup__mult(X1)|~class_Ring__and__Field_Ofield(X1))).
% 0.13/0.38 cnf(i_0_19, plain, (c_lessequals(X1,X1,X2)|~class_Orderings_Oorder(X2))).
% 0.13/0.38 cnf(i_0_17, plain, (c_times(c_1,X1,X2)=X1|~class_OrderedGroup_Omonoid__mult(X2))).
% 0.13/0.38 cnf(i_0_21, plain, (c_times(c_HOL_Oinverse(X1,X2),X1,X2)=c_1|X1=c_0|~class_Ring__and__Field_Ofield(X2))).
% 0.13/0.38 cnf(i_0_18, 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_20, 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.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 4 steps
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (class_Ring__and__Field_Oordered__field(t_a)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_29, plain, (class_Ring__and__Field_Oordered__field(t_a)), inference(extension_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_76, plain, (class_Ring__and__Field_Ofield(t_a)), inference(extension_rule, [i_0_22])).
% 0.13/0.38 cnf(i_0_99, plain, (class_OrderedGroup_Omonoid__mult(t_a)), inference(etableau_closure_rule, [i_0_99, ...])).
% 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 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 4 tableaux to operate on
% 0.13/0.38 # Found closed tableau during pool population.
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------