%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU216+1 : TPTP v8.1.0. Released v3.3.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 : n019.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:24:51 EDT 2022 % Result : Theorem 39.84s 5.38s % Output : CNFRefutation 39.84s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU216+1 : TPTP v8.1.0. Released v3.3.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.13/0.33 % Computer : n019.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % 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 06:56:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 59 Number of unprocessed: 51 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 51 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 6 conjectures. % 0.19/0.37 # There are 6 start rule candidates: % 0.19/0.37 # Found 23 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 6 start rule tableaux created. % 0.19/0.37 # 28 extension rule candidate clauses % 0.19/0.37 # 23 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 6 % 0.19/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 13 tableaux to operate on % 4.71/0.98 # Creating equality axioms % 4.71/0.98 # Ran out of tableaux, making start rules for all clauses % 4.71/0.99 # Creating equality axioms % 4.71/0.99 # Ran out of tableaux, making start rules for all clauses % 7.03/1.24 # Creating equality axioms % 7.03/1.24 # Ran out of tableaux, making start rules for all clauses % 10.50/1.69 # Creating equality axioms % 10.50/1.69 # Ran out of tableaux, making start rules for all clauses % 39.84/5.38 # There were 12 total branch saturation attempts. % 39.84/5.38 # There were 0 of these attempts blocked. % 39.84/5.38 # There were 0 deferred branch saturation attempts. % 39.84/5.38 # There were 0 free duplicated saturations. % 39.84/5.38 # There were 6 total successful branch saturations. % 39.84/5.38 # There were 0 successful branch saturations in interreduction. % 39.84/5.38 # There were 0 successful branch saturations on the branch. % 39.84/5.38 # There were 6 successful branch saturations after the branch. % 39.84/5.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 39.84/5.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 39.84/5.38 # Begin clausification derivation % 39.84/5.38 % 39.84/5.38 # End clausification derivation % 39.84/5.38 # Begin listing active clauses obtained from FOF to CNF conversion % 39.84/5.38 cnf(i_0_59, negated_conjecture, (function(esk11_0))). % 39.84/5.38 cnf(i_0_60, negated_conjecture, (relation(esk11_0))). % 39.84/5.38 cnf(i_0_28, plain, (empty(empty_set))). % 39.84/5.38 cnf(i_0_43, plain, (function(esk4_0))). % 39.84/5.38 cnf(i_0_27, plain, (relation(empty_set))). % 39.84/5.38 cnf(i_0_44, plain, (relation(esk4_0))). % 39.84/5.38 cnf(i_0_45, plain, (relation(esk5_0))). % 39.84/5.38 cnf(i_0_48, plain, (relation(esk7_0))). % 39.84/5.38 cnf(i_0_52, plain, (relation(esk9_0))). % 39.84/5.38 cnf(i_0_46, plain, (empty(esk5_0))). % 39.84/5.38 cnf(i_0_47, plain, (empty(esk6_0))). % 39.84/5.38 cnf(i_0_26, plain, (relation_empty_yielding(empty_set))). % 39.84/5.38 cnf(i_0_31, plain, (function(identity_relation(X1)))). % 39.84/5.38 cnf(i_0_23, plain, (relation(identity_relation(X1)))). % 39.84/5.38 cnf(i_0_63, plain, (relation_dom(identity_relation(X1))=X1)). % 39.84/5.38 cnf(i_0_51, plain, (relation_empty_yielding(esk9_0))). % 39.84/5.38 cnf(i_0_62, plain, (relation_rng(identity_relation(X1))=X1)). % 39.84/5.38 cnf(i_0_25, plain, (element(esk3_1(X1),X1))). % 39.84/5.38 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 39.84/5.38 cnf(i_0_49, plain, (~empty(esk7_0))). % 39.84/5.38 cnf(i_0_50, plain, (~empty(esk8_0))). % 39.84/5.38 cnf(i_0_33, plain, (~empty(singleton(X1)))). % 39.84/5.38 cnf(i_0_34, plain, (~empty(unordered_pair(X1,X2)))). % 39.84/5.38 cnf(i_0_56, negated_conjecture, (relation_dom(esk11_0)=esk10_0|identity_relation(esk10_0)=esk11_0)). % 39.84/5.38 cnf(i_0_57, negated_conjecture, (apply(esk11_0,esk12_0)!=esk12_0|identity_relation(esk10_0)!=esk11_0|relation_dom(esk11_0)!=esk10_0)). % 39.84/5.38 cnf(i_0_58, negated_conjecture, (in(esk12_0,esk10_0)|identity_relation(esk10_0)!=esk11_0|relation_dom(esk11_0)!=esk10_0)). % 39.84/5.38 cnf(i_0_64, plain, (~empty(X1)|~in(X2,X1))). % 39.84/5.38 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 39.84/5.38 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 39.84/5.38 cnf(i_0_61, plain, (X1=empty_set|~empty(X1))). % 39.84/5.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 39.84/5.38 cnf(i_0_39, plain, (relation(relation_dom(X1))|~empty(X1))). % 39.84/5.38 cnf(i_0_55, negated_conjecture, (apply(esk11_0,X1)=X1|identity_relation(esk10_0)=esk11_0|~in(X1,esk10_0))). % 39.84/5.38 cnf(i_0_40, plain, (empty(relation_dom(X1))|~empty(X1))). % 39.84/5.38 cnf(i_0_41, plain, (relation(relation_rng(X1))|~empty(X1))). % 39.84/5.38 cnf(i_0_37, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 39.84/5.38 cnf(i_0_65, plain, (X1=X2|~empty(X2)|~empty(X1))). % 39.84/5.38 cnf(i_0_53, plain, (element(X1,X2)|~in(X1,X2))). % 39.84/5.38 cnf(i_0_38, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 39.84/5.38 cnf(i_0_42, plain, (empty(relation_rng(X1))|~empty(X1))). % 39.84/5.38 cnf(i_0_54, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 39.84/5.38 cnf(i_0_12, plain, (apply(X1,X2)=empty_set|in(X2,relation_dom(X1))|~relation(X1)|~function(X1))). % 39.84/5.38 cnf(i_0_68, plain, (in(X1,relation_dom(X2))|~relation(X2)|~function(X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2))). % 39.84/5.38 cnf(i_0_67, plain, (X1=apply(X2,X3)|~relation(X2)|~function(X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2))). % 39.84/5.38 cnf(i_0_9, plain, (X1=X2|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),identity_relation(X3)))). % 39.84/5.38 cnf(i_0_10, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),identity_relation(X2)))). % 39.84/5.38 cnf(i_0_14, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X2,X1))),X2)|~relation(X2)|~function(X2)|~in(X1,relation_dom(X2)))). % 39.84/5.38 cnf(i_0_7, plain, (X1=identity_relation(X2)|esk1_2(X2,X1)!=esk2_2(X2,X1)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X2,X1)),unordered_pair(esk2_2(X2,X1),esk1_2(X2,X1))),X1)|~in(esk1_2(X2,X1),X2))). % 39.84/5.38 cnf(i_0_5, plain, (esk1_2(X1,X2)=esk2_2(X1,X2)|X2=identity_relation(X1)|in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk1_2(X1,X2))),X2)|~relation(X2))). % 39.84/5.38 cnf(i_0_6, plain, (X1=identity_relation(X2)|in(unordered_pair(singleton(esk1_2(X2,X1)),unordered_pair(esk2_2(X2,X1),esk1_2(X2,X1))),X1)|in(esk1_2(X2,X1),X2)|~relation(X1))). % 39.84/5.38 cnf(i_0_8, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),identity_relation(X2))|~in(X1,X2))). % 39.84/5.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 39.84/5.38 # Begin printing tableau % 39.84/5.38 # Found 8 steps % 39.84/5.38 cnf(i_0_60, negated_conjecture, (relation(esk11_0)), inference(start_rule)). % 39.84/5.38 cnf(i_0_88, plain, (relation(esk11_0)), inference(extension_rule, [i_0_7])). % 39.84/5.38 cnf(i_0_559214, plain, (esk11_0=identity_relation(esk10_0)), inference(extension_rule, [i_0_58])). % 39.84/5.38 cnf(i_0_559215, plain, (esk1_2(esk10_0,esk11_0)!=esk2_2(esk10_0,esk11_0)), inference(etableau_closure_rule, [i_0_559215, ...])). % 39.84/5.38 cnf(i_0_559217, plain, (~in(unordered_pair(singleton(esk1_2(esk10_0,esk11_0)),unordered_pair(esk2_2(esk10_0,esk11_0),esk1_2(esk10_0,esk11_0))),esk11_0)), inference(etableau_closure_rule, [i_0_559217, ...])). % 39.84/5.38 cnf(i_0_559218, plain, (~in(esk1_2(esk10_0,esk11_0),esk10_0)), inference(etableau_closure_rule, [i_0_559218, ...])). % 39.84/5.38 cnf(i_0_559236, plain, (in(esk12_0,esk10_0)), inference(etableau_closure_rule, [i_0_559236, ...])). % 39.84/5.38 cnf(i_0_559238, plain, (relation_dom(esk11_0)!=esk10_0), inference(etableau_closure_rule, [i_0_559238, ...])). % 39.84/5.38 # End printing tableau % 39.84/5.38 # SZS output end % 39.84/5.38 # Branches closed with saturation will be marked with an "s" % 39.84/5.38 # Child (32390) has found a proof. % 39.84/5.38 % 39.84/5.38 # Proof search is over... % 39.84/5.38 # Freeing feature tree %------------------------------------------------------------------------------