TSTP Solution File: KLE145-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE145-10 : TPTP v8.1.0. Released v7.3.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 : n005.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:57:17 EDT 2022
% Result : Unsatisfiable 15.77s 2.35s
% Output : CNFRefutation 15.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KLE145-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/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 : n005.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 11:09:53 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___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 23 Number of unprocessed: 23
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 23 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 23 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 23 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 45 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 45 tableaux to operate on
% 15.77/2.35 # There were 1 total branch saturation attempts.
% 15.77/2.35 # There were 0 of these attempts blocked.
% 15.77/2.35 # There were 0 deferred branch saturation attempts.
% 15.77/2.35 # There were 0 free duplicated saturations.
% 15.77/2.35 # There were 1 total successful branch saturations.
% 15.77/2.35 # There were 0 successful branch saturations in interreduction.
% 15.77/2.35 # There were 0 successful branch saturations on the branch.
% 15.77/2.35 # There were 1 successful branch saturations after the branch.
% 15.77/2.35 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.77/2.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.77/2.35 # Begin clausification derivation
% 15.77/2.35
% 15.77/2.35 # End clausification derivation
% 15.77/2.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 15.77/2.35 cnf(i_0_36, plain, (multiplication(zero,X1)=zero)).
% 15.77/2.35 cnf(i_0_29, plain, (addition(X1,zero)=X1)).
% 15.77/2.35 cnf(i_0_32, plain, (multiplication(X1,one)=X1)).
% 15.77/2.35 cnf(i_0_33, plain, (multiplication(one,X1)=X1)).
% 15.77/2.35 cnf(i_0_30, plain, (addition(X1,X1)=X1)).
% 15.77/2.35 cnf(i_0_24, plain, (ifeq3(X1,X1,X2,X3)=X2)).
% 15.77/2.35 cnf(i_0_25, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 15.77/2.35 cnf(i_0_26, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 15.77/2.35 cnf(i_0_41, plain, (addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1))).
% 15.77/2.35 cnf(i_0_37, plain, (addition(one,multiplication(X1,star(X1)))=star(X1))).
% 15.77/2.35 cnf(i_0_38, plain, (addition(one,multiplication(star(X1),X1))=star(X1))).
% 15.77/2.35 cnf(i_0_28, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 15.77/2.35 cnf(i_0_31, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 15.77/2.35 cnf(i_0_43, plain, (addition(star(X1),multiplication(strong_iteration(X1),zero))=strong_iteration(X1))).
% 15.77/2.35 cnf(i_0_34, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 15.77/2.35 cnf(i_0_45, plain, (ifeq3(addition(X1,X2),X2,leq(X1,X2),true)=true)).
% 15.77/2.35 cnf(i_0_44, plain, (ifeq2(leq(X1,X2),true,addition(X1,X2),X2)=X2)).
% 15.77/2.35 cnf(i_0_35, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 15.77/2.35 cnf(i_0_42, plain, (ifeq(leq(X1,addition(multiplication(X2,X1),X3)),true,leq(X1,multiplication(strong_iteration(X2),X3)),true)=true)).
% 15.77/2.35 cnf(i_0_40, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X1),true,leq(multiplication(X3,star(X2)),X1),true)=true)).
% 15.77/2.35 cnf(i_0_39, plain, (ifeq(leq(addition(multiplication(X1,X2),X3),X2),true,leq(multiplication(star(X1),X3),X2),true)=true)).
% 15.77/2.35 cnf(i_0_27, plain, (addition(X1,X2)=addition(X2,X1))).
% 15.77/2.35 cnf(i_0_46, negated_conjecture, (star(strong_iteration(sK1_goals_X0))!=strong_iteration(sK1_goals_X0))).
% 15.77/2.35 cnf(i_0_48, plain, (X4=X4)).
% 15.77/2.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 15.77/2.35 # Begin printing tableau
% 15.77/2.35 # Found 6 steps
% 15.77/2.35 cnf(i_0_36, plain, (multiplication(zero,X7)=zero), inference(start_rule)).
% 15.77/2.35 cnf(i_0_60, plain, (multiplication(zero,X7)=zero), inference(extension_rule, [i_0_56])).
% 15.77/2.35 cnf(i_0_110, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_36])).
% 15.77/2.35 cnf(i_0_109, plain, (multiplication(multiplication(zero,zero),multiplication(zero,X7))=multiplication(zero,zero)), inference(extension_rule, [i_0_51])).
% 15.77/2.35 cnf(i_0_125, plain, (multiplication(zero,zero)!=zero), inference(closure_rule, [i_0_36])).
% 15.77/2.35 cnf(i_0_123, plain, (multiplication(multiplication(zero,zero),multiplication(zero,X7))=zero), inference(etableau_closure_rule, [i_0_123, ...])).
% 15.77/2.35 # End printing tableau
% 15.77/2.35 # SZS output end
% 15.77/2.35 # Branches closed with saturation will be marked with an "s"
% 15.77/2.36 # Child (28835) has found a proof.
% 15.77/2.36
% 15.77/2.36 # Proof search is over...
% 15.77/2.36 # Freeing feature tree
%------------------------------------------------------------------------------