%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU280+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 : n011.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:28 EDT 2022 % Result : Theorem 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU280+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.33 % Computer : n011.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 01:22:09 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.19/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 30 Number of unprocessed: 30 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # 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 # 30 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 3 conjectures. % 0.19/0.37 # There are 3 start rule candidates: % 0.19/0.37 # Found 3 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 3 start rule tableaux created. % 0.19/0.37 # 27 extension rule candidate clauses % 0.19/0.37 # 3 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 3 % 0.19/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 14 tableaux to operate on % 0.19/0.38 # Creating equality axioms % 0.19/0.38 # Ran out of tableaux, making start rules for all clauses % 0.19/0.38 # Creating equality axioms % 0.19/0.38 # Ran out of tableaux, making start rules for all clauses % 0.19/0.39 # Creating equality axioms % 0.19/0.39 # Ran out of tableaux, making start rules for all clauses % 0.19/0.39 # Creating equality axioms % 0.19/0.39 # Ran out of tableaux, making start rules for all clauses % 0.19/0.39 # Creating equality axioms % 0.19/0.39 # Ran out of tableaux, making start rules for all clauses % 0.19/0.40 # Creating equality axioms % 0.19/0.40 # Ran out of tableaux, making start rules for all clauses % 0.19/0.40 # There were 4 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 4 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 4 successful branch saturations after the branch. % 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_5, plain, (ordinal(esk3_0))). % 0.19/0.40 cnf(i_0_7, plain, (epsilon_transitive(esk3_0))). % 0.19/0.40 cnf(i_0_6, plain, (epsilon_connected(esk3_0))). % 0.19/0.40 cnf(i_0_10, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.19/0.40 cnf(i_0_9, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.19/0.40 cnf(i_0_1, negated_conjecture, (ordinal(esk2_1(X1))|in(esk2_1(X1),X1))). % 0.19/0.40 cnf(i_0_2, negated_conjecture, (in(esk2_1(X1),esk1_0)|in(esk2_1(X1),X1))). % 0.19/0.40 cnf(i_0_4, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.19/0.40 cnf(i_0_28, plain, (esk4_0=esk5_0|ordinal(X1)|~in(X1,esk7_1(X2)))). % 0.19/0.40 cnf(i_0_8, plain, (~in(X1,X2)|~in(X2,X1))). % 0.19/0.40 cnf(i_0_24, plain, (ordinal(esk5_0)|ordinal(X1)|~in(X1,esk7_1(X2)))). % 0.19/0.40 cnf(i_0_16, plain, (ordinal(esk6_0)|ordinal(X1)|~in(X1,esk7_1(X2)))). % 0.19/0.40 cnf(i_0_20, plain, (esk4_0=esk6_0|ordinal(X1)|~in(X1,esk7_1(X2)))). % 0.19/0.40 cnf(i_0_12, plain, (ordinal(X1)|esk6_0!=esk5_0|~in(X1,esk7_1(X2)))). % 0.19/0.40 cnf(i_0_25, plain, (esk8_2(X1,X2)=X2|ordinal(esk5_0)|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_17, plain, (esk8_2(X1,X2)=X2|ordinal(esk6_0)|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_26, plain, (ordinal(esk5_0)|in(esk8_2(X1,X2),X1)|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_29, plain, (esk8_2(X1,X2)=X2|esk4_0=esk5_0|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_3, negated_conjecture, (~ordinal(esk2_1(X1))|~in(esk2_1(X1),esk1_0)|~in(esk2_1(X1),X1))). % 0.19/0.40 cnf(i_0_21, plain, (esk8_2(X1,X2)=X2|esk4_0=esk6_0|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_13, plain, (esk8_2(X1,X2)=X2|esk6_0!=esk5_0|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_18, plain, (ordinal(esk6_0)|in(esk8_2(X1,X2),X1)|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_30, plain, (esk4_0=esk5_0|in(esk8_2(X1,X2),X1)|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_22, plain, (esk4_0=esk6_0|in(esk8_2(X1,X2),X1)|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_14, plain, (in(esk8_2(X1,X2),X1)|esk6_0!=esk5_0|~in(X2,esk7_1(X1)))). % 0.19/0.40 cnf(i_0_23, plain, (ordinal(esk5_0)|in(X1,esk7_1(X2))|~ordinal(X1)|~in(X1,X2))). % 0.19/0.40 cnf(i_0_15, plain, (ordinal(esk6_0)|in(X1,esk7_1(X2))|~ordinal(X1)|~in(X1,X2))). % 0.19/0.40 cnf(i_0_27, plain, (esk4_0=esk5_0|in(X1,esk7_1(X2))|~ordinal(X1)|~in(X1,X2))). % 0.19/0.40 cnf(i_0_19, plain, (esk4_0=esk6_0|in(X1,esk7_1(X2))|~ordinal(X1)|~in(X1,X2))). % 0.19/0.40 cnf(i_0_11, plain, (in(X1,esk7_1(X2))|esk6_0!=esk5_0|~ordinal(X1)|~in(X1,X2))). % 0.19/0.40 cnf(i_0_4030, plain, (X22=X22)). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 14 steps % 0.19/0.40 cnf(i_0_4030, plain, (esk2_1(esk7_1(esk1_0))=esk2_1(esk7_1(esk1_0))), inference(start_rule)). % 0.19/0.40 cnf(i_0_4122, plain, (esk2_1(esk7_1(esk1_0))=esk2_1(esk7_1(esk1_0))), inference(extension_rule, [i_0_4034])). % 0.19/0.40 cnf(i_0_4213, plain, ($false), inference(closure_rule, [i_0_4030])). % 0.19/0.40 cnf(i_0_4211, plain, (in(esk2_1(esk7_1(esk1_0)),esk7_1(esk1_0))), inference(extension_rule, [i_0_24])). % 0.19/0.40 cnf(i_0_4215, plain, (ordinal(esk5_0)), inference(extension_rule, [i_0_10])). % 0.19/0.40 cnf(i_0_4216, plain, (ordinal(esk2_1(esk7_1(esk1_0)))), inference(extension_rule, [i_0_3])). % 0.19/0.40 cnf(i_0_4227, plain, (~in(esk2_1(esk7_1(esk1_0)),esk7_1(esk1_0))), inference(closure_rule, [i_0_4211])). % 0.19/0.40 cnf(i_0_4214, plain, (~in(esk2_1(esk7_1(esk1_0)),esk7_1(esk1_0))), inference(extension_rule, [i_0_2])). % 0.19/0.40 cnf(i_0_4228, plain, (in(esk2_1(esk7_1(esk1_0)),esk1_0)), inference(extension_rule, [i_0_15])). % 0.19/0.40 cnf(i_0_4239, plain, (in(esk2_1(esk7_1(esk1_0)),esk7_1(esk1_0))), inference(closure_rule, [i_0_4214])). % 0.19/0.40 cnf(i_0_4223, plain, (epsilon_transitive(esk5_0)), inference(etableau_closure_rule, [i_0_4223, ...])). % 0.19/0.40 cnf(i_0_4226, plain, (~in(esk2_1(esk7_1(esk1_0)),esk1_0)), inference(etableau_closure_rule, [i_0_4226, ...])). % 0.19/0.40 cnf(i_0_4238, plain, (ordinal(esk6_0)), inference(etableau_closure_rule, [i_0_4238, ...])). % 0.19/0.40 cnf(i_0_4240, plain, (~ordinal(esk2_1(esk7_1(esk1_0)))), inference(etableau_closure_rule, [i_0_4240, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # Child (24316) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------