%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU430+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 : n011.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 : Tue Jul 19 09:26:55 EDT 2022 % Result : Theorem 0.20s 0.42s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU430+1 : TPTP v8.1.0. Released v3.4.0. % 0.04/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.33 % Computer : n011.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 : Mon Jun 20 12:47:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.20/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.37 # % 0.20/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 43 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 4 conjectures. % 0.20/0.37 # There are 4 start rule candidates: % 0.20/0.37 # Found 17 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 4 start rule tableaux created. % 0.20/0.37 # 26 extension rule candidate clauses % 0.20/0.37 # 17 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.20/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 12 tableaux to operate on % 0.20/0.42 # There were 2 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 2 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 2 successful branch saturations after the branch. % 0.20/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_23, plain, (v1_xboole_0(k1_xboole_0))). % 0.20/0.42 cnf(i_0_26, plain, (v1_xboole_0(k1_xboole_0))). % 0.20/0.42 cnf(i_0_28, plain, (v1_xboole_0(esk9_0))). % 0.20/0.42 cnf(i_0_22, plain, (v1_relat_1(k1_xboole_0))). % 0.20/0.42 cnf(i_0_25, plain, (v1_relat_1(k1_xboole_0))). % 0.20/0.42 cnf(i_0_27, plain, (v1_relat_1(esk9_0))). % 0.20/0.42 cnf(i_0_31, plain, (v1_relat_1(esk11_0))). % 0.20/0.42 cnf(i_0_36, plain, (v1_relat_1(esk13_0))). % 0.20/0.42 cnf(i_0_21, plain, (v3_relat_1(k1_xboole_0))). % 0.20/0.42 cnf(i_0_35, plain, (v3_relat_1(esk13_0))). % 0.20/0.42 cnf(i_0_32, plain, (~v1_xboole_0(esk11_0))). % 0.20/0.42 cnf(i_0_45, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.20/0.42 cnf(i_0_33, plain, (v1_xboole_0(esk12_1(X1)))). % 0.20/0.42 cnf(i_0_6, plain, (v1_relat_1(X1)|~v1_xboole_0(X1))). % 0.20/0.42 cnf(i_0_38, plain, (r1_tarski(X1,X1))). % 0.20/0.42 cnf(i_0_47, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.20/0.42 cnf(i_0_24, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 0.20/0.42 cnf(i_0_2, negated_conjecture, (esk3_0!=k1_xboole_0|k5_setfam_1(esk1_0,esk2_0)!=k1_xboole_0)). % 0.20/0.42 cnf(i_0_20, plain, (m1_subset_1(esk8_1(X1),X1))). % 0.20/0.42 cnf(i_0_29, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk10_1(X1)))). % 0.20/0.42 cnf(i_0_7, plain, (X1=k1_xboole_0|r2_hidden(esk4_1(X1),X1))). % 0.20/0.42 cnf(i_0_4, negated_conjecture, (m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))))). % 0.20/0.42 cnf(i_0_8, plain, (X1!=k1_xboole_0|~r2_hidden(X2,X1))). % 0.20/0.42 cnf(i_0_34, plain, (m1_subset_1(esk12_1(X1),k1_zfmisc_1(X1)))). % 0.20/0.42 cnf(i_0_3, negated_conjecture, (r2_hidden(esk3_0,esk2_0)|k5_setfam_1(esk1_0,esk2_0)!=k1_xboole_0)). % 0.20/0.42 cnf(i_0_46, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 0.20/0.42 cnf(i_0_30, plain, (v1_xboole_0(X1)|m1_subset_1(esk10_1(X1),k1_zfmisc_1(X1)))). % 0.20/0.42 cnf(i_0_1, negated_conjecture, (X1=k1_xboole_0|k5_setfam_1(esk1_0,esk2_0)=k1_xboole_0|~r2_hidden(X1,esk2_0))). % 0.20/0.42 cnf(i_0_39, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.20/0.42 cnf(i_0_40, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 0.20/0.42 cnf(i_0_41, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.20/0.42 cnf(i_0_5, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 0.20/0.42 cnf(i_0_42, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.20/0.42 cnf(i_0_44, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.20/0.42 cnf(i_0_12, plain, (r2_hidden(X1,X4)|X4!=k3_tarski(X3)|~r2_hidden(X2,X3)|~r2_hidden(X1,X2))). % 0.20/0.42 cnf(i_0_43, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.20/0.42 cnf(i_0_37, plain, (k5_setfam_1(X2,X1)=k3_tarski(X1)|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.20/0.42 cnf(i_0_9, plain, (X2=k3_tarski(X1)|r2_hidden(esk6_2(X1,X2),X2)|r2_hidden(esk7_2(X1,X2),X1))). % 0.20/0.42 cnf(i_0_18, plain, (m1_subset_1(k5_setfam_1(X2,X1),k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.20/0.42 cnf(i_0_10, plain, (X2=k3_tarski(X1)|r2_hidden(esk6_2(X1,X2),X2)|r2_hidden(esk6_2(X1,X2),esk7_2(X1,X2)))). % 0.20/0.42 cnf(i_0_14, plain, (r2_hidden(X1,esk5_3(X2,X3,X1))|X3!=k3_tarski(X2)|~r2_hidden(X1,X3))). % 0.20/0.42 cnf(i_0_13, plain, (r2_hidden(esk5_3(X1,X2,X3),X1)|X2!=k3_tarski(X1)|~r2_hidden(X3,X2))). % 0.20/0.42 cnf(i_0_11, plain, (X2=k3_tarski(X1)|~r2_hidden(X3,X1)|~r2_hidden(esk6_2(X1,X2),X3)|~r2_hidden(esk6_2(X1,X2),X2))). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 5 steps % 0.20/0.42 cnf(i_0_3, negated_conjecture, (r2_hidden(esk3_0,esk2_0)|k5_setfam_1(esk1_0,esk2_0)!=k1_xboole_0), inference(start_rule)). % 0.20/0.42 cnf(i_0_51, plain, (r2_hidden(esk3_0,esk2_0)), inference(extension_rule, [i_0_8])). % 0.20/0.42 cnf(i_0_197, plain, (esk2_0!=k1_xboole_0), inference(extension_rule, [i_0_45])). % 0.20/0.42 cnf(i_0_52, plain, (k5_setfam_1(esk1_0,esk2_0)!=k1_xboole_0), inference(etableau_closure_rule, [i_0_52, ...])). % 0.20/0.42 cnf(i_0_200, plain, (~v1_xboole_0(esk2_0)), inference(etableau_closure_rule, [i_0_200, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # Child (18351) has found a proof. % 0.20/0.42 % 0.20/0.42 # Proof search is over... % 0.20/0.42 # Freeing feature tree %------------------------------------------------------------------------------