TSTP Solution File: SWV488+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV488+2 : 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 : n027.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 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 15:28:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 25 Number of unprocessed: 24
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 24 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 4 conjectures.
% 0.19/0.37 # There are 4 start rule candidates:
% 0.19/0.37 # Found 10 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 4 start rule tableaux created.
% 0.19/0.37 # 14 extension rule candidate clauses
% 0.19/0.37 # 10 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.19/0.37 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 20 tableaux to operate on
% 0.19/0.37 # Creating equality axioms
% 0.19/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_19, negated_conjecture, (esk3_0=esk2_0)).
% 0.19/0.38 cnf(i_0_18, negated_conjecture, (a(esk2_0,esk2_0)=real_zero)).
% 0.19/0.38 cnf(i_0_22, negated_conjecture, (int_leq(int_one,esk2_0))).
% 0.19/0.38 cnf(i_0_20, negated_conjecture, (int_leq(esk2_0,n))).
% 0.19/0.38 cnf(i_0_7, plain, (int_less(int_zero,int_one))).
% 0.19/0.38 cnf(i_0_1, plain, (int_leq(X1,X1))).
% 0.19/0.38 cnf(i_0_9, plain, (plus(X1,int_zero)=X1)).
% 0.19/0.38 cnf(i_0_8, plain, (plus(X1,X2)=plus(X2,X1))).
% 0.19/0.38 cnf(i_0_16, plain, (real_one!=real_zero)).
% 0.19/0.38 cnf(i_0_5, plain, (~int_less(X1,X1))).
% 0.19/0.38 cnf(i_0_2, plain, (int_leq(X1,X2)|~int_less(X1,X2))).
% 0.19/0.38 cnf(i_0_15, plain, (int_leq(int_one,X1)|~int_less(int_zero,X1))).
% 0.19/0.38 cnf(i_0_14, plain, (int_less(int_zero,X1)|~int_leq(int_one,X1))).
% 0.19/0.38 cnf(i_0_6, plain, (int_less(X1,X2)|int_leq(X2,X1))).
% 0.19/0.38 cnf(i_0_3, plain, (X1=X2|int_less(X1,X2)|~int_leq(X1,X2))).
% 0.19/0.38 cnf(i_0_4, plain, (int_less(X1,X2)|~int_less(X3,X2)|~int_less(X1,X3))).
% 0.19/0.38 cnf(i_0_11, plain, (int_less(X1,plus(X1,X2))|~int_less(int_zero,X2))).
% 0.19/0.38 cnf(i_0_12, plain, (int_less(int_zero,esk1_2(X1,X2))|~int_less(X1,X2))).
% 0.19/0.38 cnf(i_0_13, plain, (plus(X1,esk1_2(X1,X2))=X2|~int_less(X1,X2))).
% 0.19/0.38 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))).
% 0.19/0.38 cnf(i_0_24, plain, (a(X1,X1)=real_one|~epred1_2(X2,X3)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 0.19/0.38 cnf(i_0_10, plain, (int_leq(plus(X1,X2),plus(X3,X4))|~int_less(X1,X3)|~int_leq(X2,X4))).
% 0.19/0.38 cnf(i_0_23, plain, (a(X1,plus(X1,X2))=real_zero|~epred1_2(X3,plus(X3,X2))|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 0.19/0.38 cnf(i_0_25, plain, (lu(plus(X1,X2),X1)=a(plus(X1,X2),X1)|~epred1_2(plus(X3,X2),X3)|~int_less(int_zero,X2)|~int_leq(int_one,X1)|~int_leq(X1,X3))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 4 steps
% 0.19/0.38 cnf(i_0_22, negated_conjecture, (int_leq(int_one,esk2_0)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_32, plain, (int_leq(int_one,esk2_0)), inference(extension_rule, [i_0_14])).
% 0.19/0.38 cnf(i_0_81, plain, (int_less(int_zero,esk2_0)), inference(extension_rule, [i_0_2])).
% 0.19/0.38 cnf(i_0_161, plain, (int_leq(int_zero,esk2_0)), inference(etableau_closure_rule, [i_0_161, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (5598) has found a proof.
% 0.19/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------