TSTP Solution File: LAT313+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT313+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 : n012.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 : Sun Jul 17 04:50:41 EDT 2022
% Result : Theorem 0.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : LAT313+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 : n012.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 : Tue Jun 28 20:35:03 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 66 Number of unprocessed: 65
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 65 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 7 conjectures.
% 0.18/0.37 # There are 7 start rule candidates:
% 0.18/0.37 # Found 20 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 7 start rule tableaux created.
% 0.18/0.37 # 45 extension rule candidate clauses
% 0.18/0.37 # 20 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 7
% 0.18/0.37 # Returning from population with 32 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 32 tableaux to operate on
% 0.18/0.38 # There were 1 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 1 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 1 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_6, negated_conjecture, (v10_lattices(esk1_0))).
% 0.18/0.38 cnf(i_0_5, negated_conjecture, (l3_lattices(esk1_0))).
% 0.18/0.38 cnf(i_0_3, negated_conjecture, (v14_lattices(esk1_0))).
% 0.18/0.38 cnf(i_0_4, negated_conjecture, (m2_filter_2(esk2_0,esk1_0))).
% 0.18/0.38 cnf(i_0_38, plain, (l3_lattices(esk6_0))).
% 0.18/0.38 cnf(i_0_44, plain, (v1_xboole_0(k1_xboole_0))).
% 0.18/0.38 cnf(i_0_49, plain, (v1_xboole_0(esk12_0))).
% 0.18/0.38 cnf(i_0_2, negated_conjecture, (r2_hidden(k6_lattices(esk1_0),esk2_0))).
% 0.18/0.38 cnf(i_0_37, plain, (l2_lattices(esk5_0))).
% 0.18/0.38 cnf(i_0_35, plain, (l1_lattices(esk3_0))).
% 0.18/0.38 cnf(i_0_36, plain, (l1_struct_0(esk4_0))).
% 0.18/0.38 cnf(i_0_54, plain, (l1_struct_0(esk15_0))).
% 0.18/0.38 cnf(i_0_50, plain, (v1_xboole_0(esk13_1(X1)))).
% 0.18/0.38 cnf(i_0_60, plain, (r1_tarski(X1,X1))).
% 0.18/0.38 cnf(i_0_39, plain, (m1_subset_1(esk7_1(X1),X1))).
% 0.18/0.38 cnf(i_0_51, plain, (m1_subset_1(esk13_1(X1),k1_zfmisc_1(X1)))).
% 0.18/0.38 cnf(i_0_7, negated_conjecture, (~v3_struct_0(esk1_0))).
% 0.18/0.38 cnf(i_0_53, plain, (~v3_struct_0(esk15_0))).
% 0.18/0.38 cnf(i_0_52, plain, (~v1_xboole_0(esk14_0))).
% 0.18/0.38 cnf(i_0_43, plain, (~v1_xboole_0(k1_zfmisc_1(X1)))).
% 0.18/0.38 cnf(i_0_72, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X1))).
% 0.18/0.38 cnf(i_0_1, negated_conjecture, (u1_struct_0(esk1_0)!=esk2_0|~r1_filter_2(u1_struct_0(esk1_0),esk2_0,k17_filter_2(esk1_0)))).
% 0.18/0.38 cnf(i_0_28, plain, (l2_lattices(X1)|~l3_lattices(X1))).
% 0.18/0.38 cnf(i_0_29, plain, (l1_lattices(X1)|~l3_lattices(X1))).
% 0.18/0.38 cnf(i_0_9, plain, (v1_funct_1(X1)|~v1_xboole_0(X1))).
% 0.18/0.38 cnf(i_0_27, plain, (l1_struct_0(X1)|~l2_lattices(X1))).
% 0.18/0.38 cnf(i_0_71, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.18/0.38 cnf(i_0_8, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))).
% 0.18/0.38 cnf(i_0_25, plain, (l1_struct_0(X1)|~l1_lattices(X1))).
% 0.18/0.38 cnf(i_0_73, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.18/0.38 cnf(i_0_47, plain, (v1_xboole_0(X1)|~v1_xboole_0(esk11_1(X1)))).
% 0.18/0.38 cnf(i_0_62, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.18/0.38 cnf(i_0_42, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1)))).
% 0.18/0.38 cnf(i_0_55, plain, (v3_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(esk16_1(X1)))).
% 0.18/0.38 cnf(i_0_15, plain, (v4_lattices(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_14, plain, (v5_lattices(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_13, plain, (v6_lattices(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_12, plain, (v7_lattices(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_11, plain, (v8_lattices(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_10, plain, (v9_lattices(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_66, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2)))).
% 0.18/0.38 cnf(i_0_70, plain, (~m1_subset_1(X1,k1_zfmisc_1(X2))|~v1_xboole_0(X2)|~r2_hidden(X3,X1))).
% 0.18/0.38 cnf(i_0_45, plain, (v3_struct_0(X1)|~v1_xboole_0(esk10_1(X1))|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_32, plain, (v3_struct_0(X1)|~v1_xboole_0(X2)|~m2_filter_2(X2,X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_19, plain, (k17_filter_2(X1)=u1_struct_0(X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_20, plain, (m2_filter_2(k17_filter_2(X1),X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_63, plain, (v1_xboole_0(X1)|r2_hidden(X2,X1)|~m1_subset_1(X2,X1))).
% 0.18/0.38 cnf(i_0_24, plain, (m1_subset_1(k6_lattices(X1),u1_struct_0(X1))|v3_struct_0(X1)|~l2_lattices(X1))).
% 0.18/0.38 cnf(i_0_40, plain, (m2_filter_2(esk8_1(X1),X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_48, plain, (m1_subset_1(esk11_1(X1),k1_zfmisc_1(X1))|v1_xboole_0(X1))).
% 0.18/0.38 cnf(i_0_65, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2))).
% 0.18/0.38 cnf(i_0_31, plain, (m2_lattice4(X1,X2)|v3_struct_0(X2)|~m2_filter_2(X1,X2)|~l3_lattices(X2)|~v10_lattices(X2))).
% 0.18/0.38 cnf(i_0_69, plain, (m1_subset_1(X1,X2)|~m1_subset_1(X3,k1_zfmisc_1(X2))|~r2_hidden(X1,X3))).
% 0.18/0.38 cnf(i_0_41, plain, (m2_lattice4(esk9_1(X1),X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_46, plain, (m2_lattice4(esk10_1(X1),X1)|v3_struct_0(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_56, plain, (m1_subset_1(esk16_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|v3_struct_0(X1)|~l1_struct_0(X1))).
% 0.18/0.38 cnf(i_0_33, plain, (m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))|v3_struct_0(X2)|~m2_lattice4(X1,X2)|~l3_lattices(X2)|~v10_lattices(X2))).
% 0.18/0.38 cnf(i_0_17, plain, (v10_lattices(X1)|v3_struct_0(X1)|~v9_lattices(X1)|~v8_lattices(X1)|~v7_lattices(X1)|~v6_lattices(X1)|~v5_lattices(X1)|~v4_lattices(X1)|~l3_lattices(X1))).
% 0.18/0.38 cnf(i_0_64, plain, (r1_filter_2(u1_struct_0(X1),k19_filter_2(X1,X2),X2)|v3_struct_0(X1)|~m2_filter_2(X2,X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_58, plain, (X1=X2|v1_xboole_0(X3)|~m1_subset_1(X2,k1_zfmisc_1(X3))|~m1_subset_1(X1,k1_zfmisc_1(X3))|~r1_filter_2(X3,X1,X2))).
% 0.18/0.38 cnf(i_0_21, plain, (v1_xboole_0(X1)|m2_filter_2(k19_filter_2(X2,X1),X2)|v3_struct_0(X2)|~m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))|~l3_lattices(X2)|~v10_lattices(X2))).
% 0.18/0.38 cnf(i_0_57, plain, (v1_xboole_0(X1)|r1_filter_2(X1,X2,X2)|~m1_subset_1(X2,k1_zfmisc_1(X1)))).
% 0.18/0.38 cnf(i_0_61, plain, (v1_xboole_0(X1)|r1_filter_2(X1,X2,X3)|~m1_subset_1(X2,k1_zfmisc_1(X1))|~m1_subset_1(X3,k1_zfmisc_1(X1))|~r1_filter_2(X1,X3,X2))).
% 0.18/0.38 cnf(i_0_67, plain, (k19_filter_2(X1,X2)=u1_struct_0(X1)|v3_struct_0(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))|~r2_hidden(k6_lattices(X1),X2)|~v14_lattices(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 cnf(i_0_68, plain, (r1_filter_2(u1_struct_0(X1),k19_filter_2(X1,X2),k17_filter_2(X1))|v3_struct_0(X1)|~m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))|~r2_hidden(k6_lattices(X1),X2)|~v14_lattices(X1)|~l3_lattices(X1)|~v10_lattices(X1))).
% 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 4 steps
% 0.18/0.38 cnf(i_0_5, negated_conjecture, (l3_lattices(esk1_0)), inference(start_rule)).
% 0.18/0.38 cnf(i_0_81, plain, (l3_lattices(esk1_0)), inference(extension_rule, [i_0_28])).
% 0.18/0.38 cnf(i_0_571, plain, (l2_lattices(esk1_0)), inference(extension_rule, [i_0_27])).
% 0.18/0.38 cnf(i_0_579, plain, (l1_struct_0(esk1_0)), inference(etableau_closure_rule, [i_0_579, ...])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # Child (7834) has found a proof.
% 0.18/0.38
% 0.18/0.38 # Proof search is over...
% 0.18/0.38 # Freeing feature tree
%------------------------------------------------------------------------------