%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU427+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 : n022.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:52 EDT 2022 % Result : Theorem 8.30s 1.45s % Output : CNFRefutation 8.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU427+1 : TPTP v8.1.0. Released v3.4.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.13/0.34 % Computer : n022.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 20 08:35:46 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y % 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 70 Number of unprocessed: 70 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 70 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 5 conjectures. % 0.20/0.38 # There are 5 start rule candidates: % 0.20/0.38 # Found 33 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 5 start rule tableaux created. % 0.20/0.38 # 37 extension rule candidate clauses % 0.20/0.38 # 33 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 5 % 0.20/0.38 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 26 tableaux to operate on % 8.30/1.45 # There were 1 total branch saturation attempts. % 8.30/1.45 # There were 0 of these attempts blocked. % 8.30/1.45 # There were 0 deferred branch saturation attempts. % 8.30/1.45 # There were 0 free duplicated saturations. % 8.30/1.45 # There were 1 total successful branch saturations. % 8.30/1.45 # There were 0 successful branch saturations in interreduction. % 8.30/1.45 # There were 0 successful branch saturations on the branch. % 8.30/1.45 # There were 1 successful branch saturations after the branch. % 8.30/1.45 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.30/1.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.30/1.45 # Begin clausification derivation % 8.30/1.45 % 8.30/1.45 # End clausification derivation % 8.30/1.45 # Begin listing active clauses obtained from FOF to CNF conversion % 8.30/1.45 cnf(i_0_38, plain, (v1_xboole_0(k1_xboole_0))). % 8.30/1.45 cnf(i_0_43, plain, (v1_xboole_0(k1_xboole_0))). % 8.30/1.45 cnf(i_0_48, plain, (v1_xboole_0(esk10_0))). % 8.30/1.45 cnf(i_0_37, plain, (v1_relat_1(k1_xboole_0))). % 8.30/1.45 cnf(i_0_42, plain, (v1_relat_1(k1_xboole_0))). % 8.30/1.45 cnf(i_0_47, plain, (v1_relat_1(esk10_0))). % 8.30/1.45 cnf(i_0_54, plain, (v1_relat_1(esk13_0))). % 8.30/1.45 cnf(i_0_59, plain, (v1_relat_1(esk15_0))). % 8.30/1.45 cnf(i_0_36, plain, (v3_relat_1(k1_xboole_0))). % 8.30/1.45 cnf(i_0_58, plain, (v3_relat_1(esk15_0))). % 8.30/1.45 cnf(i_0_55, plain, (~v1_xboole_0(esk13_0))). % 8.30/1.45 cnf(i_0_76, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))). % 8.30/1.45 cnf(i_0_56, plain, (v1_xboole_0(esk14_1(X1)))). % 8.30/1.45 cnf(i_0_7, plain, (v1_relat_1(X1)|~v1_xboole_0(X1))). % 8.30/1.45 cnf(i_0_68, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)). % 8.30/1.45 cnf(i_0_66, plain, (r1_tarski(X1,X1))). % 8.30/1.45 cnf(i_0_45, plain, (k2_xboole_0(X1,X1)=X1)). % 8.30/1.45 cnf(i_0_5, negated_conjecture, (m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)))). % 8.30/1.45 cnf(i_0_4, negated_conjecture, (m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0)))). % 8.30/1.45 cnf(i_0_78, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))). % 8.30/1.45 cnf(i_0_39, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))). % 8.30/1.45 cnf(i_0_34, plain, (m1_subset_1(esk8_1(X1),X1))). % 8.30/1.45 cnf(i_0_16, plain, (m1_eqrel_1(k3_pua2mss1(X1),X1))). % 8.30/1.45 cnf(i_0_32, plain, (m1_eqrel_1(esk6_1(X1),X1))). % 8.30/1.45 cnf(i_0_49, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk11_1(X1)))). % 8.30/1.45 cnf(i_0_57, plain, (m1_subset_1(esk14_1(X1),k1_zfmisc_1(X1)))). % 8.30/1.45 cnf(i_0_9, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))). % 8.30/1.45 cnf(i_0_77, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))). % 8.30/1.45 cnf(i_0_40, plain, (v1_relat_1(k2_zfmisc_1(X1,X2)))). % 8.30/1.45 cnf(i_0_52, plain, (v1_relat_1(esk12_2(X1,X2)))). % 8.30/1.45 cnf(i_0_51, plain, (v1_funct_1(esk12_2(X1,X2)))). % 8.30/1.45 cnf(i_0_50, plain, (v1_xboole_0(X1)|m1_subset_1(esk11_1(X1),k1_zfmisc_1(X1)))). % 8.30/1.45 cnf(i_0_69, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))). % 8.30/1.45 cnf(i_0_20, plain, (v1_relat_1(k5_relset_2(X1,X2))|~v1_relat_1(X2))). % 8.30/1.45 cnf(i_0_19, plain, (v1_funct_1(k5_relset_2(X1,X2))|~v1_relat_1(X2))). % 8.30/1.45 cnf(i_0_70, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))). % 8.30/1.45 cnf(i_0_72, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))). % 8.30/1.45 cnf(i_0_41, plain, (v1_relat_1(k2_xboole_0(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))). % 8.30/1.45 cnf(i_0_6, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))). % 8.30/1.45 cnf(i_0_73, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 8.30/1.45 cnf(i_0_28, plain, (m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2)))|~m1_eqrel_1(X1,X2))). % 8.30/1.45 cnf(i_0_71, plain, (k2_xboole_0(k3_pua2mss1(X1),k3_pua2mss1(X2))=k3_pua2mss1(k2_xboole_0(X1,X2)))). % 8.30/1.45 cnf(i_0_44, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))). % 8.30/1.45 cnf(i_0_3, negated_conjecture, (m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))))). % 8.30/1.45 cnf(i_0_75, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 8.30/1.45 cnf(i_0_74, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))). % 8.30/1.45 cnf(i_0_35, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))). % 8.30/1.45 cnf(i_0_33, plain, (m1_relset_1(esk7_2(X1,X2),X1,X2))). % 8.30/1.45 cnf(i_0_53, plain, (m1_relset_1(esk12_2(X1,X2),X1,X2))). % 8.30/1.45 cnf(i_0_26, plain, (m1_subset_1(k8_setfam_1(X2,X1),k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))))). % 8.30/1.45 cnf(i_0_67, plain, (k2_xboole_0(k9_relat_1(X1,X2),k9_relat_1(X1,X3))=k9_relat_1(X1,k2_xboole_0(X2,X3))|~v1_relat_1(X1))). % 8.30/1.45 cnf(i_0_8, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 8.30/1.45 cnf(i_0_46, plain, (k4_subset_1(X2,X1,X1)=X1|~m1_subset_1(X3,k1_zfmisc_1(X2))|~m1_subset_1(X1,k1_zfmisc_1(X2)))). % 8.30/1.45 cnf(i_0_61, 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)))). % 8.30/1.45 cnf(i_0_64, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))). % 8.30/1.45 cnf(i_0_65, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))). % 8.30/1.45 cnf(i_0_31, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))). % 8.30/1.45 cnf(i_0_10, 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)))). % 8.30/1.45 cnf(i_0_62, plain, (k6_relset_2(X3,X2,X1)=k5_relset_2(X2,X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))). % 8.30/1.45 cnf(i_0_18, 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)))). % 8.30/1.45 cnf(i_0_23, plain, (v1_funct_1(k6_relset_2(X1,X2,X3))|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X1))))). % 8.30/1.45 cnf(i_0_22, plain, (v1_funct_2(k6_relset_2(X1,X2,X3),k1_zfmisc_1(X2),k1_zfmisc_1(X1))|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X1))))). % 8.30/1.45 cnf(i_0_21, plain, (m2_relset_1(k6_relset_2(X1,X2,X3),k1_zfmisc_1(X2),k1_zfmisc_1(X1))|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X1))))). % 8.30/1.45 cnf(i_0_2, negated_conjecture, (k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k3_pua2mss1(esk3_0))=k1_xboole_0)). % 8.30/1.45 cnf(i_0_60, plain, (k4_relset_2(X2,X3,X1,X4)=k9_relat_1(X1,X4)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,k1_zfmisc_1(X3)))))). % 8.30/1.45 cnf(i_0_63, plain, (k7_relset_2(X2,X4,X1,X3)=k8_relset_2(X2,X4,X1,X3)|~m1_subset_1(X1,k1_zfmisc_1(X2))|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4))))). % 8.30/1.45 cnf(i_0_25, plain, (m1_subset_1(k8_relset_2(X2,X4,X1,X3),k1_zfmisc_1(X4))|~m1_subset_1(X1,k1_zfmisc_1(X2))|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4))))). % 8.30/1.45 cnf(i_0_17, plain, (m1_subset_1(k4_relset_2(X2,X3,X1,X4),k1_zfmisc_1(k1_zfmisc_1(X3)))|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,k1_zfmisc_1(X3)))))). % 8.30/1.45 cnf(i_0_1, negated_conjecture, (k8_relset_2(esk1_0,esk2_0,k4_subset_1(esk1_0,esk3_0,esk4_0),esk5_0)!=k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0))). % 8.30/1.45 cnf(i_0_11, plain, (k8_setfam_1(X4,k4_relset_2(k1_zfmisc_1(X2),X4,k6_relset_2(X4,X2,X3),k3_pua2mss1(X1)))=k7_relset_2(X2,X4,X1,X3)|~m1_subset_1(X1,k1_zfmisc_1(X2))|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X2,X4))))). % 8.30/1.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 8.30/1.45 # Begin printing tableau % 8.30/1.45 # Found 5 steps % 8.30/1.45 cnf(i_0_5, negated_conjecture, (m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))), inference(start_rule)). % 8.30/1.45 cnf(i_0_83, plain, (m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))), inference(extension_rule, [i_0_70])). % 8.30/1.45 cnf(i_0_364, plain, (v1_xboole_0(k1_zfmisc_1(esk1_0))), inference(closure_rule, [i_0_39])). % 8.30/1.45 cnf(i_0_365, plain, (r2_hidden(esk3_0,k1_zfmisc_1(esk1_0))), inference(extension_rule, [i_0_6])). % 8.30/1.45 cnf(i_0_392, plain, (~r2_hidden(k1_zfmisc_1(esk1_0),esk3_0)), inference(etableau_closure_rule, [i_0_392, ...])). % 8.30/1.45 # End printing tableau % 8.30/1.45 # SZS output end % 8.30/1.45 # Branches closed with saturation will be marked with an "s" % 8.30/1.45 # Child (4123) has found a proof. % 8.30/1.45 % 8.30/1.45 # Proof search is over... % 8.30/1.45 # Freeing feature tree %------------------------------------------------------------------------------