%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.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 : n005.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 : Thu Jul 21 06:07:59 EDT 2022 % Result : Theorem 0.06s 0.27s % Output : CNFRefutation 0.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.07 % Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.0. % 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.06/0.26 % Computer : n005.cluster.edu % 0.06/0.26 % Model : x86_64 x86_64 % 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.26 % Memory : 8042.1875MB % 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.26 % CPULimit : 300 % 0.06/0.26 % WCLimit : 600 % 0.06/0.26 % DateTime : Mon Jul 11 13:40:21 EDT 2022 % 0.06/0.26 % CPUTime : % 0.06/0.27 # No SInE strategy applied % 0.06/0.27 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.06/0.27 # and selection function SelectComplexExceptUniqMaxHorn. % 0.06/0.27 # % 0.06/0.27 # Presaturation interreduction done % 0.06/0.27 # Number of axioms: 4 Number of unprocessed: 4 % 0.06/0.27 # Tableaux proof search. % 0.06/0.27 # APR header successfully linked. % 0.06/0.27 # Hello from C++ % 0.06/0.27 # The folding up rule is enabled... % 0.06/0.27 # Local unification is enabled... % 0.06/0.27 # Any saturation attempts will use folding labels... % 0.06/0.27 # 4 beginning clauses after preprocessing and clausification % 0.06/0.27 # Creating start rules for all 1 conjectures. % 0.06/0.27 # There are 1 start rule candidates: % 0.06/0.27 # Found 3 unit axioms. % 0.06/0.27 # 1 start rule tableaux created. % 0.06/0.27 # 1 extension rule candidate clauses % 0.06/0.27 # 3 unit axiom clauses % 0.06/0.27 % 0.06/0.27 # Requested 8, 32 cores available to the main process. % 0.06/0.27 # There are not enough tableaux to fork, creating more from the initial 1 % 0.06/0.27 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.06/0.27 # There were 0 total branch saturation attempts. % 0.06/0.27 # There were 0 of these attempts blocked. % 0.06/0.27 # There were 0 deferred branch saturation attempts. % 0.06/0.27 # There were 0 free duplicated saturations. % 0.06/0.27 # There were 0 total successful branch saturations. % 0.06/0.27 # There were 0 successful branch saturations in interreduction. % 0.06/0.27 # There were 0 successful branch saturations on the branch. % 0.06/0.27 # There were 0 successful branch saturations after the branch. % 0.06/0.27 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.27 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.06/0.27 # Begin clausification derivation % 0.06/0.27 % 0.06/0.27 # End clausification derivation % 0.06/0.27 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.27 cnf(i_0_1, plain, (big_f(f(a,b),f(b,c)))). % 0.06/0.27 cnf(i_0_2, plain, (big_f(f(b,c),f(a,c)))). % 0.06/0.27 cnf(i_0_4, negated_conjecture, (~big_f(f(a,b),f(a,c)))). % 0.06/0.27 cnf(i_0_3, plain, (big_f(X1,X2)|~big_f(X3,X2)|~big_f(X1,X3))). % 0.06/0.27 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.27 # Begin printing tableau % 0.06/0.27 # Found 4 steps % 0.06/0.27 cnf(i_0_4, negated_conjecture, (~big_f(f(a,b),f(a,c))), inference(start_rule)). % 0.06/0.27 cnf(i_0_5, plain, (~big_f(f(a,b),f(a,c))), inference(extension_rule, [i_0_3])). % 0.06/0.27 cnf(i_0_7, plain, (~big_f(f(b,c),f(a,c))), inference(closure_rule, [i_0_2])). % 0.06/0.27 cnf(i_0_8, plain, (~big_f(f(a,b),f(b,c))), inference(closure_rule, [i_0_1])). % 0.06/0.27 # End printing tableau % 0.06/0.27 # SZS output end % 0.06/0.27 # Branches closed with saturation will be marked with an "s" % 0.06/0.27 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.06/0.27 # We now have 1 tableaux to operate on % 0.06/0.27 # Found closed tableau during pool population. % 0.06/0.27 # Proof search is over... % 0.06/0.27 # Freeing feature tree %------------------------------------------------------------------------------