%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM284-1.014 : 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 : Mon Jul 18 09:39:56 EDT 2022 % Result : Unsatisfiable 21.12s 21.33s % Output : CNFRefutation 21.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NUM284-1.014 : TPTP v8.1.0. Released v1.0.0. % 0.03/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 : n004.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 : Thu Jul 7 07:37:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.36 # No SInE strategy applied % 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.20/0.36 # and selection function SelectCQIPrecWNTNp. % 0.20/0.36 # % 0.20/0.36 # Presaturation interreduction done % 0.20/0.36 # Number of axioms: 6 Number of unprocessed: 6 % 0.20/0.36 # Tableaux proof search. % 0.20/0.36 # APR header successfully linked. % 0.20/0.36 # Hello from C++ % 3.51/3.67 # The folding up rule is enabled... % 3.51/3.67 # Local unification is enabled... % 3.51/3.67 # Any saturation attempts will use folding labels... % 3.51/3.67 # 6 beginning clauses after preprocessing and clausification % 3.51/3.67 # Creating start rules for all 1 conjectures. % 3.51/3.67 # There are 1 start rule candidates: % 3.51/3.67 # Found 4 unit axioms. % 3.51/3.67 # 1 start rule tableaux created. % 3.51/3.67 # 2 extension rule candidate clauses % 3.51/3.67 # 4 unit axiom clauses % 3.51/3.67 % 3.51/3.67 # Requested 8, 32 cores available to the main process. % 3.51/3.67 # There are not enough tableaux to fork, creating more from the initial 1 % 21.12/21.33 # There were 6 total branch saturation attempts. % 21.12/21.33 # There were 0 of these attempts blocked. % 21.12/21.33 # There were 0 deferred branch saturation attempts. % 21.12/21.33 # There were 1 free duplicated saturations. % 21.12/21.33 # There were 6 total successful branch saturations. % 21.12/21.33 # There were 0 successful branch saturations in interreduction. % 21.12/21.33 # There were 0 successful branch saturations on the branch. % 21.12/21.33 # There were 5 successful branch saturations after the branch. % 21.12/21.33 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.12/21.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.12/21.33 # Begin clausification derivation % 21.12/21.33 % 21.12/21.33 # End clausification derivation % 21.12/21.33 # Begin listing active clauses obtained from FOF to CNF conversion % 21.12/21.33 cnf(i_0_7, plain, (fibonacci(n0,s(n0)))). % 21.12/21.33 cnf(i_0_8, plain, (fibonacci(s(n0),s(n0)))). % 21.12/21.33 cnf(i_0_10, plain, (sum(X1,n0,X1))). % 21.12/21.33 cnf(i_0_12, negated_conjecture, (~fibonacci(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),X1))). % 21.12/21.33 cnf(i_0_11, plain, (sum(X1,s(X2),s(X3))|~sum(X1,X2,X3))). % 21.12/21.33 cnf(i_0_9, plain, (fibonacci(X1,X2)|~sum(X3,s(s(n0)),X1)|~sum(X4,s(n0),X1)|~sum(X5,X6,X2)|~fibonacci(X3,X6)|~fibonacci(X4,X5))). % 21.12/21.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 21.12/21.33 # Begin printing tableau % 21.12/21.33 # Found 13 steps % 21.12/21.33 cnf(i_0_12, negated_conjecture, (~fibonacci(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),s(n0))), inference(start_rule)). % 21.12/21.33 cnf(i_0_13, plain, (~fibonacci(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),s(n0))), inference(extension_rule, [i_0_9])). % 21.12/21.33 cnf(i_0_19, plain, (~sum(s(n0),n0,s(n0))), inference(closure_rule, [i_0_10])). % 21.12/21.33 cnf(i_0_21, plain, (~fibonacci(n0,s(n0))), inference(closure_rule, [i_0_7])). % 21.12/21.33 cnf(i_0_20, plain, (~fibonacci(s(n0),n0)), inference(extension_rule, [i_0_9])). % 21.12/21.33 cnf(i_0_7974, plain, (~fibonacci(n0,s(n0))), inference(closure_rule, [i_0_7])). % 21.12/21.33 cnf(i_0_7975, plain, (~fibonacci(n0,s(n0))), inference(closure_rule, [i_0_7])). % 21.12/21.33 cnf(i_0_18, plain, (~sum(n0,s(n0),s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))), inference(etableau_closure_rule, [i_0_18, ...])). % 21.12/21.33 cnf(i_0_7972, plain, (~sum(n0,s(n0),s(n0))), inference(extension_rule, [i_0_11])). % 21.12/21.33 cnf(i_0_7985, plain, (~sum(n0,n0,n0)), inference(closure_rule, [i_0_10])). % 21.12/21.33 cnf(i_0_17, plain, (~sum(s(n0),s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))), inference(etableau_closure_rule, [i_0_17, ...])). % 21.12/21.33 cnf(i_0_7971, plain, (~sum(n0,s(s(n0)),s(n0))), inference(etableau_closure_rule, [i_0_7971, ...])). % 21.12/21.33 cnf(i_0_7973, plain, (~sum(s(n0),s(n0),n0)), inference(etableau_closure_rule, [i_0_7973, ...])). % 21.12/21.33 # End printing tableau % 21.12/21.33 # SZS output end % 21.12/21.33 # Branches closed with saturation will be marked with an "s" % 21.12/21.33 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 21.12/21.33 # We now have 4 tableaux to operate on % 21.12/21.33 # Found closed tableau during pool population. % 21.12/21.33 # Proof search is over... % 21.12/21.33 # Freeing feature tree %------------------------------------------------------------------------------