%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG227+1 : TPTP v8.1.0. Released v3.4.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 : n026.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 16:52:10 EDT 2022 % Result : Theorem 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : ALG227+1 : TPTP v8.1.0. Released v3.4.0. % 0.06/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 : n026.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 : Wed Jun 8 09:23:02 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.13/0.37 # and selection function SelectComplexG. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 46 Number of unprocessed: 46 % 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.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 46 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 5 conjectures. % 0.13/0.37 # There are 5 start rule candidates: % 0.13/0.37 # Found 26 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 5 start rule tableaux created. % 0.13/0.37 # 20 extension rule candidate clauses % 0.13/0.37 # 26 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 5 % 0.13/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 15 tableaux to operate on % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_23, plain, (v1_xboole_0(k1_xboole_0))). % 0.20/0.38 cnf(i_0_4, negated_conjecture, (m1_pboole(esk2_0,esk1_0))). % 0.20/0.38 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk3_0,esk1_0))). % 0.20/0.38 cnf(i_0_33, plain, (v1_xboole_0(esk7_0))). % 0.20/0.38 cnf(i_0_38, plain, (v1_xboole_0(esk10_0))). % 0.20/0.38 cnf(i_0_40, plain, (v1_xboole_0(esk11_0))). % 0.20/0.38 cnf(i_0_28, plain, (v1_fraenkel(esk7_0))). % 0.20/0.38 cnf(i_0_29, plain, (v1_finset_1(esk7_0))). % 0.20/0.38 cnf(i_0_34, plain, (v1_finset_1(esk8_0))). % 0.20/0.38 cnf(i_0_31, plain, (v1_funct_1(esk7_0))). % 0.20/0.38 cnf(i_0_36, plain, (v1_funct_1(esk9_0))). % 0.20/0.38 cnf(i_0_39, plain, (v1_funct_1(esk11_0))). % 0.20/0.38 cnf(i_0_44, plain, (v1_funct_1(esk13_0))). % 0.20/0.38 cnf(i_0_32, plain, (v1_relat_1(esk7_0))). % 0.20/0.38 cnf(i_0_37, plain, (v1_relat_1(esk9_0))). % 0.20/0.38 cnf(i_0_41, plain, (v1_relat_1(esk11_0))). % 0.20/0.38 cnf(i_0_45, plain, (v1_relat_1(esk13_0))). % 0.20/0.38 cnf(i_0_30, plain, (v2_funct_1(esk7_0))). % 0.20/0.38 cnf(i_0_43, plain, (v2_funct_1(esk13_0))). % 0.20/0.38 cnf(i_0_21, plain, (m1_pboole(esk4_1(X1),X1))). % 0.20/0.38 cnf(i_0_22, plain, (m1_subset_1(esk5_1(X1),X1))). % 0.20/0.38 cnf(i_0_5, negated_conjecture, (~v1_xboole_0(esk1_0))). % 0.20/0.38 cnf(i_0_1, negated_conjecture, (k1_funct_1(esk2_0,esk3_0)!=k1_xboole_0)). % 0.20/0.38 cnf(i_0_35, plain, (~v1_xboole_0(esk8_0))). % 0.20/0.38 cnf(i_0_42, plain, (~v1_xboole_0(esk12_0))). % 0.20/0.38 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk3_0,k1_closure3(esk1_0,esk2_0)))). % 0.20/0.38 cnf(i_0_50, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_51, plain, (~r2_hidden(X1,X2)|~v1_xboole_0(X2))). % 0.20/0.38 cnf(i_0_7, plain, (v1_fraenkel(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_8, plain, (v1_finset_1(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_9, plain, (v1_funct_1(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_6, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))). % 0.20/0.38 cnf(i_0_18, plain, (v1_funct_1(X1)|~m1_pboole(X1,X2))). % 0.20/0.38 cnf(i_0_19, plain, (v1_relat_1(X1)|~m1_pboole(X1,X2))). % 0.20/0.38 cnf(i_0_46, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.20/0.38 cnf(i_0_52, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_47, plain, (r2_hidden(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(X1,X2))). % 0.20/0.38 cnf(i_0_10, plain, (v2_funct_1(X1)|~v1_relat_1(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_13, plain, (X1=k1_closure3(X2,X3)|v1_xboole_0(X2)|X1!=a_2_0_closure3(X2,X3)|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_14, plain, (X1=a_2_0_closure3(X2,X3)|v1_xboole_0(X2)|X1!=k1_closure3(X2,X3)|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_49, plain, (X1=X2|~r2_hidden(esk14_2(X1,X2),X2)|~r2_hidden(esk14_2(X1,X2),X1))). % 0.20/0.38 cnf(i_0_25, plain, (v1_xboole_0(X1)|k1_funct_1(X2,esk6_3(X3,X1,X2))!=k1_xboole_0|~r2_hidden(X3,a_2_0_closure3(X1,X2))|~m1_pboole(X2,X1))). % 0.20/0.38 cnf(i_0_26, plain, (esk6_3(X1,X2,X3)=X1|v1_xboole_0(X2)|~r2_hidden(X1,a_2_0_closure3(X2,X3))|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_27, plain, (m1_subset_1(esk6_3(X1,X2,X3),X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_2_0_closure3(X2,X3))|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_48, plain, (X1=X2|r2_hidden(esk14_2(X1,X2),X1)|r2_hidden(esk14_2(X1,X2),X2))). % 0.20/0.38 cnf(i_0_24, plain, (k1_funct_1(X1,X2)=k1_xboole_0|r2_hidden(X2,a_2_0_closure3(X3,X1))|v1_xboole_0(X3)|~m1_subset_1(X2,X3)|~m1_pboole(X1,X3))). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 5 steps % 0.20/0.38 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk3_0,esk1_0)), inference(start_rule)). % 0.20/0.38 cnf(i_0_57, plain, (m1_subset_1(esk3_0,esk1_0)), inference(extension_rule, [i_0_47])). % 0.20/0.38 cnf(i_0_255, plain, (v1_xboole_0(esk1_0)), inference(closure_rule, [i_0_5])). % 0.20/0.38 cnf(i_0_254, plain, (r2_hidden(esk3_0,esk1_0)), inference(extension_rule, [i_0_6])). % 0.20/0.38 cnf(i_0_268, plain, (~r2_hidden(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_268, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_23, plain, (v1_xboole_0(k1_xboole_0))). % 0.20/0.38 cnf(i_0_4, negated_conjecture, (m1_pboole(esk2_0,esk1_0))). % 0.20/0.38 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk3_0,esk1_0))). % 0.20/0.38 cnf(i_0_33, plain, (v1_xboole_0(esk7_0))). % 0.20/0.38 cnf(i_0_38, plain, (v1_xboole_0(esk10_0))). % 0.20/0.38 cnf(i_0_40, plain, (v1_xboole_0(esk11_0))). % 0.20/0.38 cnf(i_0_28, plain, (v1_fraenkel(esk7_0))). % 0.20/0.38 cnf(i_0_29, plain, (v1_finset_1(esk7_0))). % 0.20/0.38 cnf(i_0_34, plain, (v1_finset_1(esk8_0))). % 0.20/0.38 cnf(i_0_31, plain, (v1_funct_1(esk7_0))). % 0.20/0.38 cnf(i_0_36, plain, (v1_funct_1(esk9_0))). % 0.20/0.38 cnf(i_0_39, plain, (v1_funct_1(esk11_0))). % 0.20/0.38 cnf(i_0_44, plain, (v1_funct_1(esk13_0))). % 0.20/0.38 cnf(i_0_32, plain, (v1_relat_1(esk7_0))). % 0.20/0.38 cnf(i_0_37, plain, (v1_relat_1(esk9_0))). % 0.20/0.38 cnf(i_0_41, plain, (v1_relat_1(esk11_0))). % 0.20/0.38 cnf(i_0_45, plain, (v1_relat_1(esk13_0))). % 0.20/0.38 cnf(i_0_30, plain, (v2_funct_1(esk7_0))). % 0.20/0.38 cnf(i_0_43, plain, (v2_funct_1(esk13_0))). % 0.20/0.38 cnf(i_0_21, plain, (m1_pboole(esk4_1(X1),X1))). % 0.20/0.38 cnf(i_0_22, plain, (m1_subset_1(esk5_1(X1),X1))). % 0.20/0.38 cnf(i_0_5, negated_conjecture, (~v1_xboole_0(esk1_0))). % 0.20/0.38 cnf(i_0_1, negated_conjecture, (k1_funct_1(esk2_0,esk3_0)!=k1_xboole_0)). % 0.20/0.38 cnf(i_0_35, plain, (~v1_xboole_0(esk8_0))). % 0.20/0.38 cnf(i_0_42, plain, (~v1_xboole_0(esk12_0))). % 0.20/0.38 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk3_0,k1_closure3(esk1_0,esk2_0)))). % 0.20/0.38 cnf(i_0_50, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_51, plain, (~r2_hidden(X1,X2)|~v1_xboole_0(X2))). % 0.20/0.38 cnf(i_0_7, plain, (v1_fraenkel(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_8, plain, (v1_finset_1(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_9, plain, (v1_funct_1(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_6, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))). % 0.20/0.38 cnf(i_0_18, plain, (v1_funct_1(X1)|~m1_pboole(X1,X2))). % 0.20/0.38 cnf(i_0_19, plain, (v1_relat_1(X1)|~m1_pboole(X1,X2))). % 0.20/0.38 cnf(i_0_46, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.20/0.38 cnf(i_0_52, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_47, plain, (r2_hidden(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(X1,X2))). % 0.20/0.38 cnf(i_0_10, plain, (v2_funct_1(X1)|~v1_relat_1(X1)|~v1_xboole_0(X1))). % 0.20/0.38 cnf(i_0_13, plain, (X1=k1_closure3(X2,X3)|v1_xboole_0(X2)|X1!=a_2_0_closure3(X2,X3)|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_14, plain, (X1=a_2_0_closure3(X2,X3)|v1_xboole_0(X2)|X1!=k1_closure3(X2,X3)|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_49, plain, (X1=X2|~r2_hidden(esk14_2(X1,X2),X2)|~r2_hidden(esk14_2(X1,X2),X1))). % 0.20/0.38 cnf(i_0_25, plain, (v1_xboole_0(X1)|k1_funct_1(X2,esk6_3(X3,X1,X2))!=k1_xboole_0|~r2_hidden(X3,a_2_0_closure3(X1,X2))|~m1_pboole(X2,X1))). % 0.20/0.38 cnf(i_0_26, plain, (esk6_3(X1,X2,X3)=X1|v1_xboole_0(X2)|~r2_hidden(X1,a_2_0_closure3(X2,X3))|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_27, plain, (m1_subset_1(esk6_3(X1,X2,X3),X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_2_0_closure3(X2,X3))|~m1_pboole(X3,X2))). % 0.20/0.38 cnf(i_0_48, plain, (X1=X2|r2_hidden(esk14_2(X1,X2),X1)|r2_hidden(esk14_2(X1,X2),X2))). % 0.20/0.38 cnf(i_0_24, plain, (k1_funct_1(X1,X2)=k1_xboole_0|r2_hidden(X2,a_2_0_closure3(X3,X1))|v1_xboole_0(X3)|~m1_subset_1(X2,X3)|~m1_pboole(X1,X3))). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 7 steps % 0.20/0.38 cnf(i_0_5, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(start_rule)). % 0.20/0.38 cnf(i_0_56, plain, (~v1_xboole_0(esk1_0)), inference(extension_rule, [i_0_24])). % 0.20/0.38 cnf(i_0_228, plain, (k1_funct_1(esk2_0,esk3_0)=k1_xboole_0), inference(closure_rule, [i_0_1])). % 0.20/0.38 cnf(i_0_231, plain, (~m1_subset_1(esk3_0,esk1_0)), inference(closure_rule, [i_0_3])). % 0.20/0.38 cnf(i_0_232, plain, (~m1_pboole(esk2_0,esk1_0)), inference(closure_rule, [i_0_4])). % 0.20/0.38 cnf(i_0_229, plain, (r2_hidden(esk3_0,a_2_0_closure3(esk1_0,esk2_0))), inference(extension_rule, [i_0_51])). % 0.20/0.38 cnf(i_0_236, plain, (~v1_xboole_0(a_2_0_closure3(esk1_0,esk2_0))), inference(etableau_closure_rule, [i_0_236, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (7097) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------