%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA034-10 : TPTP v8.1.0. Released v7.3.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 : n018.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:55 EDT 2022 % Result : Unsatisfiable 0.13s 0.40s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : ANA034-10 : TPTP v8.1.0. Released v7.3.0. % 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n018.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 8 03:50:40 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 17 Number of unprocessed: 17 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 17 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 6 conjectures. % 0.13/0.36 # There are 6 start rule candidates: % 0.13/0.36 # Found 17 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 6 start rule tableaux created. % 0.13/0.36 # 0 extension rule candidate clauses % 0.13/0.36 # 17 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.36 # Creating equality axioms % 0.13/0.36 # Ran out of tableaux, making start rules for all clauses % 0.13/0.36 # Returning from population with 47 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 47 tableaux to operate on % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_30, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)). % 0.13/0.40 cnf(i_0_25, negated_conjecture, (c_less(c_0,v_c,t_b)=true)). % 0.13/0.40 cnf(i_0_26, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_a(v_x),t_b),c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b)=true)). % 0.13/0.40 cnf(i_0_27, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_b(v_x),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b)=true)). % 0.13/0.40 cnf(i_0_18, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 0.13/0.40 cnf(i_0_19, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.13/0.40 cnf(i_0_33, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Ring__and__Field_Opordered__semiring(X1),true)=true)). % 0.13/0.40 cnf(i_0_32, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Ring__and__Field_Opordered__cancel__semiring(X1),true)=true)). % 0.13/0.40 cnf(i_0_34, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Olordered__ab__group__abs(X1),true)=true)). % 0.13/0.40 cnf(i_0_31, plain, (ifeq(class_OrderedGroup_Olordered__ab__group__abs(X1),true,class_Orderings_Oorder(X1),true)=true)). % 0.13/0.40 cnf(i_0_24, plain, (ifeq(class_OrderedGroup_Olordered__ab__group__abs(X1),true,c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1),true)=true)). % 0.13/0.40 cnf(i_0_28, negated_conjecture, (c_times(c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b)=c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b))). % 0.13/0.40 cnf(i_0_23, plain, (ifeq(c_less(X1,X2,X3),true,ifeq(class_Orderings_Oorder(X3),true,c_lessequals(X1,X2,X3),true),true)=true)). % 0.13/0.40 cnf(i_0_22, plain, (ifeq(class_Ring__and__Field_Opordered__cancel__semiring(X1),true,ifeq(c_lessequals(c_0,X2,X1),true,ifeq(c_lessequals(c_0,X3,X1),true,c_lessequals(c_0,c_times(X2,X3,X1),X1),true),true),true)=true)). % 0.13/0.40 cnf(i_0_20, plain, (ifeq2(class_Ring__and__Field_Oordered__idom(X1),true,c_times(c_HOL_Oabs(X2,X1),c_HOL_Oabs(X3,X1),X1),c_HOL_Oabs(c_times(X2,X3,X1),X1))=c_HOL_Oabs(c_times(X2,X3,X1),X1))). % 0.13/0.40 cnf(i_0_21, plain, (ifeq(c_lessequals(c_0,X1,X2),true,ifeq(c_lessequals(c_0,X3,X2),true,ifeq(c_lessequals(X4,X1,X2),true,ifeq(c_lessequals(X3,X5,X2),true,ifeq(class_Ring__and__Field_Opordered__semiring(X2),true,c_lessequals(c_times(X4,X3,X2),c_times(X1,X5,X2),X2),true),true),true),true),true)=true)). % 0.13/0.40 cnf(i_0_29, negated_conjecture, (c_lessequals(c_HOL_Oabs(c_times(v_a(v_x),v_b(v_x),t_b),t_b),c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b),t_b)!=true)). % 0.13/0.40 cnf(i_0_41, plain, (X6=X6)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_30, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)). % 0.13/0.40 cnf(i_0_60, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_56])). % 0.13/0.40 cnf(i_0_120, plain, (v_a(class_Ring__and__Field_Oordered__idom(t_b))=v_a(true)), inference(extension_rule, [i_0_45])). % 0.13/0.40 cnf(i_0_324, plain, (class_Ring__and__Field_Oordered__idom(t_b)!=true), inference(closure_rule, [i_0_30])). % 0.13/0.40 cnf(i_0_325, plain, (class_Ring__and__Field_Oordered__idom(t_b)!=true), inference(closure_rule, [i_0_30])). % 0.13/0.40 cnf(i_0_326, plain, (class_Ring__and__Field_Oordered__idom(t_b)!=true), inference(closure_rule, [i_0_30])). % 0.13/0.40 cnf(i_0_322, plain, (ifeq2(v_a(class_Ring__and__Field_Oordered__idom(t_b)),class_Ring__and__Field_Oordered__idom(t_b),class_Ring__and__Field_Oordered__idom(t_b),class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(v_a(true),true,true,true)), inference(etableau_closure_rule, [i_0_322, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (17802) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------