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