TSTP Solution File: ANA002-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA002-4 : 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 : n013.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 92.72s 12.08s
% Output : CNFRefutation 92.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ANA002-4 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.33 % Computer : n013.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 8 06:42:59 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.36 #
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.11/0.36 # Tableaux proof search.
% 0.11/0.36 # APR header successfully linked.
% 0.11/0.36 # Hello from C++
% 0.11/0.36 # The folding up rule is enabled...
% 0.11/0.36 # Local unification is enabled...
% 0.11/0.36 # Any saturation attempts will use folding labels...
% 0.11/0.36 # 17 beginning clauses after preprocessing and clausification
% 0.11/0.36 # Creating start rules for all 1 conjectures.
% 0.11/0.36 # There are 1 start rule candidates:
% 0.11/0.36 # Found 4 unit axioms.
% 0.11/0.36 # 1 start rule tableaux created.
% 0.11/0.36 # 13 extension rule candidate clauses
% 0.11/0.36 # 4 unit axiom clauses
% 0.11/0.36
% 0.11/0.36 # Requested 8, 32 cores available to the main process.
% 0.11/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.11/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.36 # We now have 10 tableaux to operate on
% 92.72/12.08 # There were 5 total branch saturation attempts.
% 92.72/12.08 # There were 0 of these attempts blocked.
% 92.72/12.08 # There were 0 deferred branch saturation attempts.
% 92.72/12.08 # There were 0 free duplicated saturations.
% 92.72/12.08 # There were 2 total successful branch saturations.
% 92.72/12.08 # There were 0 successful branch saturations in interreduction.
% 92.72/12.08 # There were 0 successful branch saturations on the branch.
% 92.72/12.08 # There were 2 successful branch saturations after the branch.
% 92.72/12.08 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 92.72/12.08 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 92.72/12.08 # Begin clausification derivation
% 92.72/12.08
% 92.72/12.08 # End clausification derivation
% 92.72/12.08 # Begin listing active clauses obtained from FOF to CNF conversion
% 92.72/12.08 cnf(i_0_31, hypothesis, (less_than_or_equal(lower_bound,upper_bound))).
% 92.72/12.08 cnf(i_0_33, hypothesis, (less_than_or_equal(n0,f(upper_bound)))).
% 92.72/12.08 cnf(i_0_32, hypothesis, (less_than_or_equal(f(lower_bound),n0))).
% 92.72/12.08 cnf(i_0_18, plain, (less_than_or_equal(X1,X1))).
% 92.72/12.08 cnf(i_0_34, negated_conjecture, (~less_than_or_equal(n0,f(l))|~less_than_or_equal(f(l),n0))).
% 92.72/12.08 cnf(i_0_19, plain, (less_than_or_equal(X1,X2)|less_than_or_equal(X2,X1))).
% 92.72/12.08 cnf(i_0_28, plain, (less_than_or_equal(g(X1),upper_bound)|less_than_or_equal(l,X1))).
% 92.72/12.08 cnf(i_0_30, plain, (less_than_or_equal(l,X1)|~less_than_or_equal(g(X1),X1))).
% 92.72/12.08 cnf(i_0_21, plain, (less_than_or_equal(X1,X2)|~less_than_or_equal(X1,q(X2,X1)))).
% 92.72/12.08 cnf(i_0_22, plain, (less_than_or_equal(X1,X2)|~less_than_or_equal(q(X2,X1),X2))).
% 92.72/12.08 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))).
% 92.72/12.08 cnf(i_0_29, plain, (less_than_or_equal(f(g(X1)),n0)|less_than_or_equal(l,X1))).
% 92.72/12.08 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))).
% 92.72/12.08 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))).
% 92.72/12.08 cnf(i_0_20, plain, (less_than_or_equal(X1,X2)|~less_than_or_equal(X3,X2)|~less_than_or_equal(X1,X3))).
% 92.72/12.08 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))).
% 92.72/12.08 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))).
% 92.72/12.08 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 92.72/12.08 # Begin printing tableau
% 92.72/12.08 # Found 10 steps
% 92.72/12.08 cnf(i_0_34, negated_conjecture, (~less_than_or_equal(n0,f(l))|~less_than_or_equal(f(l),n0)), inference(start_rule)).
% 92.72/12.08 cnf(i_0_36, plain, (~less_than_or_equal(f(l),n0)), inference(extension_rule, [i_0_22])).
% 92.72/12.08 cnf(i_0_86, plain, (~less_than_or_equal(q(n0,f(l)),n0)), inference(extension_rule, [i_0_19])).
% 92.72/12.08 cnf(i_0_118, plain, (less_than_or_equal(n0,q(n0,f(l)))), inference(extension_rule, [i_0_20])).
% 92.72/12.08 cnf(i_0_277729, plain, (~less_than_or_equal(f(lower_bound),n0)), inference(closure_rule, [i_0_32])).
% 92.72/12.08 cnf(i_0_35, plain, (~less_than_or_equal(n0,f(l))), inference(extension_rule, [i_0_21])).
% 92.72/12.08 cnf(i_0_277727, plain, (less_than_or_equal(f(lower_bound),q(n0,f(l)))), inference(etableau_closure_rule, [i_0_277727, ...])).
% 92.72/12.08 cnf(i_0_277735, plain, (~less_than_or_equal(n0,q(f(l),n0))), inference(extension_rule, [i_0_22])).
% 92.72/12.08 cnf(i_0_714536, plain, (~less_than_or_equal(q(q(f(l),n0),n0),q(f(l),n0))), inference(extension_rule, [i_0_19])).
% 92.72/12.08 cnf(i_0_937084, plain, (less_than_or_equal(q(f(l),n0),q(q(f(l),n0),n0))), inference(etableau_closure_rule, [i_0_937084, ...])).
% 92.72/12.08 # End printing tableau
% 92.72/12.08 # SZS output end
% 92.72/12.08 # Branches closed with saturation will be marked with an "s"
% 92.72/12.09 # Child (17208) has found a proof.
% 92.72/12.09
% 92.72/12.09 # Proof search is over...
% 92.72/12.09 # Freeing feature tree
%------------------------------------------------------------------------------