TSTP Solution File: SEU451+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU451+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 : n024.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:27:14 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU451+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.34 % Computer : n024.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 : Sun Jun 19 15:10:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.20/0.38 #
% 0.20/0.38 # Number of axioms: 70 Number of unprocessed: 70
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 70 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 2 conjectures.
% 0.20/0.39 # There are 2 start rule candidates:
% 0.20/0.39 # Found 40 unit axioms.
% 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.39 # 2 start rule tableaux created.
% 0.20/0.39 # 30 extension rule candidate clauses
% 0.20/0.39 # 40 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.20/0.40 # There were 1 total branch saturation attempts.
% 0.20/0.40 # There were 0 of these attempts blocked.
% 0.20/0.40 # There were 0 deferred branch saturation attempts.
% 0.20/0.40 # There were 0 free duplicated saturations.
% 0.20/0.40 # There were 1 total successful branch saturations.
% 0.20/0.40 # There were 0 successful branch saturations in interreduction.
% 0.20/0.40 # There were 0 successful branch saturations on the branch.
% 0.20/0.40 # There were 1 successful branch saturations after the branch.
% 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40 # Begin clausification derivation
% 0.20/0.40
% 0.20/0.40 # End clausification derivation
% 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40 cnf(i_0_26, plain, (v1_relat_1(k1_xboole_0))).
% 0.20/0.40 cnf(i_0_36, plain, (v1_relat_1(k1_xboole_0))).
% 0.20/0.40 cnf(i_0_41, plain, (v1_relat_1(esk7_0))).
% 0.20/0.40 cnf(i_0_48, plain, (v1_relat_1(esk10_0))).
% 0.20/0.40 cnf(i_0_60, plain, (v1_relat_1(esk13_0))).
% 0.20/0.40 cnf(i_0_27, plain, (v1_xboole_0(k1_xboole_0))).
% 0.20/0.40 cnf(i_0_37, plain, (v1_xboole_0(k1_xboole_0))).
% 0.20/0.40 cnf(i_0_42, plain, (v1_xboole_0(esk7_0))).
% 0.20/0.40 cnf(i_0_25, plain, (v3_relat_1(k1_xboole_0))).
% 0.20/0.40 cnf(i_0_59, plain, (v3_relat_1(esk13_0))).
% 0.20/0.40 cnf(i_0_49, plain, (~v1_xboole_0(esk10_0))).
% 0.20/0.40 cnf(i_0_75, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.20/0.40 cnf(i_0_14, plain, (v1_relat_1(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_35, plain, (v1_relat_1(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_57, plain, (v1_relat_1(esk12_1(X1)))).
% 0.20/0.40 cnf(i_0_32, plain, (v3_relat_2(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_55, plain, (v3_relat_2(esk12_1(X1)))).
% 0.20/0.40 cnf(i_0_30, plain, (v8_relat_2(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_53, plain, (v8_relat_2(esk12_1(X1)))).
% 0.20/0.40 cnf(i_0_33, plain, (v1_relat_2(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_56, plain, (v1_relat_2(esk12_1(X1)))).
% 0.20/0.40 cnf(i_0_50, plain, (v1_xboole_0(esk11_1(X1)))).
% 0.20/0.40 cnf(i_0_34, plain, (v1_funct_1(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_31, plain, (v4_relat_2(k6_partfun1(X1)))).
% 0.20/0.40 cnf(i_0_54, plain, (v4_relat_2(esk12_1(X1)))).
% 0.20/0.40 cnf(i_0_6, plain, (v1_relat_1(X1)|~v1_xboole_0(X1))).
% 0.20/0.40 cnf(i_0_66, plain, (r1_tarski(X1,X1))).
% 0.20/0.40 cnf(i_0_77, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.20/0.40 cnf(i_0_28, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))).
% 0.20/0.40 cnf(i_0_21, plain, (m1_subset_1(esk5_1(X1),X1))).
% 0.20/0.40 cnf(i_0_43, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk8_1(X1)))).
% 0.20/0.40 cnf(i_0_4, plain, (v1_relat_2(X1)|~v1_relat_1(X1)|~v3_relat_2(X1)|~v8_relat_2(X1))).
% 0.20/0.40 cnf(i_0_51, plain, (m1_subset_1(esk11_1(X1),k1_zfmisc_1(X1)))).
% 0.20/0.40 cnf(i_0_76, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.20/0.40 cnf(i_0_29, plain, (v1_relat_1(k2_zfmisc_1(X1,X2)))).
% 0.20/0.40 cnf(i_0_46, plain, (v1_relat_1(esk9_2(X1,X2)))).
% 0.20/0.40 cnf(i_0_45, plain, (v1_funct_1(esk9_2(X1,X2)))).
% 0.20/0.40 cnf(i_0_44, plain, (v1_xboole_0(X1)|m1_subset_1(esk8_1(X1),k1_zfmisc_1(X1)))).
% 0.20/0.40 cnf(i_0_67, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.20/0.40 cnf(i_0_70, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.20/0.40 cnf(i_0_71, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.20/0.40 cnf(i_0_11, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_relat_1(X1))).
% 0.20/0.40 cnf(i_0_39, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_xboole_0(X1))).
% 0.20/0.40 cnf(i_0_23, plain, (v1_relat_1(k5_relat_1(X1,X2))|~v1_relat_1(X1)|~v1_xboole_0(X2))).
% 0.20/0.40 cnf(i_0_40, plain, (v1_xboole_0(k5_relat_1(X1,X2))|~v1_relat_1(X2)|~v1_xboole_0(X1))).
% 0.20/0.40 cnf(i_0_24, plain, (v1_xboole_0(k5_relat_1(X1,X2))|~v1_relat_1(X1)|~v1_xboole_0(X2))).
% 0.20/0.40 cnf(i_0_3, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.20/0.40 cnf(i_0_72, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.20/0.40 cnf(i_0_2, negated_conjecture, (m2_relset_1(esk3_0,esk1_0,esk2_0))).
% 0.20/0.40 cnf(i_0_38, plain, (v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_xboole_0(k2_zfmisc_1(X1,X2)))).
% 0.20/0.40 cnf(i_0_12, plain, (m2_relset_1(k6_partfun1(X1),X1,X1))).
% 0.20/0.40 cnf(i_0_13, plain, (v1_partfun1(k6_partfun1(X1),X1,X1))).
% 0.20/0.40 cnf(i_0_52, plain, (v1_partfun1(esk12_1(X1),X1,X1))).
% 0.20/0.40 cnf(i_0_58, plain, (m1_relset_1(esk12_1(X1),X1,X1))).
% 0.20/0.40 cnf(i_0_74, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.20/0.40 cnf(i_0_73, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.20/0.40 cnf(i_0_22, plain, (m2_relset_1(esk6_2(X1,X2),X1,X2))).
% 0.20/0.40 cnf(i_0_20, plain, (m1_relset_1(esk4_2(X1,X2),X1,X2))).
% 0.20/0.40 cnf(i_0_47, plain, (m1_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.20/0.40 cnf(i_0_7, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.20/0.40 cnf(i_0_64, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.20/0.40 cnf(i_0_65, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.20/0.40 cnf(i_0_19, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.20/0.40 cnf(i_0_63, plain, (k9_relset_2(X2,X3,X5,X1,X4)=k5_relat_1(X1,X4)|~m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X3,X5)))|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.20/0.40 cnf(i_0_16, plain, (m2_relset_1(k9_relset_2(X2,X3,X5,X1,X4),X2,X5)|~m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X3,X5)))|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.20/0.40 cnf(i_0_1, negated_conjecture, (k9_relset_2(esk1_0,esk2_0,esk2_0,esk3_0,k6_partfun1(esk2_0))!=k9_relset_2(esk1_0,esk1_0,esk2_0,k6_partfun1(esk1_0),esk3_0))).
% 0.20/0.40 cnf(i_0_68, plain, (k7_relset_1(X1,X2,X2,X2,X3,k6_partfun1(X2))=X3|~m2_relset_1(X3,X1,X2))).
% 0.20/0.40 cnf(i_0_69, plain, (k7_relset_1(X1,X1,X1,X2,k6_partfun1(X1),X3)=X3|~m2_relset_1(X3,X1,X2))).
% 0.20/0.40 cnf(i_0_62, plain, (k7_relset_1(X2,X3,X5,X6,X1,X4)=k5_relat_1(X1,X4)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.20/0.40 cnf(i_0_15, plain, (m2_relset_1(k7_relset_1(X2,X3,X5,X6,X1,X4),X2,X6)|~m1_relset_1(X4,X5,X6)|~m1_relset_1(X1,X2,X3))).
% 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.40 # Begin printing tableau
% 0.20/0.40 # Found 5 steps
% 0.20/0.40 cnf(i_0_2, negated_conjecture, (m2_relset_1(esk3_0,esk1_0,esk2_0)), inference(start_rule)).
% 0.20/0.40 cnf(i_0_79, plain, (m2_relset_1(esk3_0,esk1_0,esk2_0)), inference(extension_rule, [i_0_19])).
% 0.20/0.40 cnf(i_0_214, plain, (m1_subset_1(esk3_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))), inference(extension_rule, [i_0_70])).
% 0.20/0.40 cnf(i_0_403, plain, (v1_xboole_0(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))), inference(closure_rule, [i_0_28])).
% 0.20/0.40 cnf(i_0_404, plain, (r2_hidden(esk3_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))), inference(etableau_closure_rule, [i_0_404, ...])).
% 0.20/0.40 # End printing tableau
% 0.20/0.40 # SZS output end
% 0.20/0.40 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.40 # We now have 3 tableaux to operate on
% 0.20/0.40 # Found closed tableau during pool population.
% 0.20/0.40 # Proof search is over...
% 0.20/0.40 # Freeing feature tree
%------------------------------------------------------------------------------