TSTP Solution File: ANA003-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA003-2 : 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 : n014.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 26.39s 3.68s
% Output : CNFRefutation 26.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA003-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % 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 : n014.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:34:21 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: 17 Number of unprocessed: 17
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 17 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 7 conjectures.
% 0.13/0.37 # There are 7 start rule candidates:
% 0.13/0.37 # Found 4 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 7 start rule tableaux created.
% 0.13/0.37 # 13 extension rule candidate clauses
% 0.13/0.37 # 4 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 7
% 0.13/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 12 tableaux to operate on
% 26.39/3.68 # There were 2 total branch saturation attempts.
% 26.39/3.68 # There were 0 of these attempts blocked.
% 26.39/3.68 # There were 0 deferred branch saturation attempts.
% 26.39/3.68 # There were 0 free duplicated saturations.
% 26.39/3.68 # There were 2 total successful branch saturations.
% 26.39/3.68 # There were 0 successful branch saturations in interreduction.
% 26.39/3.68 # There were 0 successful branch saturations on the branch.
% 26.39/3.68 # There were 2 successful branch saturations after the branch.
% 26.39/3.68 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.39/3.68 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.39/3.68 # Begin clausification derivation
% 26.39/3.68
% 26.39/3.68 # End clausification derivation
% 26.39/3.68 # Begin listing active clauses obtained from FOF to CNF conversion
% 26.39/3.68 cnf(i_0_32, negated_conjecture, (less_than(n0,b))).
% 26.39/3.68 cnf(i_0_18, plain, (equalish(add(X1,n0),X1))).
% 26.39/3.68 cnf(i_0_19, plain, (equalish(add(n0,X1),X1))).
% 26.39/3.68 cnf(i_0_20, plain, (~less_than(X1,X1))).
% 26.39/3.68 cnf(i_0_28, negated_conjecture, (less_than(n0,fp31(X1))|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_30, negated_conjecture, (less_than(n0,fp32(X1))|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_27, plain, (less_than(n0,half(X1))|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_21, plain, (less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3))).
% 26.39/3.68 cnf(i_0_24, plain, (less_than(minimum(X1,X2),X2)|~less_than(n0,X2)|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_23, plain, (less_than(minimum(X1,X2),X1)|~less_than(n0,X2)|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_22, plain, (less_than(n0,minimum(X1,X2))|~less_than(n0,X2)|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_33, negated_conjecture, (less_than(absolute(add(fp33(X1),minus(a))),X1)|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_34, negated_conjecture, (~less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)|~less_than(n0,X1))).
% 26.39/3.68 cnf(i_0_29, negated_conjecture, (less_than(absolute(add(f(X1),minus(l1))),X2)|~less_than(absolute(add(X1,minus(a))),fp31(X2))|~less_than(n0,X2))).
% 26.39/3.68 cnf(i_0_31, negated_conjecture, (less_than(absolute(add(g(X1),minus(l2))),X2)|~less_than(absolute(add(X1,minus(a))),fp32(X2))|~less_than(n0,X2))).
% 26.39/3.68 cnf(i_0_26, plain, (less_than(absolute(add(X1,X2)),X3)|~less_than(add(absolute(X1),absolute(X2)),X3))).
% 26.39/3.68 cnf(i_0_25, plain, (less_than(add(X1,X2),X3)|~less_than(X2,half(X3))|~less_than(X1,half(X3)))).
% 26.39/3.68 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 26.39/3.68 # Begin printing tableau
% 26.39/3.68 # Found 9 steps
% 26.39/3.68 cnf(i_0_34, negated_conjecture, (~less_than(add(absolute(add(f(fp33(b)),minus(l1))),absolute(add(g(fp33(b)),minus(l2)))),b)|~less_than(n0,b)), inference(start_rule)).
% 26.39/3.68 cnf(i_0_42, plain, (~less_than(n0,b)), inference(closure_rule, [i_0_32])).
% 26.39/3.68 cnf(i_0_41, plain, (~less_than(add(absolute(add(f(fp33(b)),minus(l1))),absolute(add(g(fp33(b)),minus(l2)))),b)), inference(extension_rule, [i_0_21])).
% 26.39/3.68 cnf(i_0_185, plain, (~less_than(n0,b)), inference(closure_rule, [i_0_32])).
% 26.39/3.68 cnf(i_0_186, plain, (~less_than(add(absolute(add(f(fp33(b)),minus(l1))),absolute(add(g(fp33(b)),minus(l2)))),n0)), inference(extension_rule, [i_0_21])).
% 26.39/3.68 cnf(i_0_218, plain, (~less_than(minimum(b,n0),n0)), inference(extension_rule, [i_0_24])).
% 26.39/3.68 cnf(i_0_224, plain, (~less_than(n0,b)), inference(closure_rule, [i_0_32])).
% 26.39/3.68 cnf(i_0_219, plain, (~less_than(add(absolute(add(f(fp33(b)),minus(l1))),absolute(add(g(fp33(b)),minus(l2)))),minimum(b,n0))), inference(etableau_closure_rule, [i_0_219, ...])).
% 26.39/3.68 cnf(i_0_223, plain, (~less_than(n0,n0)), inference(etableau_closure_rule, [i_0_223, ...])).
% 26.39/3.68 # End printing tableau
% 26.39/3.68 # SZS output end
% 26.39/3.68 # Branches closed with saturation will be marked with an "s"
% 26.39/3.68 # Child (18906) has found a proof.
% 26.39/3.68
% 26.39/3.68 # Proof search is over...
% 26.39/3.68 # Freeing feature tree
%------------------------------------------------------------------------------