%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU417+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 : n014.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:41 EDT 2022 % Result : Theorem 0.12s 0.40s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU417+1 : TPTP v8.1.0. Released v3.4.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n014.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jun 19 21:31:03 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Number of axioms: 56 Number of unprocessed: 56 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 56 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 26 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 30 extension rule candidate clauses % 0.12/0.37 # 26 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 36 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 36 tableaux to operate on % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 1 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 1 successful branch saturations after the branch. % 0.12/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_23, plain, (v1_xboole_0(k1_xboole_0))). % 0.12/0.40 cnf(i_0_28, plain, (v1_xboole_0(k1_xboole_0))). % 0.12/0.40 cnf(i_0_35, plain, (v1_xboole_0(esk5_0))). % 0.12/0.40 cnf(i_0_22, plain, (v1_relat_1(k1_xboole_0))). % 0.12/0.40 cnf(i_0_27, plain, (v1_relat_1(k1_xboole_0))). % 0.12/0.40 cnf(i_0_34, plain, (v1_relat_1(esk5_0))). % 0.12/0.40 cnf(i_0_38, plain, (v1_relat_1(esk7_0))). % 0.12/0.40 cnf(i_0_43, plain, (v1_relat_1(esk9_0))). % 0.12/0.40 cnf(i_0_21, plain, (v3_relat_1(k1_xboole_0))). % 0.12/0.40 cnf(i_0_42, plain, (v3_relat_1(esk9_0))). % 0.12/0.40 cnf(i_0_39, plain, (~v1_xboole_0(esk7_0))). % 0.12/0.40 cnf(i_0_58, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 0.12/0.40 cnf(i_0_40, plain, (v1_xboole_0(esk8_1(X1)))). % 0.12/0.40 cnf(i_0_5, plain, (v1_relat_1(X1)|~v1_xboole_0(X1))). % 0.12/0.40 cnf(i_0_51, plain, (k3_xboole_0(X1,k1_xboole_0)=k1_xboole_0)). % 0.12/0.40 cnf(i_0_48, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)). % 0.12/0.40 cnf(i_0_47, plain, (r1_tarski(X1,X1))). % 0.12/0.40 cnf(i_0_30, plain, (k2_xboole_0(X1,X1)=X1)). % 0.12/0.40 cnf(i_0_31, plain, (k3_xboole_0(X1,X1)=X1)). % 0.12/0.40 cnf(i_0_60, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 0.12/0.40 cnf(i_0_25, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 0.12/0.40 cnf(i_0_20, plain, (m1_subset_1(esk4_1(X1),X1))). % 0.12/0.40 cnf(i_0_36, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk6_1(X1)))). % 0.12/0.40 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))))). % 0.12/0.40 cnf(i_0_2, negated_conjecture, (m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))))). % 0.12/0.40 cnf(i_0_41, plain, (m1_subset_1(esk8_1(X1),k1_zfmisc_1(X1)))). % 0.12/0.40 cnf(i_0_7, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))). % 0.12/0.40 cnf(i_0_8, plain, (k3_xboole_0(X1,X2)=k3_xboole_0(X2,X1))). % 0.12/0.40 cnf(i_0_59, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 0.12/0.40 cnf(i_0_37, plain, (v1_xboole_0(X1)|m1_subset_1(esk6_1(X1),k1_zfmisc_1(X1)))). % 0.12/0.40 cnf(i_0_49, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 0.12/0.40 cnf(i_0_52, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 0.12/0.40 cnf(i_0_53, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 0.12/0.40 cnf(i_0_26, plain, (v1_relat_1(k2_xboole_0(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 0.12/0.40 cnf(i_0_24, plain, (v1_relat_1(k3_xboole_0(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 0.12/0.40 cnf(i_0_4, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 0.12/0.40 cnf(i_0_54, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_57, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.12/0.40 cnf(i_0_50, plain, (r1_tarski(k3_xboole_0(X1,X2),k2_xboole_0(X1,X3)))). % 0.12/0.40 cnf(i_0_55, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 0.12/0.40 cnf(i_0_18, plain, (m1_subset_1(k8_setfam_1(X2,X1),k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_33, plain, (k5_subset_1(X2,X1,X1)=X1|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_32, plain, (k4_subset_1(X2,X1,X1)=X1|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_46, plain, (k5_subset_1(X2,X1,X3)=k3_xboole_0(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_45, plain, (k4_subset_1(X2,X1,X3)=k2_xboole_0(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_29, plain, (k1_relset_2(X2,X1,X1)=X1|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_44, plain, (k1_relset_2(X2,X1,X3)=k3_xboole_0(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_10, plain, (k5_subset_1(X2,X1,X3)=k5_subset_1(X2,X3,X1)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_9, plain, (k4_subset_1(X2,X1,X3)=k4_subset_1(X2,X3,X1)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_17, plain, (m1_subset_1(k5_subset_1(X2,X1,X3),k1_zfmisc_1(X2))|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_16, plain, (m1_subset_1(k4_subset_1(X2,X1,X3),k1_zfmisc_1(X2))|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 0.12/0.40 cnf(i_0_56, plain, (r1_tarski(k8_setfam_1(X2,X3),k8_setfam_1(X2,X1))|~r1_tarski(X1,X3)|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_6, plain, (k1_relset_2(X2,X1,X3)=k1_relset_2(X2,X3,X1)|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_11, plain, (m1_subset_1(k1_relset_2(X2,X1,X3),k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_61, plain, (k8_setfam_1(X2,X1)=k5_subset_1(X2,k8_setfam_1(X2,X3),k8_setfam_1(X2,X4))|X1!=k4_subset_1(k1_zfmisc_1(X2),X3,X4)|~m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 0.12/0.40 cnf(i_0_1, negated_conjecture, (~r1_tarski(k5_subset_1(esk1_0,k8_setfam_1(esk1_0,esk2_0),k8_setfam_1(esk1_0,esk3_0)),k8_setfam_1(esk1_0,k1_relset_2(esk1_0,esk2_0,esk3_0))))). % 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 6 steps % 0.12/0.40 cnf(i_0_2, negated_conjecture, (m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))), inference(start_rule)). % 0.12/0.40 cnf(i_0_63, plain, (m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))), inference(extension_rule, [i_0_11])). % 0.12/0.40 cnf(i_0_224, plain, (~m1_subset_1(esk4_1(k1_zfmisc_1(k1_zfmisc_1(esk1_0))),k1_zfmisc_1(k1_zfmisc_1(esk1_0)))), inference(closure_rule, [i_0_20])). % 0.12/0.40 cnf(i_0_223, plain, (m1_subset_1(k1_relset_2(esk1_0,esk3_0,esk4_1(k1_zfmisc_1(k1_zfmisc_1(esk1_0)))),k1_zfmisc_1(k1_zfmisc_1(esk1_0)))), inference(extension_rule, [i_0_52])). % 0.12/0.40 cnf(i_0_246, plain, (v1_xboole_0(k1_zfmisc_1(k1_zfmisc_1(esk1_0)))), inference(closure_rule, [i_0_25])). % 0.12/0.40 cnf(i_0_247, plain, (r2_hidden(k1_relset_2(esk1_0,esk3_0,esk4_1(k1_zfmisc_1(k1_zfmisc_1(esk1_0)))),k1_zfmisc_1(k1_zfmisc_1(esk1_0)))), inference(etableau_closure_rule, [i_0_247, ...])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 1 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 1 successful branch saturations after the branch. % 0.12/0.40 # Child (15441) has found a proof. % 0.12/0.40 % 0.12/0.40 # Proof search is over... % 0.12/0.40 # Freeing feature tree %------------------------------------------------------------------------------