%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.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 : n029.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 00:13:01 EDT 2022 % Result : Theorem 0.20s 0.37s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sat Jun 4 12:20:33 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 11 Number of unprocessed: 9 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 9 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 2 conjectures. % 0.20/0.37 # There are 2 start rule candidates: % 0.20/0.37 # Found 8 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 2 start rule tableaux created. % 0.20/0.37 # 1 extension rule candidate clauses % 0.20/0.37 # 8 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.37 # Creating equality axioms % 0.20/0.37 # Ran out of tableaux, making start rules for all clauses % 0.20/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 9 tableaux to operate on % 0.20/0.37 # Closed tableau found in foldup close cycle with 1 folds and 1 closures done. % 0.20/0.37 # There were 0 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 0 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 0 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_9, hypothesis, (hoare_165779456gleton)). % 0.20/0.37 cnf(i_0_11, negated_conjecture, (is_state(esk3_0))). % 0.20/0.37 cnf(i_0_7, plain, (induct_true)). % 0.20/0.37 cnf(i_0_5, plain, (is_state(esk1_0))). % 0.20/0.37 cnf(i_0_4, plain, (is_state(esk2_0))). % 0.20/0.37 cnf(i_0_1, plain, (is_state(undefined_state(state)))). % 0.20/0.37 cnf(i_0_6, plain, (~induct_false)). % 0.20/0.37 cnf(i_0_3, plain, (esk2_0!=esk1_0)). % 0.20/0.37 cnf(i_0_10, negated_conjecture, (X1=esk3_0|~is_state(X1))). % 0.20/0.37 cnf(i_0_21, plain, (X9=X9)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 6 steps % 0.20/0.37 cnf(i_0_3, plain, (esk2_0!=esk1_0), inference(start_rule)). % 0.20/0.37 cnf(i_0_34, plain, (esk2_0!=esk1_0), inference(extension_rule, [i_0_24])). % 0.20/0.37 cnf(i_0_59, plain, (esk2_0!=esk3_0), inference(extension_rule, [i_0_10])). % 0.20/0.37 cnf(i_0_62, plain, (~is_state(esk2_0)), inference(closure_rule, [i_0_4])). % 0.20/0.37 cnf(i_0_60, plain, (esk1_0!=esk3_0), inference(extension_rule, [i_0_10])). % 0.20/0.37 cnf(i_0_135, plain, (~is_state(esk1_0)), inference(closure_rule, [i_0_5])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # Child (13280) has found a proof. % 0.20/0.37 % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------