%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU187+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:35 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0. % 0.10/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.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jun 19 21:51:24 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.13/0.36 # and selection function SelectComplexG. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 34 Number of unprocessed: 32 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 32 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 12 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 20 extension rule candidate clauses % 0.13/0.36 # 12 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 12 tableaux to operate on % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 2 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_21, plain, (empty(empty_set))). % 0.13/0.37 cnf(i_0_25, plain, (relation(empty_set))). % 0.13/0.37 cnf(i_0_30, plain, (empty(esk8_0))). % 0.13/0.37 cnf(i_0_31, plain, (empty(esk9_0))). % 0.13/0.37 cnf(i_0_29, plain, (relation(esk8_0))). % 0.13/0.37 cnf(i_0_32, plain, (relation(esk10_0))). % 0.13/0.37 cnf(i_0_20, plain, (element(esk7_1(X1),X1))). % 0.13/0.37 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.13/0.37 cnf(i_0_33, plain, (~empty(esk10_0))). % 0.13/0.37 cnf(i_0_34, plain, (~empty(esk11_0))). % 0.13/0.37 cnf(i_0_23, plain, (~empty(singleton(X1)))). % 0.13/0.37 cnf(i_0_24, plain, (~empty(unordered_pair(X1,X2)))). % 0.13/0.37 cnf(i_0_39, negated_conjecture, (relation_dom(empty_set)!=empty_set|relation_rng(empty_set)!=empty_set)). % 0.13/0.37 cnf(i_0_40, plain, (X1=empty_set|~empty(X1))). % 0.13/0.37 cnf(i_0_2, plain, (relation(X1)|~empty(X1))). % 0.13/0.37 cnf(i_0_41, plain, (~empty(X1)|~in(X2,X1))). % 0.13/0.37 cnf(i_0_42, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.13/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.13/0.37 cnf(i_0_27, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 0.13/0.37 cnf(i_0_28, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 0.13/0.37 cnf(i_0_35, plain, (element(X1,X2)|~in(X1,X2))). % 0.13/0.37 cnf(i_0_36, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.13/0.37 cnf(i_0_38, plain, (X1=X2|~in(esk12_2(X1,X2),X2)|~in(esk12_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_10, plain, (in(X1,X2)|X2!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3))). % 0.13/0.37 cnf(i_0_6, plain, (in(X1,X2)|X2!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3))). % 0.13/0.37 cnf(i_0_37, plain, (X1=X2|in(esk12_2(X1,X2),X1)|in(esk12_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_7, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2)|X3!=relation_dom(X2)|~relation(X2)|~in(X1,X3))). % 0.13/0.37 cnf(i_0_9, plain, (X1=relation_rng(X2)|~relation(X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,esk5_2(X2,X1))),X2)|~in(esk5_2(X2,X1),X1))). % 0.13/0.37 cnf(i_0_5, plain, (X1=relation_dom(X2)|~relation(X2)|~in(unordered_pair(unordered_pair(esk2_2(X2,X1),X3),singleton(esk2_2(X2,X1))),X2)|~in(esk2_2(X2,X1),X1))). % 0.13/0.37 cnf(i_0_11, plain, (in(unordered_pair(unordered_pair(X1,esk4_3(X2,X3,X1)),singleton(esk4_3(X2,X3,X1))),X2)|X3!=relation_rng(X2)|~relation(X2)|~in(X1,X3))). % 0.13/0.37 cnf(i_0_4, plain, (X1=relation_dom(X2)|in(unordered_pair(singleton(esk2_2(X2,X1)),unordered_pair(esk2_2(X2,X1),esk3_2(X2,X1))),X2)|in(esk2_2(X2,X1),X1)|~relation(X2))). % 0.13/0.37 cnf(i_0_8, plain, (X1=relation_rng(X2)|in(unordered_pair(singleton(esk6_2(X2,X1)),unordered_pair(esk5_2(X2,X1),esk6_2(X2,X1))),X2)|in(esk5_2(X2,X1),X1)|~relation(X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 8 steps % 0.13/0.37 cnf(i_0_39, negated_conjecture, (relation_dom(empty_set)!=empty_set|relation_rng(empty_set)!=empty_set), inference(start_rule)). % 0.13/0.37 cnf(i_0_44, plain, (relation_rng(empty_set)!=empty_set), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_166, plain, (~relation(empty_set)), inference(closure_rule, [i_0_25])). % 0.13/0.37 cnf(i_0_164, plain, (in(unordered_pair(singleton(esk6_2(empty_set,empty_set)),unordered_pair(esk5_2(empty_set,empty_set),esk6_2(empty_set,empty_set))),empty_set)), inference(extension_rule, [i_0_41])). % 0.13/0.37 cnf(i_0_173, plain, (~empty(empty_set)), inference(closure_rule, [i_0_21])). % 0.13/0.37 cnf(i_0_165, plain, (in(esk5_2(empty_set,empty_set),empty_set)), inference(extension_rule, [i_0_1])). % 0.13/0.37 cnf(i_0_43, plain, (relation_dom(empty_set)!=empty_set), inference(etableau_closure_rule, [i_0_43, ...])). % 0.13/0.37 cnf(i_0_183, plain, (~in(empty_set,esk5_2(empty_set,empty_set))), inference(etableau_closure_rule, [i_0_183, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (15127) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------