%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA004-4 : 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 : n016.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:32 EDT 2022 % Result : Unsatisfiable 200.86s 201.21s % Output : CNFRefutation 200.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ANA004-4 : TPTP v8.1.0. Released v1.0.0. % 0.07/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 : n016.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 07:19:53 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_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 13 Number of unprocessed: 13 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 184.86/185.16 # The folding up rule is enabled... % 184.86/185.16 # Local unification is enabled... % 184.86/185.16 # Any saturation attempts will use folding labels... % 184.86/185.16 # 13 beginning clauses after preprocessing and clausification % 184.86/185.16 # Creating start rules for all 1 conjectures. % 184.86/185.16 # There are 1 start rule candidates: % 184.86/185.16 # Found 1 unit axioms. % 184.86/185.16 # 1 start rule tableaux created. % 184.86/185.16 # 12 extension rule candidate clauses % 184.86/185.16 # 1 unit axiom clauses % 184.86/185.16 % 184.86/185.16 # Requested 8, 32 cores available to the main process. % 184.86/185.16 # There are not enough tableaux to fork, creating more from the initial 1 % 200.86/201.21 # There were 1 total branch saturation attempts. % 200.86/201.21 # There were 0 of these attempts blocked. % 200.86/201.21 # There were 0 deferred branch saturation attempts. % 200.86/201.21 # There were 0 free duplicated saturations. % 200.86/201.21 # There were 1 total successful branch saturations. % 200.86/201.21 # There were 0 successful branch saturations in interreduction. % 200.86/201.21 # There were 0 successful branch saturations on the branch. % 200.86/201.21 # There were 1 successful branch saturations after the branch. % 200.86/201.21 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 200.86/201.21 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 200.86/201.21 # Begin clausification derivation % 200.86/201.21 % 200.86/201.21 # End clausification derivation % 200.86/201.21 # Begin listing active clauses obtained from FOF to CNF conversion % 200.86/201.21 cnf(i_0_24, hypothesis, (~less_or_equal(epsilon_0,n0))). % 200.86/201.21 cnf(i_0_19, plain, (less_or_equal(X1,n0)|~less_or_equal(half(X1),n0))). % 200.86/201.21 cnf(i_0_20, hypothesis, (less_or_equal(X1,n0)|~less_or_equal(delta_1(X1),n0))). % 200.86/201.21 cnf(i_0_21, hypothesis, (less_or_equal(X1,n0)|~less_or_equal(delta_2(X1),n0))). % 200.86/201.21 cnf(i_0_26, negated_conjecture, (less_or_equal(X1,n0)|~less_or_equal(absolute(add(add(f(xs(X1)),negate(f(a_real_number))),add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0))). % 200.86/201.21 cnf(i_0_16, plain, (less_or_equal(X1,X2)|~less_or_equal(X1,minimum(X3,X2)))). % 200.86/201.21 cnf(i_0_15, plain, (less_or_equal(X1,X2)|~less_or_equal(X1,minimum(X2,X3)))). % 200.86/201.21 cnf(i_0_17, plain, (less_or_equal(X1,n0)|less_or_equal(X2,n0)|~less_or_equal(minimum(X1,X2),n0))). % 200.86/201.21 cnf(i_0_14, plain, (less_or_equal(absolute(add(X1,X2)),X3)|~less_or_equal(add(absolute(X1),absolute(X2)),X3))). % 200.86/201.21 cnf(i_0_18, plain, (less_or_equal(add(X1,X2),X3)|~less_or_equal(X2,half(X3))|~less_or_equal(X1,half(X3)))). % 200.86/201.21 cnf(i_0_25, hypothesis, (less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1)|less_or_equal(X1,n0))). % 200.86/201.21 cnf(i_0_22, hypothesis, (less_or_equal(absolute(add(f(X1),negate(f(a_real_number)))),X2)|less_or_equal(X2,n0)|~less_or_equal(absolute(add(X1,negate(a_real_number))),delta_1(X2)))). % 200.86/201.21 cnf(i_0_23, hypothesis, (less_or_equal(absolute(add(g(X1),negate(g(a_real_number)))),X2)|less_or_equal(X2,n0)|~less_or_equal(absolute(add(X1,negate(a_real_number))),delta_2(X2)))). % 200.86/201.21 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 200.86/201.21 # Begin printing tableau % 200.86/201.21 # Found 5 steps % 200.86/201.21 cnf(i_0_26, negated_conjecture, (less_or_equal(epsilon_0,n0)|~less_or_equal(absolute(add(add(f(xs(epsilon_0)),negate(f(a_real_number))),add(g(xs(epsilon_0)),negate(g(a_real_number))))),epsilon_0)), inference(start_rule)). % 200.86/201.21 cnf(i_0_27, plain, (less_or_equal(epsilon_0,n0)), inference(closure_rule, [i_0_24])). % 200.86/201.21 cnf(i_0_28, plain, (~less_or_equal(absolute(add(add(f(xs(epsilon_0)),negate(f(a_real_number))),add(g(xs(epsilon_0)),negate(g(a_real_number))))),epsilon_0)), inference(extension_rule, [i_0_14])). % 200.86/201.21 cnf(i_0_43, plain, (~less_or_equal(add(absolute(add(f(xs(epsilon_0)),negate(f(a_real_number)))),absolute(add(g(xs(epsilon_0)),negate(g(a_real_number))))),epsilon_0)), inference(extension_rule, [i_0_16])). % 200.86/201.21 cnf(i_0_64, plain, (~less_or_equal(add(absolute(add(f(xs(epsilon_0)),negate(f(a_real_number)))),absolute(add(g(xs(epsilon_0)),negate(g(a_real_number))))),minimum(X6,epsilon_0))), inference(etableau_closure_rule, [i_0_64, ...])). % 200.86/201.21 # End printing tableau % 200.86/201.21 # SZS output end % 200.86/201.21 # Branches closed with saturation will be marked with an "s" % 200.86/201.21 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 200.86/201.21 # We now have 3 tableaux to operate on % 200.86/201.21 # Found closed tableau during pool population. % 200.86/201.21 # Proof search is over... % 200.86/201.21 # Freeing feature tree %------------------------------------------------------------------------------