TSTP Solution File: KLE035+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE035+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 : n026.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 : Sun Jul 17 01:56:44 EDT 2022
% Result : Theorem 15.27s 2.32s
% Output : CNFRefutation 15.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE035+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % 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 : n026.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 : Thu Jun 16 12:39:38 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___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.13/0.37 # and selection function SelectNewComplexAHPNS.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 27 Number of unprocessed: 27
% 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 # 27 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 5 conjectures.
% 0.13/0.37 # There are 5 start rule candidates:
% 0.13/0.37 # Found 16 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 5 start rule tableaux created.
% 0.13/0.37 # 11 extension rule candidate clauses
% 0.13/0.37 # 16 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 5
% 0.13/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 9 tableaux to operate on
% 14.18/2.15 # Creating equality axioms
% 14.18/2.15 # Ran out of tableaux, making start rules for all clauses
% 14.18/2.20 # Creating equality axioms
% 14.18/2.20 # Ran out of tableaux, making start rules for all clauses
% 15.27/2.32 # There were 1 total branch saturation attempts.
% 15.27/2.32 # There were 0 of these attempts blocked.
% 15.27/2.32 # There were 0 deferred branch saturation attempts.
% 15.27/2.32 # There were 0 free duplicated saturations.
% 15.27/2.32 # There were 1 total successful branch saturations.
% 15.27/2.32 # There were 0 successful branch saturations in interreduction.
% 15.27/2.32 # There were 0 successful branch saturations on the branch.
% 15.27/2.32 # There were 1 successful branch saturations after the branch.
% 15.27/2.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.27/2.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.27/2.32 # Begin clausification derivation
% 15.27/2.32
% 15.27/2.32 # End clausification derivation
% 15.27/2.32 # Begin listing active clauses obtained from FOF to CNF conversion
% 15.27/2.32 cnf(i_0_26, negated_conjecture, (test(esk4_0))).
% 15.27/2.32 cnf(i_0_27, negated_conjecture, (test(esk5_0))).
% 15.27/2.32 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 15.27/2.32 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 15.27/2.32 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 15.27/2.32 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 15.27/2.32 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 15.27/2.32 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 15.27/2.32 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 15.27/2.32 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 15.27/2.32 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 15.27/2.32 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 15.27/2.32 cnf(i_0_25, negated_conjecture, (leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero))).
% 15.27/2.32 cnf(i_0_24, negated_conjecture, (leq(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero))).
% 15.27/2.32 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 15.27/2.32 cnf(i_0_23, negated_conjecture, (~leq(multiplication(esk4_0,multiplication(addition(esk2_0,esk3_0),c(esk5_0))),zero))).
% 15.27/2.32 cnf(i_0_22, plain, (c(X1)=zero|test(X1))).
% 15.27/2.32 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 15.27/2.32 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 15.27/2.32 cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
% 15.27/2.32 cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))).
% 15.27/2.32 cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))).
% 15.27/2.32 cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
% 15.27/2.32 cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))).
% 15.27/2.32 cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
% 15.27/2.32 cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)).
% 15.27/2.32 cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))).
% 15.27/2.32 cnf(i_0_184, plain, (X43=X43)).
% 15.27/2.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 15.27/2.32 # Begin printing tableau
% 15.27/2.32 # Found 6 steps
% 15.27/2.32 cnf(i_0_184, plain, (X5=X5), inference(start_rule)).
% 15.27/2.32 cnf(i_0_235, plain, (X5=X5), inference(extension_rule, [i_0_188])).
% 15.27/2.32 cnf(i_0_270, plain, (multiplication(X5,zero)!=zero), inference(closure_rule, [i_0_10])).
% 15.27/2.32 cnf(i_0_268, plain, (addition(X5,multiplication(X5,zero))=addition(X5,zero)), inference(extension_rule, [i_0_187])).
% 15.27/2.32 cnf(i_0_302, plain, (addition(X5,zero)!=X5), inference(closure_rule, [i_0_3])).
% 15.27/2.32 cnf(i_0_300, plain, (addition(X5,multiplication(X5,zero))=X5), inference(etableau_closure_rule, [i_0_300, ...])).
% 15.27/2.32 # End printing tableau
% 15.27/2.32 # SZS output end
% 15.27/2.32 # Branches closed with saturation will be marked with an "s"
% 15.27/2.33 # Child (4587) has found a proof.
% 15.27/2.33
% 15.27/2.33 # Proof search is over...
% 15.27/2.33 # Freeing feature tree
%------------------------------------------------------------------------------