TSTP Solution File: SWV487+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV487+1 : TPTP v8.1.0. Released v4.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 : n032.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 : Wed Jul 20 18:21:22 EDT 2022
% Result : Theorem 1.51s 0.57s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWV487+1 : TPTP v8.1.0. Released v4.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.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 15 07:03:43 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.35 # No SInE strategy applied
% 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.35 #
% 0.11/0.35 # Presaturation interreduction done
% 0.11/0.35 # Number of axioms: 23 Number of unprocessed: 23
% 0.11/0.35 # Tableaux proof search.
% 0.11/0.35 # APR header successfully linked.
% 0.11/0.35 # Hello from C++
% 0.11/0.35 # The folding up rule is enabled...
% 0.11/0.35 # Local unification is enabled...
% 0.11/0.35 # Any saturation attempts will use folding labels...
% 0.11/0.35 # 23 beginning clauses after preprocessing and clausification
% 0.11/0.35 # Creating start rules for all 4 conjectures.
% 0.11/0.35 # There are 4 start rule candidates:
% 0.11/0.35 # Found 10 unit axioms.
% 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.35 # 4 start rule tableaux created.
% 0.11/0.35 # 13 extension rule candidate clauses
% 0.11/0.35 # 10 unit axiom clauses
% 0.11/0.35
% 0.11/0.35 # Requested 8, 32 cores available to the main process.
% 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 4
% 0.11/0.35 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.35 # We now have 14 tableaux to operate on
% 1.51/0.55 # Creating equality axioms
% 1.51/0.55 # Ran out of tableaux, making start rules for all clauses
% 1.51/0.57 # There were 3 total branch saturation attempts.
% 1.51/0.57 # There were 0 of these attempts blocked.
% 1.51/0.57 # There were 0 deferred branch saturation attempts.
% 1.51/0.57 # There were 0 free duplicated saturations.
% 1.51/0.57 # There were 3 total successful branch saturations.
% 1.51/0.57 # There were 0 successful branch saturations in interreduction.
% 1.51/0.57 # There were 0 successful branch saturations on the branch.
% 1.51/0.57 # There were 3 successful branch saturations after the branch.
% 1.51/0.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/0.57 # Begin clausification derivation
% 1.51/0.57
% 1.51/0.57 # End clausification derivation
% 1.51/0.57 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.51/0.57 cnf(i_0_21, negated_conjecture, (int_leq(int_one,esk3_0))).
% 1.51/0.57 cnf(i_0_19, negated_conjecture, (int_leq(esk2_0,n))).
% 1.51/0.57 cnf(i_0_20, negated_conjecture, (int_less(esk3_0,esk2_0))).
% 1.51/0.57 cnf(i_0_7, plain, (int_less(int_zero,int_one))).
% 1.51/0.57 cnf(i_0_9, plain, (plus(X1,int_zero)=X1)).
% 1.51/0.57 cnf(i_0_1, plain, (int_leq(X1,X1))).
% 1.51/0.57 cnf(i_0_8, plain, (plus(X1,X2)=plus(X2,X1))).
% 1.51/0.57 cnf(i_0_16, plain, (real_one!=real_zero)).
% 1.51/0.57 cnf(i_0_18, negated_conjecture, (a(esk2_0,esk3_0)!=real_zero)).
% 1.51/0.57 cnf(i_0_5, plain, (~int_less(X1,X1))).
% 1.51/0.57 cnf(i_0_2, plain, (int_leq(X1,X2)|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_15, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))).
% 1.51/0.57 cnf(i_0_14, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))).
% 1.51/0.57 cnf(i_0_6, plain, (int_less(X1,X2)|int_leq(X2,X1))).
% 1.51/0.57 cnf(i_0_3, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))).
% 1.51/0.57 cnf(i_0_12, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_4, plain, (int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3))).
% 1.51/0.57 cnf(i_0_11, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))).
% 1.51/0.57 cnf(i_0_13, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_17, hypothesis, (epred1_2(X1,X2)|~int_leq(X2,n)|~int_leq(X1,n)|~int_leq(int_one,X2)|~int_leq(int_one,X1))).
% 1.51/0.57 cnf(i_0_10, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_less(X1,X3)|~int_leq(X2,X4))).
% 1.51/0.57 cnf(i_0_23, plain, (a(plus(X1,X2),X1)=real_zero|~epred1_2(plus(X3,X2),X3)|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 1.51/0.57 cnf(i_0_22, plain, (lu(X1,plus(X1,X2))=a(X1,plus(X1,X2))|~epred1_2(X3,plus(X3,X2))|~int_leq(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 1.51/0.57 cnf(i_0_185, plain, (X42=X42)).
% 1.51/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.51/0.57 # Begin printing tableau
% 1.51/0.57 # Found 9 steps
% 1.51/0.57 cnf(i_0_185, plain, (plus(n,int_zero)=plus(n,int_zero)), inference(start_rule)).
% 1.51/0.57 cnf(i_0_243, plain, (plus(n,int_zero)=plus(n,int_zero)), inference(extension_rule, [i_0_189])).
% 1.51/0.57 cnf(i_0_291, plain, (plus(n,int_zero)!=n), inference(closure_rule, [i_0_9])).
% 1.51/0.57 cnf(i_0_292, plain, (~int_leq(plus(n,int_zero),plus(n,int_zero))), inference(closure_rule, [i_0_1])).
% 1.51/0.57 cnf(i_0_289, plain, (int_leq(plus(n,int_zero),n)), inference(extension_rule, [i_0_17])).
% 1.51/0.57 cnf(i_0_315, plain, (~int_leq(esk2_0,n)), inference(closure_rule, [i_0_19])).
% 1.51/0.57 cnf(i_0_313, plain, (epred1_2(esk2_0,plus(n,int_zero))), inference(etableau_closure_rule, [i_0_313, ...])).
% 1.51/0.57 cnf(i_0_316, plain, (~int_leq(int_one,plus(n,int_zero))), inference(etableau_closure_rule, [i_0_316, ...])).
% 1.51/0.57 cnf(i_0_317, plain, (~int_leq(int_one,esk2_0)), inference(etableau_closure_rule, [i_0_317, ...])).
% 1.51/0.57 # End printing tableau
% 1.51/0.57 # SZS output end
% 1.51/0.57 # Branches closed with saturation will be marked with an "s"
% 1.51/0.57 # There were 1 total branch saturation attempts.
% 1.51/0.57 # There were 0 of these attempts blocked.
% 1.51/0.57 # There were 0 deferred branch saturation attempts.
% 1.51/0.57 # There were 0 free duplicated saturations.
% 1.51/0.57 # There were 1 total successful branch saturations.
% 1.51/0.57 # There were 0 successful branch saturations in interreduction.
% 1.51/0.57 # There were 0 successful branch saturations on the branch.
% 1.51/0.57 # There were 1 successful branch saturations after the branch.
% 1.51/0.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/0.57 # Begin clausification derivation
% 1.51/0.57
% 1.51/0.57 # End clausification derivation
% 1.51/0.57 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.51/0.57 cnf(i_0_21, negated_conjecture, (int_leq(int_one,esk3_0))).
% 1.51/0.57 cnf(i_0_19, negated_conjecture, (int_leq(esk2_0,n))).
% 1.51/0.57 cnf(i_0_20, negated_conjecture, (int_less(esk3_0,esk2_0))).
% 1.51/0.57 cnf(i_0_7, plain, (int_less(int_zero,int_one))).
% 1.51/0.57 cnf(i_0_9, plain, (plus(X1,int_zero)=X1)).
% 1.51/0.57 cnf(i_0_1, plain, (int_leq(X1,X1))).
% 1.51/0.57 cnf(i_0_8, plain, (plus(X1,X2)=plus(X2,X1))).
% 1.51/0.57 cnf(i_0_16, plain, (real_one!=real_zero)).
% 1.51/0.57 cnf(i_0_18, negated_conjecture, (a(esk2_0,esk3_0)!=real_zero)).
% 1.51/0.57 cnf(i_0_5, plain, (~int_less(X1,X1))).
% 1.51/0.57 cnf(i_0_2, plain, (int_leq(X1,X2)|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_15, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))).
% 1.51/0.57 cnf(i_0_14, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))).
% 1.51/0.57 cnf(i_0_6, plain, (int_less(X1,X2)|int_leq(X2,X1))).
% 1.51/0.57 cnf(i_0_3, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))).
% 1.51/0.57 cnf(i_0_12, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_4, plain, (int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3))).
% 1.51/0.57 cnf(i_0_11, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))).
% 1.51/0.57 cnf(i_0_13, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_17, hypothesis, (epred1_2(X1,X2)|~int_leq(X2,n)|~int_leq(X1,n)|~int_leq(int_one,X2)|~int_leq(int_one,X1))).
% 1.51/0.57 cnf(i_0_10, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_less(X1,X3)|~int_leq(X2,X4))).
% 1.51/0.57 cnf(i_0_23, plain, (a(plus(X1,X2),X1)=real_zero|~epred1_2(plus(X3,X2),X3)|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 1.51/0.57 cnf(i_0_22, plain, (lu(X1,plus(X1,X2))=a(X1,plus(X1,X2))|~epred1_2(X3,plus(X3,X2))|~int_leq(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 1.51/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.51/0.57 # Begin printing tableau
% 1.51/0.57 # Found 5 steps
% 1.51/0.57 cnf(i_0_20, negated_conjecture, (int_less(esk3_0,esk2_0)), inference(start_rule)).
% 1.51/0.57 cnf(i_0_30, plain, (int_less(esk3_0,esk2_0)), inference(extension_rule, [i_0_4])).
% 1.51/0.57 cnf(i_0_84, plain, (int_less(esk2_0,esk2_0)), inference(closure_rule, [i_0_5])).
% 1.51/0.57 cnf(i_0_86, plain, (~int_less(esk2_0,esk3_0)), inference(extension_rule, [i_0_6])).
% 1.51/0.57 cnf(i_0_192, plain, (int_leq(esk3_0,esk2_0)), inference(etableau_closure_rule, [i_0_192, ...])).
% 1.51/0.57 # End printing tableau
% 1.51/0.57 # SZS output end
% 1.51/0.57 # Branches closed with saturation will be marked with an "s"
% 1.51/0.57 # There were 2 total branch saturation attempts.
% 1.51/0.57 # There were 0 of these attempts blocked.
% 1.51/0.57 # There were 0 deferred branch saturation attempts.
% 1.51/0.57 # There were 0 free duplicated saturations.
% 1.51/0.57 # There were 2 total successful branch saturations.
% 1.51/0.57 # There were 0 successful branch saturations in interreduction.
% 1.51/0.57 # There were 0 successful branch saturations on the branch.
% 1.51/0.57 # There were 2 successful branch saturations after the branch.
% 1.51/0.57 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/0.57 # Begin clausification derivation
% 1.51/0.57
% 1.51/0.57 # End clausification derivation
% 1.51/0.57 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.51/0.57 cnf(i_0_21, negated_conjecture, (int_leq(int_one,esk3_0))).
% 1.51/0.57 cnf(i_0_19, negated_conjecture, (int_leq(esk2_0,n))).
% 1.51/0.57 cnf(i_0_20, negated_conjecture, (int_less(esk3_0,esk2_0))).
% 1.51/0.57 cnf(i_0_7, plain, (int_less(int_zero,int_one))).
% 1.51/0.57 cnf(i_0_9, plain, (plus(X1,int_zero)=X1)).
% 1.51/0.57 cnf(i_0_1, plain, (int_leq(X1,X1))).
% 1.51/0.57 cnf(i_0_8, plain, (plus(X1,X2)=plus(X2,X1))).
% 1.51/0.57 cnf(i_0_16, plain, (real_one!=real_zero)).
% 1.51/0.57 cnf(i_0_18, negated_conjecture, (a(esk2_0,esk3_0)!=real_zero)).
% 1.51/0.57 cnf(i_0_5, plain, (~int_less(X1,X1))).
% 1.51/0.57 cnf(i_0_2, plain, (int_leq(X1,X2)|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_15, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))).
% 1.51/0.57 cnf(i_0_14, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))).
% 1.51/0.57 cnf(i_0_6, plain, (int_less(X1,X2)|int_leq(X2,X1))).
% 1.51/0.57 cnf(i_0_3, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))).
% 1.51/0.57 cnf(i_0_12, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_4, plain, (int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3))).
% 1.51/0.57 cnf(i_0_11, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))).
% 1.51/0.57 cnf(i_0_13, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))).
% 1.51/0.57 cnf(i_0_17, hypothesis, (epred1_2(X1,X2)|~int_leq(X2,n)|~int_leq(X1,n)|~int_leq(int_one,X2)|~int_leq(int_one,X1))).
% 1.51/0.57 cnf(i_0_10, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_less(X1,X3)|~int_leq(X2,X4))).
% 1.51/0.57 cnf(i_0_23, plain, (a(plus(X1,X2),X1)=real_zero|~epred1_2(plus(X3,X2),X3)|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 1.51/0.57 cnf(i_0_22, plain, (lu(X1,plus(X1,X2))=a(X1,plus(X1,X2))|~epred1_2(X3,plus(X3,X2))|~int_leq(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 1.51/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.51/0.57 # Begin printing tableau
% 1.51/0.57 # Found 6 steps
% 1.51/0.57 cnf(i_0_19, negated_conjecture, (int_leq(esk2_0,n)), inference(start_rule)).
% 1.51/0.57 cnf(i_0_31, plain, (int_leq(esk2_0,n)), inference(extension_rule, [i_0_10])).
% 1.51/0.57 cnf(i_0_135, plain, (~int_less(int_zero,int_one)), inference(closure_rule, [i_0_7])).
% 1.51/0.57 cnf(i_0_134, plain, (int_leq(plus(int_zero,esk2_0),plus(int_one,n))), inference(extension_rule, [i_0_3])).
% 1.51/0.57 cnf(i_0_155, plain, (plus(int_zero,esk2_0)=plus(int_one,n)), inference(etableau_closure_rule, [i_0_155, ...])).
% 1.51/0.57 cnf(i_0_156, plain, (int_less(plus(int_zero,esk2_0),plus(int_one,n))), inference(etableau_closure_rule, [i_0_156, ...])).
% 1.51/0.57 # End printing tableau
% 1.51/0.57 # SZS output end
% 1.51/0.57 # Branches closed with saturation will be marked with an "s"
% 1.51/0.57 # Child (32145) has found a proof.
% 1.51/0.57
% 1.51/0.57 # Proof search is over...
% 1.51/0.57 # Freeing feature tree
%------------------------------------------------------------------------------