%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU255+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 : n004.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:25:15 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.12 % Problem : SEU255+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.34 % Computer : n004.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 05:55:08 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 37 Number of unprocessed: 37 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 37 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 3 conjectures. % 0.20/0.37 # There are 3 start rule candidates: % 0.20/0.37 # Found 20 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 3 start rule tableaux created. % 0.20/0.37 # 17 extension rule candidate clauses % 0.20/0.37 # 20 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 14 tableaux to operate on % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.38 # Creating equality axioms % 0.20/0.38 # Ran out of tableaux, making start rules for all clauses % 0.20/0.45 # There were 2 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 2 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 2 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_42, negated_conjecture, (relation(esk10_0))). % 0.20/0.45 cnf(i_0_41, negated_conjecture, (antisymmetric(esk10_0))). % 0.20/0.45 cnf(i_0_27, plain, (relation(esk4_0))). % 0.20/0.45 cnf(i_0_31, plain, (relation(esk6_0))). % 0.20/0.45 cnf(i_0_19, plain, (empty(empty_set))). % 0.20/0.45 cnf(i_0_35, plain, (relation(esk8_0))). % 0.20/0.45 cnf(i_0_28, plain, (empty(esk5_0))). % 0.20/0.45 cnf(i_0_30, plain, (empty(esk6_0))). % 0.20/0.45 cnf(i_0_26, plain, (function(esk4_0))). % 0.20/0.45 cnf(i_0_29, plain, (function(esk6_0))). % 0.20/0.45 cnf(i_0_34, plain, (function(esk8_0))). % 0.20/0.45 cnf(i_0_33, plain, (one_to_one(esk8_0))). % 0.20/0.45 cnf(i_0_43, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.20/0.45 cnf(i_0_21, plain, (set_intersection2(X1,X1)=X1)). % 0.20/0.45 cnf(i_0_18, plain, (element(esk1_1(X1),X1))). % 0.20/0.45 cnf(i_0_6, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.20/0.45 cnf(i_0_7, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.20/0.45 cnf(i_0_40, negated_conjecture, (~antisymmetric(relation_restriction(esk10_0,esk9_0)))). % 0.20/0.45 cnf(i_0_32, plain, (~empty(esk7_0))). % 0.20/0.45 cnf(i_0_20, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))). % 0.20/0.45 cnf(i_0_46, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.45 cnf(i_0_45, plain, (X1=empty_set|~empty(X1))). % 0.20/0.45 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.45 cnf(i_0_39, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.45 cnf(i_0_3, plain, (one_to_one(X1)|~relation(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_13, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). % 0.20/0.45 cnf(i_0_22, plain, (antisymmetric(X1)|esk3_1(X1)!=esk2_1(X1)|~relation(X1))). % 0.20/0.45 cnf(i_0_47, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.45 cnf(i_0_38, plain, (in(X1,X2)|~relation(X2)|~in(X1,relation_restriction(X2,X3)))). % 0.20/0.45 cnf(i_0_44, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.20/0.45 cnf(i_0_9, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))). % 0.20/0.45 cnf(i_0_37, plain, (in(X1,cartesian_product2(X2,X2))|~relation(X3)|~in(X1,relation_restriction(X3,X2)))). % 0.20/0.45 cnf(i_0_36, plain, (in(X1,relation_restriction(X2,X3))|~relation(X2)|~in(X1,cartesian_product2(X3,X3))|~in(X1,X2))). % 0.20/0.45 cnf(i_0_24, plain, (antisymmetric(X1)|in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1)|~relation(X1))). % 0.20/0.45 cnf(i_0_23, plain, (antisymmetric(X1)|in(unordered_pair(singleton(esk3_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1)|~relation(X1))). % 0.20/0.45 cnf(i_0_25, plain, (X1=X2|~antisymmetric(X3)|~relation(X3)|~in(unordered_pair(singleton(X2),unordered_pair(X2,X1)),X3)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3))). % 0.20/0.45 cnf(i_0_286, plain, (X48=X48)). % 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 13 steps % 0.20/0.45 cnf(i_0_286, plain, (set_intersection2(empty_set,empty_set)=set_intersection2(empty_set,empty_set)), inference(start_rule)). % 0.20/0.45 cnf(i_0_369, plain, (set_intersection2(empty_set,empty_set)=set_intersection2(empty_set,empty_set)), inference(extension_rule, [i_0_290])). % 0.20/0.45 cnf(i_0_426, plain, (set_intersection2(empty_set,empty_set)!=empty_set), inference(closure_rule, [i_0_43])). % 0.20/0.45 cnf(i_0_424, plain, (in(set_intersection2(empty_set,empty_set),empty_set)), inference(extension_rule, [i_0_46])). % 0.20/0.45 cnf(i_0_428, plain, (~empty(empty_set)), inference(closure_rule, [i_0_19])). % 0.20/0.45 cnf(i_0_427, plain, (~in(set_intersection2(empty_set,empty_set),set_intersection2(empty_set,empty_set))), inference(extension_rule, [i_0_38])). % 0.20/0.45 cnf(i_0_450, plain, (~relation(set_intersection2(empty_set,empty_set))), inference(extension_rule, [i_0_293])). % 0.20/0.45 cnf(i_0_508, plain, (empty_set!=set_intersection2(empty_set,empty_set)), inference(closure_rule, [i_0_43])). % 0.20/0.45 cnf(i_0_451, plain, (~in(set_intersection2(empty_set,empty_set),relation_restriction(set_intersection2(empty_set,empty_set),X7))), inference(extension_rule, [i_0_290])). % 0.20/0.45 cnf(i_0_665, plain, (empty_set!=set_intersection2(empty_set,empty_set)), inference(closure_rule, [i_0_43])). % 0.20/0.45 cnf(i_0_666, plain, (set_intersection2(relation_restriction(set_intersection2(empty_set,empty_set),X7),relation_restriction(set_intersection2(empty_set,empty_set),X7))!=relation_restriction(set_intersection2(empty_set,empty_set),X7)), inference(closure_rule, [i_0_21])). % 0.20/0.45 cnf(i_0_509, plain, (~relation(empty_set)), inference(etableau_closure_rule, [i_0_509, ...])). % 0.20/0.45 cnf(i_0_667, plain, (~in(empty_set,set_intersection2(relation_restriction(set_intersection2(empty_set,empty_set),X7),relation_restriction(set_intersection2(empty_set,empty_set),X7)))), inference(etableau_closure_rule, [i_0_667, ...])). % 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 (29004) has found a proof. % 0.20/0.45 % 0.20/0.45 # Proof search is over... % 0.20/0.45 # Freeing feature tree %------------------------------------------------------------------------------