%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU245+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 : n029.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:10 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU245+1 : TPTP v8.1.0. Released v3.3.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 : n029.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 : Mon Jun 20 11:47:00 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 35 Number of unprocessed: 35 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 35 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 4 conjectures. % 0.12/0.36 # There are 4 start rule candidates: % 0.12/0.36 # Found 16 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 4 start rule tableaux created. % 0.12/0.36 # 19 extension rule candidate clauses % 0.12/0.36 # 16 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 4 % 0.12/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 11 tableaux to operate on % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_3, plain, (relation(esk1_0))). % 0.12/0.38 cnf(i_0_6, plain, (relation(esk2_0))). % 0.12/0.38 cnf(i_0_9, plain, (relation(esk3_0))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (relation(esk9_0))). % 0.12/0.38 cnf(i_0_2, plain, (function(esk1_0))). % 0.12/0.38 cnf(i_0_5, plain, (function(esk2_0))). % 0.12/0.38 cnf(i_0_7, plain, (function(esk3_0))). % 0.12/0.38 cnf(i_0_1, plain, (one_to_one(esk1_0))). % 0.12/0.38 cnf(i_0_13, plain, (empty(empty_set))). % 0.12/0.38 cnf(i_0_8, plain, (empty(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (empty(esk5_0))). % 0.12/0.38 cnf(i_0_19, plain, (~empty(esk6_0))). % 0.12/0.38 cnf(i_0_21, plain, (X1=empty_set|~empty(X1))). % 0.12/0.38 cnf(i_0_17, plain, (function(X1)|~empty(X1))). % 0.12/0.38 cnf(i_0_14, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.12/0.38 cnf(i_0_24, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.38 cnf(i_0_22, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.38 cnf(i_0_15, plain, (element(esk4_1(X1),X1))). % 0.12/0.38 cnf(i_0_10, plain, (one_to_one(X1)|~relation(X1)|~function(X1)|~empty(X1))). % 0.12/0.38 cnf(i_0_23, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.38 cnf(i_0_30, plain, (~empty(X2)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_29, plain, (element(X1,X2)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_26, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). % 0.12/0.38 cnf(i_0_20, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.12/0.38 cnf(i_0_33, negated_conjecture, (in(esk7_0,esk9_0)|in(esk7_0,relation_restriction(esk9_0,esk8_0)))). % 0.12/0.38 cnf(i_0_25, plain, (~in(X2,X1)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_40, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))). % 0.12/0.38 cnf(i_0_41, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))). % 0.12/0.38 cnf(i_0_31, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (in(esk7_0,relation_restriction(esk9_0,esk8_0))|in(esk7_0,cartesian_product2(esk8_0,esk8_0)))). % 0.12/0.38 cnf(i_0_39, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (~in(esk7_0,esk9_0)|~in(esk7_0,relation_restriction(esk9_0,esk8_0))|~in(esk7_0,cartesian_product2(esk8_0,esk8_0)))). % 0.12/0.38 cnf(i_0_36, plain, (X3=set_intersection2(X1,X2)|in(esk10_3(X1,X2,X3),X3)|in(esk10_3(X1,X2,X3),X2))). % 0.12/0.38 cnf(i_0_37, plain, (X3=set_intersection2(X1,X2)|in(esk10_3(X1,X2,X3),X3)|in(esk10_3(X1,X2,X3),X1))). % 0.12/0.38 cnf(i_0_38, plain, (X3=set_intersection2(X1,X2)|~in(esk10_3(X1,X2,X3),X3)|~in(esk10_3(X1,X2,X3),X2)|~in(esk10_3(X1,X2,X3),X1))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 4 steps % 0.12/0.38 cnf(i_0_35, negated_conjecture, (relation(esk9_0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_49, plain, (relation(esk9_0)), inference(extension_rule, [i_0_26])). % 0.12/0.38 cnf(i_0_225, plain, (relation(relation_restriction(esk9_0,X6))), inference(extension_rule, [i_0_31])). % 0.12/0.38 cnf(i_0_249, plain, (set_intersection2(relation_restriction(esk9_0,X6),cartesian_product2(X5,X5))=relation_restriction(relation_restriction(esk9_0,X6),X5)), inference(etableau_closure_rule, [i_0_249, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_3, plain, (relation(esk1_0))). % 0.12/0.38 cnf(i_0_6, plain, (relation(esk2_0))). % 0.12/0.38 cnf(i_0_9, plain, (relation(esk3_0))). % 0.12/0.38 cnf(i_0_35, negated_conjecture, (relation(esk9_0))). % 0.12/0.38 cnf(i_0_2, plain, (function(esk1_0))). % 0.12/0.38 cnf(i_0_5, plain, (function(esk2_0))). % 0.12/0.38 cnf(i_0_7, plain, (function(esk3_0))). % 0.12/0.38 cnf(i_0_1, plain, (one_to_one(esk1_0))). % 0.12/0.38 cnf(i_0_13, plain, (empty(empty_set))). % 0.12/0.38 cnf(i_0_8, plain, (empty(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (empty(esk5_0))). % 0.12/0.38 cnf(i_0_19, plain, (~empty(esk6_0))). % 0.12/0.38 cnf(i_0_21, plain, (X1=empty_set|~empty(X1))). % 0.12/0.38 cnf(i_0_17, plain, (function(X1)|~empty(X1))). % 0.12/0.38 cnf(i_0_14, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.12/0.38 cnf(i_0_24, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.38 cnf(i_0_22, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.38 cnf(i_0_15, plain, (element(esk4_1(X1),X1))). % 0.12/0.38 cnf(i_0_10, plain, (one_to_one(X1)|~relation(X1)|~function(X1)|~empty(X1))). % 0.12/0.38 cnf(i_0_23, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.38 cnf(i_0_30, plain, (~empty(X2)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_29, plain, (element(X1,X2)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_26, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). % 0.12/0.38 cnf(i_0_20, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.12/0.38 cnf(i_0_33, negated_conjecture, (in(esk7_0,esk9_0)|in(esk7_0,relation_restriction(esk9_0,esk8_0)))). % 0.12/0.38 cnf(i_0_25, plain, (~in(X2,X1)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_40, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))). % 0.12/0.38 cnf(i_0_41, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))). % 0.12/0.38 cnf(i_0_31, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (in(esk7_0,relation_restriction(esk9_0,esk8_0))|in(esk7_0,cartesian_product2(esk8_0,esk8_0)))). % 0.12/0.38 cnf(i_0_39, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))). % 0.12/0.38 cnf(i_0_34, negated_conjecture, (~in(esk7_0,esk9_0)|~in(esk7_0,relation_restriction(esk9_0,esk8_0))|~in(esk7_0,cartesian_product2(esk8_0,esk8_0)))). % 0.12/0.38 cnf(i_0_36, plain, (X3=set_intersection2(X1,X2)|in(esk10_3(X1,X2,X3),X3)|in(esk10_3(X1,X2,X3),X2))). % 0.12/0.38 cnf(i_0_37, plain, (X3=set_intersection2(X1,X2)|in(esk10_3(X1,X2,X3),X3)|in(esk10_3(X1,X2,X3),X1))). % 0.12/0.38 cnf(i_0_38, plain, (X3=set_intersection2(X1,X2)|~in(esk10_3(X1,X2,X3),X3)|~in(esk10_3(X1,X2,X3),X2)|~in(esk10_3(X1,X2,X3),X1))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_32, negated_conjecture, (in(esk7_0,relation_restriction(esk9_0,esk8_0))|in(esk7_0,cartesian_product2(esk8_0,esk8_0))), inference(start_rule)). % 0.12/0.38 cnf(i_0_45, plain, (in(esk7_0,relation_restriction(esk9_0,esk8_0))), inference(extension_rule, [i_0_30])). % 0.12/0.38 cnf(i_0_163, plain, (~empty(relation_restriction(esk9_0,esk8_0))), inference(extension_rule, [i_0_20])). % 0.12/0.38 cnf(i_0_182, plain, (~element(esk4_1(relation_restriction(esk9_0,esk8_0)),relation_restriction(esk9_0,esk8_0))), inference(closure_rule, [i_0_15])). % 0.12/0.38 cnf(i_0_46, plain, (in(esk7_0,cartesian_product2(esk8_0,esk8_0))), inference(etableau_closure_rule, [i_0_46, ...])). % 0.12/0.38 cnf(i_0_181, plain, (in(esk4_1(relation_restriction(esk9_0,esk8_0)),relation_restriction(esk9_0,esk8_0))), inference(etableau_closure_rule, [i_0_181, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (12312) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------