%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA019-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 : n028.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:44 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.06/0.12 % Problem : ANA019-2 : TPTP v8.1.0. Released v3.2.0. % 0.06/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.33 % Computer : n028.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.33 % CPULimit : 300 % 0.14/0.33 % WCLimit : 600 % 0.14/0.33 % DateTime : Fri Jul 8 03:03:39 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.36 # No SInE strategy applied % 0.14/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.36 # % 0.14/0.36 # Presaturation interreduction done % 0.14/0.36 # Number of axioms: 15 Number of unprocessed: 15 % 0.14/0.36 # Tableaux proof search. % 0.14/0.36 # APR header successfully linked. % 0.14/0.36 # 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 # 15 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 5 conjectures. % 0.14/0.37 # There are 5 start rule candidates: % 0.14/0.37 # Found 4 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 5 start rule tableaux created. % 0.14/0.37 # 11 extension rule candidate clauses % 0.14/0.37 # 4 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 5 % 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_16, negated_conjecture, (v_f(c_0)=c_0)). % 0.14/0.37 cnf(i_0_20, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_a))). % 0.14/0.37 cnf(i_0_17, negated_conjecture, (c_less(c_0,v_x,t_a))). % 0.14/0.37 cnf(i_0_18, negated_conjecture, (c_lessequals(c_HOL_Oabs(v_f(c_Suc(X1)),t_a),c_times(v_x,c_HOL_Oabs(v_h(c_Suc(X1)),t_a),t_a),t_a))). % 0.14/0.37 cnf(i_0_23, plain, (c_HOL_Oabs(c_0,X1)=c_0|~class_OrderedGroup_Olordered__ab__group__abs(X1))). % 0.14/0.37 cnf(i_0_30, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.14/0.37 cnf(i_0_27, plain, (class_Orderings_Oorder(X1)|~class_LOrder_Ojoin__semilorder(X1))). % 0.14/0.37 cnf(i_0_29, plain, (class_Ring__and__Field_Opordered__cancel__semiring(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.14/0.37 cnf(i_0_28, plain, (class_LOrder_Ojoin__semilorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.14/0.37 cnf(i_0_25, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_less(X1,X2,X3))). % 0.14/0.37 cnf(i_0_22, plain, (X1=c_0|c_less(c_0,X1,tc_nat))). % 0.14/0.37 cnf(i_0_24, plain, (c_lessequals(c_0,c_HOL_Oabs(X1,X2),X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))). % 0.14/0.37 cnf(i_0_21, plain, (c_Suc(c_minus(X1,c_1,tc_nat))=X1|~c_less(c_0,X1,tc_nat))). % 0.14/0.37 cnf(i_0_19, negated_conjecture, (~c_lessequals(c_HOL_Oabs(v_f(v_xa(X1)),t_a),c_times(X1,c_HOL_Oabs(v_h(v_xa(X1)),t_a),t_a),t_a)|~c_less(c_0,X1,t_a))). % 0.14/0.37 cnf(i_0_26, plain, (c_lessequals(c_0,c_times(X1,X2,X3),X3)|~class_Ring__and__Field_Opordered__cancel__semiring(X3)|~c_lessequals(c_0,X1,X3)|~c_lessequals(c_0,X2,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_20, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_a)), inference(start_rule)). % 0.14/0.37 cnf(i_0_35, plain, (class_Ring__and__Field_Oordered__idom(t_a)), inference(extension_rule, [i_0_28])). % 0.14/0.37 cnf(i_0_120, plain, (class_LOrder_Ojoin__semilorder(t_a)), inference(extension_rule, [i_0_27])). % 0.14/0.37 cnf(i_0_166, plain, (class_Orderings_Oorder(t_a)), inference(etableau_closure_rule, [i_0_166, ...])). % 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 6 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 6 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 %------------------------------------------------------------------------------