TSTP Solution File: KLE023+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE023+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 : n003.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:38 EDT 2022
% Result : Theorem 14.18s 13.40s
% Output : CNFRefutation 14.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : KLE023+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.17/0.38 % Computer : n003.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 600
% 0.17/0.38 % DateTime : Thu Jun 16 10:36:56 EDT 2022
% 0.17/0.38 % CPUTime :
% 0.17/0.41 # No SInE strategy applied
% 0.17/0.41 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.17/0.41 # and selection function SelectNewComplexAHPNS.
% 0.17/0.41 #
% 0.17/0.41 # Presaturation interreduction done
% 0.17/0.41 # Number of axioms: 26 Number of unprocessed: 26
% 0.17/0.41 # Tableaux proof search.
% 0.17/0.41 # APR header successfully linked.
% 0.17/0.41 # Hello from C++
% 2.77/2.97 # The folding up rule is enabled...
% 2.77/2.97 # Local unification is enabled...
% 2.77/2.97 # Any saturation attempts will use folding labels...
% 2.77/2.97 # 26 beginning clauses after preprocessing and clausification
% 2.77/2.97 # Creating start rules for all 4 conjectures.
% 2.77/2.97 # There are 4 start rule candidates:
% 2.77/2.97 # Found 15 unit axioms.
% 2.77/2.97 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 2.77/2.97 # 4 start rule tableaux created.
% 2.77/2.97 # 11 extension rule candidate clauses
% 2.77/2.97 # 15 unit axiom clauses
% 2.77/2.97
% 2.77/2.97 # Requested 8, 32 cores available to the main process.
% 2.77/2.97 # There are not enough tableaux to fork, creating more from the initial 4
% 12.95/13.15 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 12.95/13.15 # We now have 10 tableaux to operate on
% 14.18/13.40 # There were 5 total branch saturation attempts.
% 14.18/13.40 # There were 0 of these attempts blocked.
% 14.18/13.40 # There were 0 deferred branch saturation attempts.
% 14.18/13.40 # There were 0 free duplicated saturations.
% 14.18/13.40 # There were 1 total successful branch saturations.
% 14.18/13.40 # There were 0 successful branch saturations in interreduction.
% 14.18/13.40 # There were 0 successful branch saturations on the branch.
% 14.18/13.40 # There were 1 successful branch saturations after the branch.
% 14.18/13.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.18/13.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.18/13.40 # Begin clausification derivation
% 14.18/13.40
% 14.18/13.40 # End clausification derivation
% 14.18/13.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 14.18/13.40 cnf(i_0_26, negated_conjecture, (test(esk3_0))).
% 14.18/13.40 cnf(i_0_25, negated_conjecture, (test(esk4_0))).
% 14.18/13.40 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 14.18/13.40 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 14.18/13.40 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 14.18/13.40 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 14.18/13.40 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 14.18/13.40 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 14.18/13.40 cnf(i_0_24, negated_conjecture, (addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0))=multiplication(esk2_0,esk4_0))).
% 14.18/13.40 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 14.18/13.40 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 14.18/13.40 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 14.18/13.40 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 14.18/13.40 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 14.18/13.40 cnf(i_0_23, negated_conjecture, (addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))!=multiplication(c(esk3_0),esk2_0))).
% 14.18/13.40 cnf(i_0_22, plain, (c(X1)=zero|test(X1))).
% 14.18/13.40 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 14.18/13.40 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 14.18/13.40 cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))).
% 14.18/13.40 cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))).
% 14.18/13.40 cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))).
% 14.18/13.40 cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
% 14.18/13.40 cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
% 14.18/13.40 cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
% 14.18/13.40 cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)).
% 14.18/13.40 cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))).
% 14.18/13.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 14.18/13.40 # Begin printing tableau
% 14.18/13.40 # Found 5 steps
% 14.18/13.40 cnf(i_0_26, negated_conjecture, (test(esk3_0)), inference(start_rule)).
% 14.18/13.40 cnf(i_0_31, plain, (test(esk3_0)), inference(extension_rule, [i_0_21])).
% 14.18/13.40 cnf(i_0_130, plain, (complement(esk3_0,c(esk3_0))), inference(extension_rule, [i_0_14])).
% 14.18/13.40 cnf(i_0_138, plain, (test(c(esk3_0))), inference(extension_rule, [i_0_15])).
% 14.18/13.40 cnf(i_0_1063104, plain, (complement(esk1_1(c(esk3_0)),c(esk3_0))), inference(etableau_closure_rule, [i_0_1063104, ...])).
% 14.18/13.40 # End printing tableau
% 14.18/13.40 # SZS output end
% 14.18/13.40 # Branches closed with saturation will be marked with an "s"
% 14.18/13.40 # There were 5 total branch saturation attempts.
% 14.18/13.40 # There were 0 of these attempts blocked.
% 14.18/13.40 # There were 0 deferred branch saturation attempts.
% 14.18/13.40 # There were 0 free duplicated saturations.
% 14.18/13.40 # There were 1 total successful branch saturations.
% 14.18/13.40 # There were 0 successful branch saturations in interreduction.
% 14.18/13.40 # There were 0 successful branch saturations on the branch.
% 14.18/13.40 # There were 1 successful branch saturations after the branch.
% 14.18/13.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.18/13.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.18/13.40 # Begin clausification derivation
% 14.18/13.40
% 14.18/13.40 # End clausification derivation
% 14.18/13.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 14.18/13.40 cnf(i_0_26, negated_conjecture, (test(esk3_0))).
% 14.18/13.40 cnf(i_0_25, negated_conjecture, (test(esk4_0))).
% 14.18/13.40 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 14.18/13.40 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 14.18/13.40 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 14.18/13.40 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 14.18/13.40 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 14.18/13.40 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 14.18/13.40 cnf(i_0_24, negated_conjecture, (addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0))=multiplication(esk2_0,esk4_0))).
% 14.18/13.40 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 14.18/13.40 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 14.18/13.40 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 14.18/13.40 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 14.18/13.40 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 14.18/13.40 cnf(i_0_23, negated_conjecture, (addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))!=multiplication(c(esk3_0),esk2_0))).
% 14.18/13.40 cnf(i_0_22, plain, (c(X1)=zero|test(X1))).
% 14.18/13.40 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 14.18/13.40 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 14.18/13.40 cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))).
% 14.18/13.40 cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))).
% 14.18/13.40 cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))).
% 14.18/13.40 cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
% 14.18/13.40 cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
% 14.18/13.40 cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
% 14.18/13.40 cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)).
% 14.18/13.40 cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))).
% 14.18/13.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 14.18/13.40 # Begin printing tableau
% 14.18/13.40 # Found 7 steps
% 14.18/13.40 cnf(i_0_26, negated_conjecture, (test(esk3_0)), inference(start_rule)).
% 14.18/13.40 cnf(i_0_31, plain, (test(esk3_0)), inference(extension_rule, [i_0_21])).
% 14.18/13.40 cnf(i_0_130, plain, (complement(esk3_0,c(esk3_0))), inference(extension_rule, [i_0_18])).
% 14.18/13.40 cnf(i_0_796569, plain, (multiplication(esk3_0,c(esk3_0))=zero), inference(extension_rule, [i_0_16])).
% 14.18/13.40 cnf(i_0_1063114, plain, (addition(esk3_0,c(esk3_0))!=one), inference(closure_rule, [i_0_796588])).
% 14.18/13.40 cnf(i_0_1063115, plain, (multiplication(c(esk3_0),esk3_0)!=zero), inference(closure_rule, [i_0_796590])).
% 14.18/13.40 cnf(i_0_1063113, plain, (complement(c(esk3_0),esk3_0)), inference(etableau_closure_rule, [i_0_1063113, ...])).
% 14.18/13.40 # End printing tableau
% 14.18/13.40 # SZS output end
% 14.18/13.40 # Branches closed with saturation will be marked with an "s"
% 14.74/13.42 # Child (13464) has found a proof.
% 14.74/13.42
% 14.74/13.42 # Proof search is over...
% 14.74/13.42 # Freeing feature tree
%------------------------------------------------------------------------------