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