TSTP Solution File: GRP622+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP622+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 : Sat Jul 16 09:07:18 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP622+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 04:49:03 EDT 2022
% 0.14/0.34 % 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: 105 Number of unprocessed: 105
% 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.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 # 105 beginning clauses after preprocessing and clausification
% 0.20/0.38 # Creating start rules for all 6 conjectures.
% 0.20/0.38 # There are 6 start rule candidates:
% 0.20/0.38 # Found 52 unit axioms.
% 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.38 # 6 start rule tableaux created.
% 0.20/0.38 # 53 extension rule candidate clauses
% 0.20/0.38 # 52 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 6
% 0.20/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 12 tableaux to operate on
% 0.20/0.45 # There were 1 total branch saturation attempts.
% 0.20/0.45 # There were 0 of these attempts blocked.
% 0.20/0.45 # There were 0 deferred branch saturation attempts.
% 0.20/0.45 # There were 0 free duplicated saturations.
% 0.20/0.45 # There were 1 total successful branch saturations.
% 0.20/0.45 # There were 0 successful branch saturations in interreduction.
% 0.20/0.45 # There were 0 successful branch saturations on the branch.
% 0.20/0.45 # There were 1 successful branch saturations after the branch.
% 0.20/0.45 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Begin clausification derivation
% 0.20/0.45
% 0.20/0.45 # End clausification derivation
% 0.20/0.45 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.45 cnf(i_0_5, negated_conjecture, (v1_group_1(esk1_0))).
% 0.20/0.45 cnf(i_0_76, plain, (v1_group_1(esk13_0))).
% 0.20/0.45 cnf(i_0_86, plain, (v1_group_1(esk17_0))).
% 0.20/0.45 cnf(i_0_99, plain, (v1_group_1(esk21_0))).
% 0.20/0.45 cnf(i_0_4, negated_conjecture, (v3_group_1(esk1_0))).
% 0.20/0.45 cnf(i_0_97, plain, (v3_group_1(esk21_0))).
% 0.20/0.45 cnf(i_0_3, negated_conjecture, (v4_group_1(esk1_0))).
% 0.20/0.45 cnf(i_0_96, plain, (v4_group_1(esk21_0))).
% 0.20/0.45 cnf(i_0_2, negated_conjecture, (l1_group_1(esk1_0))).
% 0.20/0.45 cnf(i_0_52, plain, (l1_group_1(esk3_0))).
% 0.20/0.45 cnf(i_0_77, plain, (l1_group_1(esk13_0))).
% 0.20/0.45 cnf(i_0_88, plain, (l1_group_1(esk17_0))).
% 0.20/0.45 cnf(i_0_101, plain, (l1_group_1(esk21_0))).
% 0.20/0.45 cnf(i_0_68, plain, (v1_fraenkel(esk10_0))).
% 0.20/0.45 cnf(i_0_71, plain, (v1_relat_1(esk11_0))).
% 0.20/0.45 cnf(i_0_81, plain, (v1_relat_1(esk14_0))).
% 0.20/0.45 cnf(i_0_85, plain, (v1_relat_1(esk16_0))).
% 0.20/0.45 cnf(i_0_95, plain, (v1_relat_1(esk20_0))).
% 0.20/0.45 cnf(i_0_70, plain, (v1_funct_1(esk11_0))).
% 0.20/0.45 cnf(i_0_80, plain, (v1_funct_1(esk14_0))).
% 0.20/0.45 cnf(i_0_83, plain, (v1_funct_1(esk16_0))).
% 0.20/0.45 cnf(i_0_94, plain, (v1_funct_1(esk20_0))).
% 0.20/0.45 cnf(i_0_64, plain, (v1_xboole_0(k1_xboole_0))).
% 0.20/0.45 cnf(i_0_78, plain, (v1_xboole_0(esk14_0))).
% 0.20/0.45 cnf(i_0_82, plain, (v1_xboole_0(esk15_0))).
% 0.20/0.45 cnf(i_0_84, plain, (v1_xboole_0(esk16_0))).
% 0.20/0.45 cnf(i_0_98, plain, (v2_group_1(esk21_0))).
% 0.20/0.45 cnf(i_0_79, plain, (v2_funct_1(esk14_0))).
% 0.20/0.45 cnf(i_0_93, plain, (v2_funct_1(esk20_0))).
% 0.20/0.45 cnf(i_0_53, plain, (l1_struct_0(esk4_0))).
% 0.20/0.45 cnf(i_0_103, plain, (l1_struct_0(esk22_0))).
% 0.20/0.45 cnf(i_0_6, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.20/0.45 cnf(i_0_87, plain, (~v3_struct_0(esk17_0))).
% 0.20/0.45 cnf(i_0_100, plain, (~v3_struct_0(esk21_0))).
% 0.20/0.45 cnf(i_0_102, plain, (~v3_struct_0(esk22_0))).
% 0.20/0.45 cnf(i_0_69, plain, (~v1_xboole_0(esk10_0))).
% 0.20/0.45 cnf(i_0_92, plain, (~v1_xboole_0(esk19_0))).
% 0.20/0.45 cnf(i_0_119, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.20/0.45 cnf(i_0_11, plain, (v1_funct_1(X1)|~v1_xboole_0(X1))).
% 0.20/0.45 cnf(i_0_38, plain, (l1_struct_0(X1)|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_111, plain, (r1_tarski(X1,X1))).
% 0.20/0.45 cnf(i_0_121, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.20/0.45 cnf(i_0_50, plain, (v1_funct_1(u1_group_1(X1))|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_56, plain, (m1_subset_1(esk7_1(X1),X1))).
% 0.20/0.45 cnf(i_0_14, plain, (v3_struct_0(X1)|v2_group_1(X1)|~v3_group_1(X1)|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_17, plain, (v2_funct_1(X1)|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_xboole_0(X1))).
% 0.20/0.45 cnf(i_0_63, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.20/0.45 cnf(i_0_104, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk23_1(X1)))).
% 0.20/0.45 cnf(i_0_120, plain, (~v1_xboole_0(X2)|~r2_hidden(X1,X2))).
% 0.20/0.45 cnf(i_0_59, plain, (v1_fraenkel(k1_funct_2(X1,X2)))).
% 0.20/0.45 cnf(i_0_74, plain, (v1_relat_1(esk12_2(X1,X2)))).
% 0.20/0.45 cnf(i_0_90, plain, (v1_relat_1(esk18_2(X1,X2)))).
% 0.20/0.45 cnf(i_0_73, plain, (v1_funct_1(esk12_2(X1,X2)))).
% 0.20/0.45 cnf(i_0_89, plain, (v1_funct_1(esk18_2(X1,X2)))).
% 0.20/0.45 cnf(i_0_106, plain, (k1_fraenkel(X2,X1)=k1_funct_2(X2,X1)|v1_xboole_0(X1))).
% 0.20/0.45 cnf(i_0_10, plain, (v1_relat_1(X1)|~v1_fraenkel(X2)|~m1_subset_1(X1,X2))).
% 0.20/0.45 cnf(i_0_9, plain, (v1_funct_1(X1)|~v1_fraenkel(X2)|~m1_subset_1(X1,X2))).
% 0.20/0.45 cnf(i_0_113, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.20/0.45 cnf(i_0_114, plain, (v1_xboole_0(X2)|r2_hidden(X1,X2)|~m1_subset_1(X1,X2))).
% 0.20/0.45 cnf(i_0_7, plain, (g1_group_1(u1_struct_0(X1),u1_group_1(X1))=X1|~v1_group_1(X1)|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_115, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.20/0.45 cnf(i_0_8, plain, (~r2_hidden(X2,X1)|~r2_hidden(X1,X2))).
% 0.20/0.45 cnf(i_0_116, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.20/0.45 cnf(i_0_65, plain, (~v1_xboole_0(k1_funct_2(X1,X1)))).
% 0.20/0.45 cnf(i_0_105, plain, (v3_struct_0(X1)|m1_subset_1(esk23_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_struct_0(X1))).
% 0.20/0.45 cnf(i_0_60, plain, (v1_xboole_0(X1)|~v1_xboole_0(k1_funct_2(X2,X1)))).
% 0.20/0.45 cnf(i_0_28, plain, (r1_tarski(X1,X2)|r2_hidden(esk2_2(X1,X2),X1))).
% 0.20/0.45 cnf(i_0_29, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1))).
% 0.20/0.45 cnf(i_0_118, plain, (~v1_xboole_0(X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.20/0.45 cnf(i_0_117, plain, (m1_subset_1(X1,X3)|~r2_hidden(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3)))).
% 0.20/0.45 cnf(i_0_27, plain, (r1_tarski(X1,X2)|~r2_hidden(esk2_2(X1,X2),X2))).
% 0.20/0.45 cnf(i_0_55, plain, (m1_relset_1(esk6_2(X1,X2),X1,X2))).
% 0.20/0.45 cnf(i_0_75, plain, (m1_relset_1(esk12_2(X1,X2),X1,X2))).
% 0.20/0.45 cnf(i_0_91, plain, (m1_relset_1(esk18_2(X1,X2),X1,X2))).
% 0.20/0.45 cnf(i_0_72, plain, (v1_funct_2(esk12_2(X1,X2),X1,X2))).
% 0.20/0.45 cnf(i_0_54, plain, (m1_fraenkel(esk5_2(X1,X2),X1,X2))).
% 0.20/0.45 cnf(i_0_58, plain, (m2_relset_1(esk9_2(X1,X2),X1,X2))).
% 0.20/0.45 cnf(i_0_32, plain, (v1_xboole_0(X1)|m1_fraenkel(k1_fraenkel(X2,X1),X2,X1))).
% 0.20/0.45 cnf(i_0_1, negated_conjecture, (~r1_tarski(k4_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0))))).
% 0.20/0.45 cnf(i_0_40, plain, (v1_fraenkel(X1)|~m1_fraenkel(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_41, plain, (~v1_xboole_0(X1)|~m1_fraenkel(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_37, plain, (v3_struct_0(X1)|m1_fraenkel(k4_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1))|~v1_group_1(X1)|~v3_group_1(X1)|~v4_group_1(X1)|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_16, plain, (v1_relat_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))).
% 0.20/0.45 cnf(i_0_49, plain, (v1_funct_2(u1_group_1(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_48, plain, (m2_relset_1(u1_group_1(X1),k2_zfmisc_1(u1_struct_0(X1),u1_struct_0(X1)),u1_struct_0(X1))|~l1_group_1(X1))).
% 0.20/0.45 cnf(i_0_110, plain, (m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_109, plain, (m2_relset_1(X1,X2,X3)|~m1_relset_1(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_47, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_25, plain, (v1_xboole_0(X3)|v1_xboole_0(X2)|~v1_funct_1(X1)|~v1_xboole_0(X1)|~m1_relset_1(X1,X2,X3)|~v1_funct_2(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_112, plain, (r2_hidden(X1,k1_funct_2(X2,X2))|~v1_funct_1(X1)|~v1_funct_2(X1,X2,X2)|~m2_relset_1(X1,X2,X2))).
% 0.20/0.45 cnf(i_0_12, plain, (v1_funct_2(X1,X2,X3)|~v1_funct_1(X1)|~m1_relset_1(X1,X2,X3)|~v1_partfun1(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_21, plain, (v1_xboole_0(X3)|v1_partfun1(X1,X2,X3)|~v1_funct_1(X1)|~m1_relset_1(X1,X2,X3)|~v1_funct_2(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_24, plain, (v1_xboole_0(X3)|v1_xboole_0(X2)|v1_partfun1(X1,X2,X3)|~v1_funct_1(X1)|~m1_relset_1(X1,X2,X3)|~v1_funct_2(X1,X2,X3))).
% 0.20/0.45 cnf(i_0_31, plain, (v1_group_1(g1_group_1(X1,X2))|~v1_funct_1(X2)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1))).
% 0.20/0.45 cnf(i_0_30, plain, (l1_group_1(g1_group_1(X1,X2))|~v1_funct_1(X2)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1))).
% 0.20/0.45 cnf(i_0_61, plain, (v1_xboole_0(X1)|v1_group_1(g1_group_1(X1,X2))|~v1_funct_1(X2)|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1))).
% 0.20/0.45 cnf(i_0_66, plain, (X1=X2|g1_group_1(X3,X1)!=g1_group_1(X4,X2)|~v1_funct_1(X1)|~m1_relset_1(X1,k2_zfmisc_1(X3,X3),X3)|~v1_funct_2(X1,k2_zfmisc_1(X3,X3),X3))).
% 0.20/0.45 cnf(i_0_67, plain, (X1=X2|g1_group_1(X1,X3)!=g1_group_1(X2,X4)|~v1_funct_1(X3)|~m1_relset_1(X3,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X3,k2_zfmisc_1(X1,X1),X1))).
% 0.20/0.45 cnf(i_0_62, plain, (v1_xboole_0(X1)|~v1_funct_1(X2)|~v3_struct_0(g1_group_1(X1,X2))|~m1_relset_1(X2,k2_zfmisc_1(X1,X1),X1)|~v1_funct_2(X2,k2_zfmisc_1(X1,X1),X1))).
% 0.20/0.45 cnf(i_0_107, plain, (v1_xboole_0(X4)|m2_fraenkel(X1,X3,X4,X2)|~m1_subset_1(X1,X2)|~m1_fraenkel(X2,X3,X4))).
% 0.20/0.45 cnf(i_0_57, plain, (v1_xboole_0(X1)|m2_fraenkel(esk8_3(X3,X1,X2),X3,X1,X2)|~m1_fraenkel(X2,X3,X1))).
% 0.20/0.45 cnf(i_0_46, plain, (v1_funct_1(X1)|v1_xboole_0(X3)|~m1_fraenkel(X4,X2,X3)|~m2_fraenkel(X1,X2,X3,X4))).
% 0.20/0.45 cnf(i_0_108, plain, (v1_xboole_0(X3)|m1_subset_1(X1,X4)|~m1_fraenkel(X4,X2,X3)|~m2_fraenkel(X1,X2,X3,X4))).
% 0.20/0.45 cnf(i_0_45, plain, (v1_xboole_0(X3)|v1_funct_2(X1,X2,X3)|~m1_fraenkel(X4,X2,X3)|~m2_fraenkel(X1,X2,X3,X4))).
% 0.20/0.45 cnf(i_0_44, plain, (v1_xboole_0(X3)|m2_relset_1(X1,X2,X3)|~m1_fraenkel(X4,X2,X3)|~m2_fraenkel(X1,X2,X3,X4))).
% 0.20/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.45 # Begin printing tableau
% 0.20/0.45 # Found 8 steps
% 0.20/0.45 cnf(i_0_4, negated_conjecture, (v3_group_1(esk1_0)), inference(start_rule)).
% 0.20/0.45 cnf(i_0_126, plain, (v3_group_1(esk1_0)), inference(extension_rule, [i_0_37])).
% 0.20/0.45 cnf(i_0_1047, plain, (v3_struct_0(esk1_0)), inference(closure_rule, [i_0_6])).
% 0.20/0.45 cnf(i_0_1049, plain, (~v1_group_1(esk1_0)), inference(closure_rule, [i_0_5])).
% 0.20/0.45 cnf(i_0_1051, plain, (~v4_group_1(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.20/0.45 cnf(i_0_1052, plain, (~l1_group_1(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.20/0.45 cnf(i_0_1048, plain, (m1_fraenkel(k4_autgroup(esk1_0),u1_struct_0(esk1_0),u1_struct_0(esk1_0))), inference(extension_rule, [i_0_40])).
% 0.20/0.45 cnf(i_0_1118, plain, (v1_fraenkel(k4_autgroup(esk1_0))), inference(etableau_closure_rule, [i_0_1118, ...])).
% 0.20/0.45 # End printing tableau
% 0.20/0.45 # SZS output end
% 0.20/0.45 # Branches closed with saturation will be marked with an "s"
% 0.20/0.45 # Child (28302) has found a proof.
% 0.20/0.45
% 0.20/0.45 # Proof search is over...
% 0.20/0.45 # Freeing feature tree
%------------------------------------------------------------------------------