%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET044-5 : TPTP v8.1.0. Released v1.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 : n004.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 00:56:53 EDT 2022 % Result : Unsatisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET044-5 : TPTP v8.1.0. Released v1.0.0. % 0.07/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 : n004.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 : Sun Jul 10 07:00:07 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 4 Number of unprocessed: 4 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 4 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 4 conjectures. % 0.13/0.37 # There are 4 start rule candidates: % 0.13/0.37 # Found 0 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 4 start rule tableaux created. % 0.13/0.37 # 4 extension rule candidate clauses % 0.13/0.37 # 0 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.13/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 10 tableaux to operate on % 0.13/0.37 # Closed tableau found in foldup close cycle with 4 folds and 2 closures done. % 0.13/0.37 # There were 0 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 0 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_5, negated_conjecture, (element(X1,X1)|~element(X1,a))). % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~element(X1,f(X2))|~element(X1,X2))). % 0.13/0.37 cnf(i_0_6, negated_conjecture, (element(X1,a)|~element(X1,X1))). % 0.13/0.37 cnf(i_0_8, negated_conjecture, (element(X1,f(X2))|element(X1,X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 10 steps % 0.13/0.37 cnf(i_0_5, negated_conjecture, (element(f(f(f(a))),f(f(f(a))))|~element(f(f(f(a))),a)), inference(start_rule)). % 0.13/0.37 cnf(i_0_15, plain, (element(f(f(f(a))),f(f(f(a))))), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_54, plain, (~element(f(f(f(a))),f(f(a)))), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_56, plain, (element(f(f(f(a))),f(a))), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_16, plain, (~element(f(f(f(a))),a)), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_67, plain, (element(f(f(f(a))),f(a))), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_73, plain, (~element(f(f(f(a))),f(f(a)))), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_62, plain, (~element(f(f(f(a))),a)), inference(extension_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_130, plain, (~element(f(f(f(a))),f(f(f(a))))), inference(closure_rule, [i_0_15])). % 0.13/0.37 cnf(i_0_79, plain, (element(f(f(f(a))),f(f(f(a))))), inference(closure_rule, [i_0_15])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Closed tableau found in foldup close cycle with 4 folds and 2 closures done. % 0.13/0.37 # There were 0 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 0 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_5, negated_conjecture, (element(X1,X1)|~element(X1,a))). % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~element(X1,f(X2))|~element(X1,X2))). % 0.13/0.37 cnf(i_0_6, negated_conjecture, (element(X1,a)|~element(X1,X1))). % 0.13/0.37 cnf(i_0_8, negated_conjecture, (element(X1,f(X2))|element(X1,X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 10 steps % 0.13/0.37 cnf(i_0_6, negated_conjecture, (element(f(f(f(a))),a)|~element(f(f(f(a))),f(f(f(a))))), inference(start_rule)). % 0.13/0.37 cnf(i_0_12, plain, (~element(f(f(f(a))),f(f(f(a))))), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_42, plain, (element(f(f(f(a))),f(f(a)))), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_54, plain, (~element(f(f(f(a))),f(a))), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_11, plain, (element(f(f(f(a))),a)), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_61, plain, (~element(f(f(f(a))),f(a))), inference(extension_rule, [i_0_8])). % 0.13/0.37 cnf(i_0_67, plain, (element(f(f(f(a))),f(f(a)))), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_73, plain, (~element(f(f(f(a))),f(f(f(a))))), inference(extension_rule, [i_0_5])). % 0.13/0.37 cnf(i_0_118, plain, (~element(f(f(f(a))),a)), inference(closure_rule, [i_0_11])). % 0.13/0.37 cnf(i_0_56, plain, (element(f(f(f(a))),a)), inference(closure_rule, [i_0_11])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Closed tableau found in foldup close cycle with 4 folds and 2 closures done. % 0.13/0.37 # There were 0 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 0 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # Child (3198) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------