%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN078-1 : 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 : n006.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:58 EDT 2022 % Result : Satisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN078-1 : TPTP v8.1.0. Released v1.0.0. % 0.11/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 : n006.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 : Tue Jul 12 08:59:05 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_S4d % 0.13/0.37 # and selection function SelectCQIPrecWNTNp. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 12 Number of unprocessed: 12 % 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 # 12 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 12 conjectures. % 0.13/0.37 # There are 12 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 # 12 start rule tableaux created. % 0.13/0.37 # 12 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 # 31992 Satisfiable branch % 0.13/0.37 # 31997 Satisfiable branch % 0.13/0.37 # 31998 Satisfiable branch % 0.13/0.37 # 31996 Satisfiable branch % 0.13/0.37 # Satisfiable branch found. % 0.13/0.37 # There were 1 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 Satisfiable 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_19, negated_conjecture, (f(b)=b|big_f(c))). % 0.13/0.37 cnf(i_0_24, negated_conjecture, (~big_f(f(c))|~big_f(b))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (big_f(c)|~big_f(b))). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (f(b)=b|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_22, negated_conjecture, (big_f(a)|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (big_f(c)|big_f(a))). % 0.13/0.37 cnf(i_0_17, negated_conjecture, (big_f(f(X1))|big_f(c)|~big_f(X1))). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (big_f(X1)|f(X1)!=X1|~big_f(b)|~big_f(X2))). % 0.13/0.37 cnf(i_0_14, negated_conjecture, (big_f(a)|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (big_f(f(X1))|~big_f(f(c))|~big_f(X1))). % 0.13/0.37 cnf(i_0_15, negated_conjecture, (f(b)=b|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_13, negated_conjecture, (big_f(f(X1))|big_f(X2)|f(X2)!=X2|~big_f(X1)|~big_f(X3))). % 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_21, negated_conjecture, (big_f(f(c))|~big_f(f(c))|~big_f(c)), inference(start_rule)). % 0.13/0.37 cnf(i_0_34, plain, (big_f(f(c))), inference(extension_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_64, plain, (~big_f(f(c))), inference(closure_rule, [i_0_34])). % 0.13/0.37 cnf(i_0_60, plain, (big_f(f(f(c)))), inference(extension_rule, [i_0_15])). % 0.13/0.37 cnf(i_0_65, plain, (f(b)=b), inference(extension_rule, [i_0_14])). % 0.13/0.37 cnf(i_0_75, plain, (~big_f(f(f(c)))), inference(closure_rule, [i_0_60])). % 0.13/0.37 cnf(i_0_66, plain, (big_f(b)), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_82, plain, (~big_f(b)), inference(closure_rule, [i_0_66])). % 0.13/0.37 cnf(i_0_67, plain, (f(b)!=b), inference(extension_rule, [i_0_23])). % 0.13/0.37 cnf(i_0_94, plain, (~big_f(f(c))), inference(closure_rule, [i_0_34])). % 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 # Satisfiable branch found. % 0.13/0.37 # There were 1 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 Satisfiable 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_19, negated_conjecture, (f(b)=b|big_f(c))). % 0.13/0.37 cnf(i_0_24, negated_conjecture, (~big_f(f(c))|~big_f(b))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (big_f(c)|~big_f(b))). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (f(b)=b|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_22, negated_conjecture, (big_f(a)|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (big_f(c)|big_f(a))). % 0.13/0.37 cnf(i_0_17, negated_conjecture, (big_f(f(X1))|big_f(c)|~big_f(X1))). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (big_f(X1)|f(X1)!=X1|~big_f(b)|~big_f(X2))). % 0.13/0.37 cnf(i_0_14, negated_conjecture, (big_f(a)|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (big_f(f(X1))|~big_f(f(c))|~big_f(X1))). % 0.13/0.37 cnf(i_0_15, negated_conjecture, (f(b)=b|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_13, negated_conjecture, (big_f(f(X1))|big_f(X2)|f(X2)!=X2|~big_f(X1)|~big_f(X3))). % 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 4 steps % 0.13/0.37 cnf(i_0_18, negated_conjecture, (big_f(c)|big_f(a)), inference(start_rule)). % 0.13/0.37 cnf(i_0_48, plain, (big_f(c)), inference(extension_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_64, plain, (~big_f(c)), inference(closure_rule, [i_0_48])). % 0.13/0.37 cnf(i_0_60, plain, (big_f(f(c))), inference(extension_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 # Satisfiable branch found. % 0.13/0.37 # There were 1 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 # Satisfiable branch found. % 0.13/0.37 # There were 1 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 Satisfiable 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_19, negated_conjecture, (f(b)=b|big_f(c))). % 0.13/0.37 cnf(i_0_24, negated_conjecture, (~big_f(f(c))|~big_f(b))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (big_f(c)|~big_f(b))). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (f(b)=b|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_22, negated_conjecture, (big_f(a)|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (big_f(c)|big_f(a))). % 0.13/0.37 cnf(i_0_17, negated_conjecture, (big_f(f(X1))|big_f(c)|~big_f(X1))). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (big_f(X1)|f(X1)!=X1|~big_f(b)|~big_f(X2))). % 0.13/0.37 cnf(i_0_14, negated_conjecture, (big_f(a)|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (big_f(f(X1))|~big_f(f(c))|~big_f(X1))). % 0.13/0.37 cnf(i_0_15, negated_conjecture, (f(b)=b|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_13, negated_conjecture, (big_f(f(X1))|big_f(X2)|f(X2)!=X2|~big_f(X1)|~big_f(X3))). % 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_17, negated_conjecture, (big_f(f(c))|big_f(c)|~big_f(c)), inference(start_rule)). % 0.13/0.37 cnf(i_0_45, plain, (big_f(f(c))), inference(extension_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_64, plain, (~big_f(f(c))), inference(closure_rule, [i_0_45])). % 0.13/0.37 cnf(i_0_60, plain, (big_f(f(f(c)))), inference(extension_rule, [i_0_15])). % 0.13/0.37 cnf(i_0_65, plain, (f(b)=b), inference(extension_rule, [i_0_14])). % 0.13/0.37 cnf(i_0_75, plain, (~big_f(f(f(c)))), inference(closure_rule, [i_0_60])). % 0.13/0.37 cnf(i_0_66, plain, (big_f(b)), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_82, plain, (~big_f(b)), inference(closure_rule, [i_0_66])). % 0.13/0.37 cnf(i_0_67, plain, (f(b)!=b), inference(extension_rule, [i_0_23])). % 0.13/0.37 cnf(i_0_94, plain, (~big_f(f(c))), inference(closure_rule, [i_0_45])). % 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 # SZS status Satisfiable 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_19, negated_conjecture, (f(b)=b|big_f(c))). % 0.13/0.37 cnf(i_0_24, negated_conjecture, (~big_f(f(c))|~big_f(b))). % 0.13/0.37 cnf(i_0_20, negated_conjecture, (big_f(c)|~big_f(b))). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (f(b)=b|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_22, negated_conjecture, (big_f(a)|~big_f(f(c)))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (big_f(c)|big_f(a))). % 0.13/0.37 cnf(i_0_17, negated_conjecture, (big_f(f(X1))|big_f(c)|~big_f(X1))). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (big_f(X1)|f(X1)!=X1|~big_f(b)|~big_f(X2))). % 0.13/0.37 cnf(i_0_14, negated_conjecture, (big_f(a)|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_21, negated_conjecture, (big_f(f(X1))|~big_f(f(c))|~big_f(X1))). % 0.13/0.37 cnf(i_0_15, negated_conjecture, (f(b)=b|big_f(X1)|f(X1)!=X1|~big_f(X2))). % 0.13/0.37 cnf(i_0_13, negated_conjecture, (big_f(f(X1))|big_f(X2)|f(X2)!=X2|~big_f(X1)|~big_f(X3))). % 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 4 steps % 0.13/0.37 cnf(i_0_22, negated_conjecture, (big_f(a)|~big_f(f(c))), inference(start_rule)). % 0.13/0.37 cnf(i_0_50, plain, (big_f(a)), inference(extension_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_64, plain, (~big_f(a)), inference(closure_rule, [i_0_50])). % 0.13/0.37 cnf(i_0_60, plain, (big_f(f(a))), inference(extension_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 # Child (31997) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------