%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU257+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 : n025.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:16 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.12/0.12 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n025.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 20 04:44:14 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.12/0.37 # and selection function SelectCQIPrecWNTNp. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 18 Number of unprocessed: 18 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 18 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 5 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 13 extension rule candidate clauses % 0.12/0.37 # 5 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 19 tableaux to operate on % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 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_20, negated_conjecture, (relation(esk2_0))). % 0.12/0.38 cnf(i_0_19, negated_conjecture, (well_ordering(esk2_0))). % 0.12/0.38 cnf(i_0_12, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.38 cnf(i_0_1, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.38 cnf(i_0_18, negated_conjecture, (~well_ordering(relation_restriction(esk2_0,esk1_0)))). % 0.12/0.38 cnf(i_0_9, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). % 0.12/0.38 cnf(i_0_7, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_6, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_5, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_4, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_3, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_13, plain, (reflexive(relation_restriction(X1,X2))|~reflexive(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_15, plain, (transitive(relation_restriction(X1,X2))|~transitive(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_16, plain, (antisymmetric(relation_restriction(X1,X2))|~antisymmetric(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_14, plain, (connected(relation_restriction(X1,X2))|~connected(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_17, plain, (well_founded_relation(relation_restriction(X1,X2))|~well_founded_relation(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_2, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_8, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))). % 0.12/0.38 cnf(i_0_270, plain, (X23=X23)). % 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_270, plain, (X5=X5), inference(start_rule)). % 0.12/0.38 cnf(i_0_330, plain, (X5=X5), inference(extension_rule, [i_0_274])). % 0.12/0.38 cnf(i_0_381, plain, (set_intersection2(X5,X5)!=X5), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_379, plain, (set_intersection2(X5,set_intersection2(X5,X5))=set_intersection2(X5,X5)), inference(extension_rule, [i_0_273])). % 0.12/0.38 cnf(i_0_429, plain, (set_intersection2(X5,X5)!=X5), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_427, plain, (set_intersection2(X5,set_intersection2(X5,X5))=X5), inference(etableau_closure_rule, [i_0_427, ...])). % 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 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_20, negated_conjecture, (relation(esk2_0))). % 0.12/0.38 cnf(i_0_19, negated_conjecture, (well_ordering(esk2_0))). % 0.12/0.38 cnf(i_0_12, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.38 cnf(i_0_1, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.38 cnf(i_0_18, negated_conjecture, (~well_ordering(relation_restriction(esk2_0,esk1_0)))). % 0.12/0.38 cnf(i_0_9, plain, (relation(relation_restriction(X1,X2))|~relation(X1))). % 0.12/0.38 cnf(i_0_7, plain, (reflexive(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_6, plain, (transitive(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_5, plain, (antisymmetric(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_4, plain, (connected(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_3, plain, (well_founded_relation(X1)|~well_ordering(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_13, plain, (reflexive(relation_restriction(X1,X2))|~reflexive(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_15, plain, (transitive(relation_restriction(X1,X2))|~transitive(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_16, plain, (antisymmetric(relation_restriction(X1,X2))|~antisymmetric(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_14, plain, (connected(relation_restriction(X1,X2))|~connected(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_17, plain, (well_founded_relation(relation_restriction(X1,X2))|~well_founded_relation(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_2, plain, (well_ordering(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)|~relation(X1))). % 0.12/0.38 cnf(i_0_8, plain, (set_intersection2(X1,cartesian_product2(X2,X2))=relation_restriction(X1,X2)|~relation(X1))). % 0.12/0.38 cnf(i_0_270, plain, (X23=X23)). % 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_270, plain, (X5=X5), inference(start_rule)). % 0.12/0.38 cnf(i_0_330, plain, (X5=X5), inference(extension_rule, [i_0_274])). % 0.12/0.38 cnf(i_0_381, plain, (set_intersection2(X5,X5)!=X5), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_379, plain, (set_intersection2(X5,set_intersection2(X5,X5))=set_intersection2(X5,X5)), inference(extension_rule, [i_0_273])). % 0.12/0.38 cnf(i_0_429, plain, (set_intersection2(X5,X5)!=X5), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_427, plain, (set_intersection2(X5,set_intersection2(X5,X5))=X5), inference(etableau_closure_rule, [i_0_427, ...])). % 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 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Child (25887) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------