%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN335+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 : n015.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:10:02 EDT 2022 % Result : CounterSatisfiable 0.12s 0.39s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN335+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/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 : n015.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 : Mon Jul 11 15:22: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: 12 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 12 conjectures. % 0.12/0.36 # There are 12 start rule candidates: % 0.12/0.36 # Found 1 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 12 start rule tableaux created. % 0.12/0.36 # 11 extension rule candidate clauses % 0.12/0.36 # 1 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.39 # 16757 Satisfiable branch % 0.12/0.39 # Satisfiable branch found. % 0.12/0.39 # There were 1 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 0 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 0 successful branch saturations after the branch. % 0.12/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_12, negated_conjecture, (big_f(X1,esk1_2(X1,X2)))). % 0.12/0.39 cnf(i_0_2, negated_conjecture, (~big_f(esk1_2(X1,X2),X2)|~big_f(X2,X1))). % 0.12/0.39 cnf(i_0_4, negated_conjecture, (big_g(X1,esk1_2(X2,X1))|~big_f(X1,X2))). % 0.12/0.39 cnf(i_0_10, negated_conjecture, (big_f(X1,X2)|~big_g(esk1_2(X1,X2),esk1_2(X1,X2)))). % 0.12/0.39 cnf(i_0_7, negated_conjecture, (big_g(X1,X2)|~big_f(esk1_2(X1,X2),esk1_2(X1,X2)))). % 0.12/0.39 cnf(i_0_5, negated_conjecture, (big_g(X1,esk1_2(X2,X1))|big_g(X2,X1))). % 0.12/0.39 cnf(i_0_1, negated_conjecture, (big_f(esk1_2(X1,X2),X2)|big_f(X2,X1))). % 0.12/0.39 cnf(i_0_3, negated_conjecture, (big_f(X1,X2)|~big_g(X1,esk1_2(X2,X1))|~big_g(X2,X1))). % 0.12/0.39 cnf(i_0_11, negated_conjecture, (big_f(esk1_2(X1,X2),esk1_2(X1,X2))|big_f(X1,X2))). % 0.12/0.39 cnf(i_0_8, negated_conjecture, (big_g(esk1_2(X1,X2),esk1_2(X1,X2))|big_g(X1,X2))). % 0.12/0.39 cnf(i_0_6, negated_conjecture, (big_f(esk1_2(X1,X2),esk1_2(X1,X2))|~big_g(esk1_2(X1,X2),esk1_2(X1,X2))|~big_g(X1,X2))). % 0.12/0.39 cnf(i_0_9, negated_conjecture, (big_g(esk1_2(X1,X2),esk1_2(X1,X2))|~big_f(esk1_2(X1,X2),esk1_2(X1,X2))|~big_f(X1,X2))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 3 steps % 0.12/0.39 cnf(i_0_12, negated_conjecture, (big_f(X3,esk1_2(X3,X9))), inference(start_rule)). % 0.12/0.39 cnf(i_0_38, plain, (big_f(X3,esk1_2(X3,X9))), inference(extension_rule, [i_0_2])). % 0.12/0.39 cnf(i_0_1917, plain, (~big_f(esk1_2(esk1_2(X3,X9),X3),X3)), inference(extension_rule, [i_0_1])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Child (16757) has found a proof. % 0.12/0.39 % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------