%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRA014+1 : TPTP v8.1.0. Released v3.2.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 : n019.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 : Sat Jul 16 07:16:17 EDT 2022 % Result : Theorem 0.21s 0.44s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : GRA014+1 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n019.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue May 31 03:57:10 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 10 Number of unprocessed: 10 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 10 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 6 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 4 extension rule candidate clauses % 0.14/0.39 # 6 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 12 tableaux to operate on % 0.21/0.44 # There were 2 total branch saturation attempts. % 0.21/0.44 # There were 0 of these attempts blocked. % 0.21/0.44 # There were 0 deferred branch saturation attempts. % 0.21/0.44 # There were 0 free duplicated saturations. % 0.21/0.44 # There were 2 total successful branch saturations. % 0.21/0.44 # There were 0 successful branch saturations in interreduction. % 0.21/0.44 # There were 0 successful branch saturations on the branch. % 0.21/0.44 # There were 2 successful branch saturations after the branch. % 0.21/0.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.44 # Begin clausification derivation % 0.21/0.44 % 0.21/0.44 # End clausification derivation % 0.21/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.44 cnf(i_0_7, plain, (less_than(n1,n2))). % 0.21/0.44 cnf(i_0_6, plain, (less_than(n2,n3))). % 0.21/0.44 cnf(i_0_5, plain, (less_than(n3,n4))). % 0.21/0.44 cnf(i_0_4, plain, (less_than(n4,n5))). % 0.21/0.44 cnf(i_0_3, plain, (less_than(n5,n6))). % 0.21/0.44 cnf(i_0_10, negated_conjecture, (~goal)). % 0.21/0.44 cnf(i_0_9, plain, (green(X1,X2)|red(X1,X2)|~less_than(X1,X2))). % 0.21/0.44 cnf(i_0_1, plain, (~red(X1,X2)|~red(X3,X2)|~red(X3,X1))). % 0.21/0.44 cnf(i_0_2, plain, (~green(X1,X2)|~green(X3,X2)|~green(X3,X1))). % 0.21/0.44 cnf(i_0_8, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))). % 0.21/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.44 # Begin printing tableau % 0.21/0.44 # Found 6 steps % 0.21/0.44 cnf(i_0_7, plain, (less_than(n1,n2)), inference(start_rule)). % 0.21/0.44 cnf(i_0_24, plain, (less_than(n1,n2)), inference(extension_rule, [i_0_9])). % 0.21/0.44 cnf(i_0_42, plain, (green(n1,n2)), inference(extension_rule, [i_0_2])). % 0.21/0.44 cnf(i_0_61, plain, (~green(n1,n2)), inference(closure_rule, [i_0_42])). % 0.21/0.44 cnf(i_0_43, plain, (red(n1,n2)), inference(etableau_closure_rule, [i_0_43, ...])). % 0.21/0.44 cnf(i_0_62, plain, (~green(n1,n1)), inference(etableau_closure_rule, [i_0_62, ...])). % 0.21/0.44 # End printing tableau % 0.21/0.44 # SZS output end % 0.21/0.44 # Branches closed with saturation will be marked with an "s" % 0.21/0.44 # There were 2 total branch saturation attempts. % 0.21/0.44 # There were 0 of these attempts blocked. % 0.21/0.44 # There were 0 deferred branch saturation attempts. % 0.21/0.44 # There were 0 free duplicated saturations. % 0.21/0.44 # There were 2 total successful branch saturations. % 0.21/0.44 # There were 0 successful branch saturations in interreduction. % 0.21/0.44 # There were 0 successful branch saturations on the branch. % 0.21/0.44 # There were 2 successful branch saturations after the branch. % 0.21/0.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.44 # Begin clausification derivation % 0.21/0.44 % 0.21/0.44 # End clausification derivation % 0.21/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.44 cnf(i_0_7, plain, (less_than(n1,n2))). % 0.21/0.44 cnf(i_0_6, plain, (less_than(n2,n3))). % 0.21/0.44 cnf(i_0_5, plain, (less_than(n3,n4))). % 0.21/0.44 cnf(i_0_4, plain, (less_than(n4,n5))). % 0.21/0.44 cnf(i_0_3, plain, (less_than(n5,n6))). % 0.21/0.44 cnf(i_0_10, negated_conjecture, (~goal)). % 0.21/0.44 cnf(i_0_9, plain, (green(X1,X2)|red(X1,X2)|~less_than(X1,X2))). % 0.21/0.44 cnf(i_0_1, plain, (~red(X1,X2)|~red(X3,X2)|~red(X3,X1))). % 0.21/0.44 cnf(i_0_2, plain, (~green(X1,X2)|~green(X3,X2)|~green(X3,X1))). % 0.21/0.44 cnf(i_0_8, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))). % 0.21/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.44 # Begin printing tableau % 0.21/0.44 # Found 6 steps % 0.21/0.44 cnf(i_0_6, plain, (less_than(n2,n3)), inference(start_rule)). % 0.21/0.44 cnf(i_0_25, plain, (less_than(n2,n3)), inference(extension_rule, [i_0_9])). % 0.21/0.44 cnf(i_0_54, plain, (green(n2,n3)), inference(extension_rule, [i_0_2])). % 0.21/0.44 cnf(i_0_61, plain, (~green(n2,n3)), inference(closure_rule, [i_0_54])). % 0.21/0.44 cnf(i_0_55, plain, (red(n2,n3)), inference(etableau_closure_rule, [i_0_55, ...])). % 0.21/0.44 cnf(i_0_62, plain, (~green(n2,n2)), inference(etableau_closure_rule, [i_0_62, ...])). % 0.21/0.44 # End printing tableau % 0.21/0.44 # SZS output end % 0.21/0.44 # Branches closed with saturation will be marked with an "s" % 0.21/0.44 # Child (20540) has found a proof. % 0.21/0.44 % 0.21/0.44 # Proof search is over... % 0.21/0.44 # Freeing feature tree %------------------------------------------------------------------------------