%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM008+1 : TPTP v8.1.0. Released v3.2.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 : Fri Jul 15 01:14:54 EDT 2022 % Result : Theorem 0.18s 0.40s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : COM008+1 : TPTP v8.1.0. Released v3.2.0. % 0.06/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 : n019.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 : Thu Jun 16 17:11:09 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 15 Number of unprocessed: 15 % 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 # 15 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 4 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 11 extension rule candidate clauses % 0.12/0.36 # 4 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 1 % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 22 tableaux to operate on % 0.18/0.40 # There were 2 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 2 total successful branch saturations. % 0.18/0.40 # There were 0 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 2 successful branch saturations after the branch. % 0.18/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_3, plain, (transitive_reflexive_rewrite(a,b))). % 0.18/0.40 cnf(i_0_2, plain, (transitive_reflexive_rewrite(a,c))). % 0.18/0.40 cnf(i_0_4, plain, (equalish(X1,X1))). % 0.18/0.40 cnf(i_0_15, negated_conjecture, (~goal)). % 0.18/0.40 cnf(i_0_1, plain, (~transitive_reflexive_rewrite(b,X1)|~transitive_reflexive_rewrite(c,X1))). % 0.18/0.40 cnf(i_0_6, plain, (transitive_reflexive_rewrite(X1,X2)|~equalish(X1,X2))). % 0.18/0.40 cnf(i_0_7, plain, (transitive_reflexive_rewrite(X1,X2)|~rewrite(X1,X2))). % 0.18/0.40 cnf(i_0_5, plain, (equalish(X1,X2)|~equalish(X2,X1))). % 0.18/0.40 cnf(i_0_8, plain, (transitive_reflexive_rewrite(X1,X2)|~transitive_reflexive_rewrite(X3,X2)|~transitive_reflexive_rewrite(X1,X3))). % 0.18/0.40 cnf(i_0_9, plain, (transitive_reflexive_rewrite(X1,esk1_3(X2,X3,X1))|~rewrite(X2,X3)|~rewrite(X2,X1))). % 0.18/0.40 cnf(i_0_10, plain, (transitive_reflexive_rewrite(X1,esk1_3(X2,X1,X3))|~rewrite(X2,X3)|~rewrite(X2,X1))). % 0.18/0.40 cnf(i_0_14, plain, (rewrite(X1,esk3_2(X1,X2))|equalish(X1,X2)|~transitive_reflexive_rewrite(X1,X2))). % 0.18/0.40 cnf(i_0_13, plain, (equalish(X1,X2)|transitive_reflexive_rewrite(esk3_2(X1,X2),X2)|~transitive_reflexive_rewrite(X1,X2))). % 0.18/0.40 cnf(i_0_11, plain, (transitive_reflexive_rewrite(X1,esk2_3(X2,X3,X1))|~rewrite(a,X2)|~transitive_reflexive_rewrite(X2,X3)|~transitive_reflexive_rewrite(X2,X1))). % 0.18/0.40 cnf(i_0_12, plain, (transitive_reflexive_rewrite(X1,esk2_3(X2,X1,X3))|~rewrite(a,X2)|~transitive_reflexive_rewrite(X2,X3)|~transitive_reflexive_rewrite(X2,X1))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 5 steps % 0.18/0.40 cnf(i_0_3, plain, (transitive_reflexive_rewrite(a,b)), inference(start_rule)). % 0.18/0.40 cnf(i_0_48, plain, (transitive_reflexive_rewrite(a,b)), inference(extension_rule, [i_0_13])). % 0.18/0.40 cnf(i_0_103, plain, (equalish(a,b)), inference(extension_rule, [i_0_5])). % 0.18/0.40 cnf(i_0_104, plain, (transitive_reflexive_rewrite(esk3_2(a,b),b)), inference(etableau_closure_rule, [i_0_104, ...])). % 0.18/0.40 cnf(i_0_120, plain, (equalish(b,a)), inference(etableau_closure_rule, [i_0_120, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.40 # Child (15025) has found a proof. % 0.18/0.40 % 0.18/0.40 # Proof search is over... % 0.18/0.40 # Freeing feature tree %------------------------------------------------------------------------------