%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA002-3 : TPTP v8.1.0. Released v1.1.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 : n022.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 14 18:54:29 EDT 2022 % Result : Unsatisfiable 181.61s 29.00s % Output : CNFRefutation 181.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ANA002-3 : TPTP v8.1.0. Released v1.1.0. % 0.03/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 : n022.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 : Fri Jul 8 06:41:11 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 17 Number of unprocessed: 17 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 3.02/3.21 # The folding up rule is enabled... % 3.02/3.21 # Local unification is enabled... % 3.02/3.21 # Any saturation attempts will use folding labels... % 3.02/3.21 # 17 beginning clauses after preprocessing and clausification % 3.02/3.21 # Creating start rules for all 1 conjectures. % 3.02/3.21 # There are 1 start rule candidates: % 3.02/3.21 # Found 4 unit axioms. % 3.02/3.21 # 1 start rule tableaux created. % 3.02/3.21 # 13 extension rule candidate clauses % 3.02/3.21 # 4 unit axiom clauses % 3.02/3.21 % 3.02/3.21 # Requested 8, 32 cores available to the main process. % 3.02/3.21 # There are not enough tableaux to fork, creating more from the initial 1 % 6.70/6.96 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 6.70/6.96 # We now have 10 tableaux to operate on % 181.61/29.00 # There were 10 total branch saturation attempts. % 181.61/29.00 # There were 2 of these attempts blocked. % 181.61/29.00 # There were 0 deferred branch saturation attempts. % 181.61/29.00 # There were 0 free duplicated saturations. % 181.61/29.00 # There were 1 total successful branch saturations. % 181.61/29.00 # There were 0 successful branch saturations in interreduction. % 181.61/29.00 # There were 0 successful branch saturations on the branch. % 181.61/29.00 # There were 1 successful branch saturations after the branch. % 181.61/29.00 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 181.61/29.00 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 181.61/29.00 # Begin clausification derivation % 181.61/29.00 % 181.61/29.00 # End clausification derivation % 181.61/29.00 # Begin listing active clauses obtained from FOF to CNF conversion % 181.61/29.00 cnf(i_0_31, hypothesis, (less_than_or_equal(lower_bound,upper_bound))). % 181.61/29.00 cnf(i_0_33, hypothesis, (less_than_or_equal(n0,f(upper_bound)))). % 181.61/29.00 cnf(i_0_32, hypothesis, (less_than_or_equal(f(lower_bound),n0))). % 181.61/29.00 cnf(i_0_18, plain, (less_than_or_equal(X1,X1))). % 181.61/29.00 cnf(i_0_34, negated_conjecture, (~less_than_or_equal(n0,f(X1))|~less_than_or_equal(f(X1),n0))). % 181.61/29.00 cnf(i_0_19, plain, (less_than_or_equal(X1,X2)|less_than_or_equal(X2,X1))). % 181.61/29.00 cnf(i_0_28, plain, (less_than_or_equal(g(X1),upper_bound)|less_than_or_equal(l,X1))). % 181.61/29.00 cnf(i_0_30, plain, (less_than_or_equal(l,X1)|~less_than_or_equal(g(X1),X1))). % 181.61/29.00 cnf(i_0_21, plain, (less_than_or_equal(X1,X2)|~less_than_or_equal(X1,q(X2,X1)))). % 181.61/29.00 cnf(i_0_22, plain, (less_than_or_equal(X1,X2)|~less_than_or_equal(q(X2,X1),X2))). % 181.61/29.00 cnf(i_0_27, plain, (less_than_or_equal(X1,l)|~less_than_or_equal(f(X1),n0)|~less_than_or_equal(X1,upper_bound))). % 181.61/29.00 cnf(i_0_29, plain, (less_than_or_equal(f(g(X1)),n0)|less_than_or_equal(l,X1))). % 181.61/29.00 cnf(i_0_25, plain, (less_than_or_equal(n0,f(X1))|~less_than_or_equal(k(X1),X1)|~less_than_or_equal(X1,upper_bound)|~less_than_or_equal(lower_bound,X1))). % 181.61/29.00 cnf(i_0_23, plain, (less_than_or_equal(f(X1),n0)|~less_than_or_equal(X1,h(X1))|~less_than_or_equal(X1,upper_bound)|~less_than_or_equal(lower_bound,X1))). % 181.61/29.00 cnf(i_0_20, plain, (less_than_or_equal(X1,X2)|~less_than_or_equal(X3,X2)|~less_than_or_equal(X1,X3))). % 181.61/29.00 cnf(i_0_24, plain, (less_than_or_equal(f(X1),n0)|less_than_or_equal(X2,h(X1))|~less_than_or_equal(f(X2),n0)|~less_than_or_equal(X1,upper_bound)|~less_than_or_equal(lower_bound,X1)|~less_than_or_equal(X2,X1))). % 181.61/29.00 cnf(i_0_26, plain, (less_than_or_equal(n0,f(X1))|less_than_or_equal(k(X1),X2)|~less_than_or_equal(n0,f(X2))|~less_than_or_equal(X1,upper_bound)|~less_than_or_equal(lower_bound,X1)|~less_than_or_equal(X1,X2))). % 181.61/29.00 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 181.61/29.00 # Begin printing tableau % 181.61/29.00 # Found 7 steps % 181.61/29.00 cnf(i_0_34, negated_conjecture, (~less_than_or_equal(n0,f(upper_bound))|~less_than_or_equal(f(upper_bound),n0)), inference(start_rule)). % 181.61/29.00 cnf(i_0_35, plain, (~less_than_or_equal(n0,f(upper_bound))), inference(closure_rule, [i_0_33])). % 181.61/29.00 cnf(i_0_36, plain, (~less_than_or_equal(f(upper_bound),n0)), inference(extension_rule, [i_0_20])). % 181.61/29.00 cnf(i_0_61, plain, (~less_than_or_equal(f(lower_bound),n0)), inference(closure_rule, [i_0_32])). % 181.61/29.00 cnf(i_0_62, plain, (~less_than_or_equal(f(upper_bound),f(lower_bound))), inference(extension_rule, [i_0_21])). % 181.61/29.00 cnf(i_0_2027947, plain, (~less_than_or_equal(f(upper_bound),q(f(lower_bound),f(upper_bound)))), inference(extension_rule, [i_0_19])). % 181.61/29.00 cnf(i_0_2817339, plain, (less_than_or_equal(q(f(lower_bound),f(upper_bound)),f(upper_bound))), inference(etableau_closure_rule, [i_0_2817339, ...])). % 181.61/29.00 # End printing tableau % 181.61/29.00 # SZS output end % 181.61/29.00 # Branches closed with saturation will be marked with an "s" % 181.97/29.04 # Child (25213) has found a proof. % 181.97/29.04 % 181.97/29.04 # Proof search is over... % 181.97/29.04 # Freeing feature tree %------------------------------------------------------------------------------