TSTP Solution File: KLE043+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE043+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 : n011.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:48 EDT 2022
% Result : Theorem 1.41s 1.60s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE043+2 : 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.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 15:33:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 18 Number of unprocessed: 18
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.69/0.87 # The folding up rule is enabled...
% 0.69/0.87 # Local unification is enabled...
% 0.69/0.87 # Any saturation attempts will use folding labels...
% 0.69/0.87 # 18 beginning clauses after preprocessing and clausification
% 0.69/0.87 # Creating start rules for all 1 conjectures.
% 0.69/0.87 # There are 1 start rule candidates:
% 0.69/0.87 # Found 13 unit axioms.
% 0.69/0.87 # 1 start rule tableaux created.
% 0.69/0.87 # 5 extension rule candidate clauses
% 0.69/0.87 # 13 unit axiom clauses
% 0.69/0.87
% 0.69/0.87 # Requested 8, 32 cores available to the main process.
% 0.69/0.87 # There are not enough tableaux to fork, creating more from the initial 1
% 1.41/1.60 # There were 2 total branch saturation attempts.
% 1.41/1.60 # There were 0 of these attempts blocked.
% 1.41/1.60 # There were 0 deferred branch saturation attempts.
% 1.41/1.60 # There were 0 free duplicated saturations.
% 1.41/1.60 # There were 2 total successful branch saturations.
% 1.41/1.60 # There were 0 successful branch saturations in interreduction.
% 1.41/1.60 # There were 0 successful branch saturations on the branch.
% 1.41/1.60 # There were 2 successful branch saturations after the branch.
% 1.41/1.60 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.41/1.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.41/1.60 # Begin clausification derivation
% 1.41/1.60
% 1.41/1.60 # End clausification derivation
% 1.41/1.60 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.41/1.60 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 1.41/1.60 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 1.41/1.60 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 1.41/1.60 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 1.41/1.60 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 1.41/1.60 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 1.41/1.60 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 1.41/1.60 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))).
% 1.41/1.60 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))).
% 1.41/1.60 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 1.41/1.60 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 1.41/1.60 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 1.41/1.60 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 1.41/1.60 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 1.41/1.60 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 1.41/1.60 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))).
% 1.41/1.60 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))).
% 1.41/1.60 cnf(i_0_18, negated_conjecture, (~leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))|~leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0)))).
% 1.41/1.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.41/1.60 # Begin printing tableau
% 1.41/1.60 # Found 5 steps
% 1.41/1.60 cnf(i_0_18, negated_conjecture, (~leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))|~leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0))), inference(start_rule)).
% 1.41/1.60 cnf(i_0_19, plain, (~leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))), inference(extension_rule, [i_0_16])).
% 1.41/1.60 cnf(i_0_28, plain, (~leq(addition(multiplication(esk1_0,addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))), inference(extension_rule, [i_0_12])).
% 1.41/1.60 cnf(i_0_20, plain, (~leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0))), inference(etableau_closure_rule, [i_0_20, ...])).
% 1.41/1.60 cnf(i_0_64, plain, (addition(addition(multiplication(esk1_0,addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))!=addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))), inference(etableau_closure_rule, [i_0_64, ...])).
% 1.41/1.60 # End printing tableau
% 1.41/1.60 # SZS output end
% 1.41/1.60 # Branches closed with saturation will be marked with an "s"
% 1.41/1.60 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 1.41/1.60 # We now have 3 tableaux to operate on
% 1.41/1.60 # Found closed tableau during pool population.
% 1.41/1.60 # Proof search is over...
% 1.41/1.60 # Freeing feature tree
%------------------------------------------------------------------------------