TSTP Solution File: KLE090-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE090-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 : n008.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:01 EDT 2022
% Result : Unsatisfiable 2.59s 0.72s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE090-10 : TPTP v8.1.0. Released v7.3.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.12/0.34 % Computer : n008.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 : Thu Jun 16 14:04:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 23 Number of unprocessed: 23
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 23 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 2 conjectures.
% 0.12/0.37 # There are 2 start rule candidates:
% 0.12/0.37 # Found 23 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 2 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 23 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 41 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 41 tableaux to operate on
% 2.59/0.72 # There were 1 total branch saturation attempts.
% 2.59/0.72 # There were 0 of these attempts blocked.
% 2.59/0.72 # There were 0 deferred branch saturation attempts.
% 2.59/0.72 # There were 0 free duplicated saturations.
% 2.59/0.72 # There were 1 total successful branch saturations.
% 2.59/0.72 # There were 0 successful branch saturations in interreduction.
% 2.59/0.72 # There were 0 successful branch saturations on the branch.
% 2.59/0.72 # There were 1 successful branch saturations after the branch.
% 2.59/0.72 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/0.72 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/0.72 # Begin clausification derivation
% 2.59/0.72
% 2.59/0.72 # End clausification derivation
% 2.59/0.72 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.59/0.72 cnf(i_0_49, negated_conjecture, (addition(sK2_goals_X0,sK1_goals_X1)=sK1_goals_X1)).
% 2.59/0.72 cnf(i_0_37, plain, (multiplication(X1,zero)=zero)).
% 2.59/0.72 cnf(i_0_38, plain, (multiplication(zero,X1)=zero)).
% 2.59/0.72 cnf(i_0_30, plain, (addition(X1,zero)=X1)).
% 2.59/0.72 cnf(i_0_33, plain, (multiplication(X1,one)=X1)).
% 2.59/0.72 cnf(i_0_34, plain, (multiplication(one,X1)=X1)).
% 2.59/0.72 cnf(i_0_31, plain, (addition(X1,X1)=X1)).
% 2.59/0.72 cnf(i_0_45, plain, (multiplication(X1,coantidomain(X1))=zero)).
% 2.59/0.72 cnf(i_0_41, plain, (multiplication(antidomain(X1),X1)=zero)).
% 2.59/0.72 cnf(i_0_29, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 2.59/0.72 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 2.59/0.72 cnf(i_0_43, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)).
% 2.59/0.72 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 2.59/0.72 cnf(i_0_47, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)).
% 2.59/0.72 cnf(i_0_32, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 2.59/0.72 cnf(i_0_40, plain, (ifeq2(addition(X1,X2),X2,leq(X1,X2),true)=true)).
% 2.59/0.72 cnf(i_0_39, plain, (ifeq(leq(X1,X2),true,addition(X1,X2),X2)=X2)).
% 2.59/0.72 cnf(i_0_35, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 2.59/0.72 cnf(i_0_36, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 2.59/0.72 cnf(i_0_42, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))).
% 2.59/0.72 cnf(i_0_46, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))).
% 2.59/0.72 cnf(i_0_28, plain, (addition(X1,X2)=addition(X2,X1))).
% 2.59/0.72 cnf(i_0_50, negated_conjecture, (addition(antidomain(sK2_goals_X0),antidomain(sK1_goals_X1))!=antidomain(sK2_goals_X0))).
% 2.59/0.72 cnf(i_0_53, plain, (X4=X4)).
% 2.59/0.72 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.59/0.72 # Begin printing tableau
% 2.59/0.72 # Found 6 steps
% 2.59/0.72 cnf(i_0_49, negated_conjecture, (addition(sK2_goals_X0,sK1_goals_X1)=sK1_goals_X1), inference(start_rule)).
% 2.59/0.72 cnf(i_0_64, plain, (addition(sK2_goals_X0,sK1_goals_X1)=sK1_goals_X1), inference(extension_rule, [i_0_59])).
% 2.59/0.72 cnf(i_0_107, plain, (addition(sK2_goals_X0,sK1_goals_X1)!=sK1_goals_X1), inference(closure_rule, [i_0_49])).
% 2.59/0.72 cnf(i_0_105, plain, (addition(addition(sK2_goals_X0,sK1_goals_X1),addition(sK2_goals_X0,sK1_goals_X1))=addition(sK1_goals_X1,sK1_goals_X1)), inference(extension_rule, [i_0_56])).
% 2.59/0.72 cnf(i_0_124, plain, (addition(sK1_goals_X1,sK1_goals_X1)!=addition(addition(sK1_goals_X1,sK1_goals_X1),zero)), inference(closure_rule, [i_0_30])).
% 2.59/0.72 cnf(i_0_122, plain, (addition(addition(sK2_goals_X0,sK1_goals_X1),addition(sK2_goals_X0,sK1_goals_X1))=addition(addition(sK1_goals_X1,sK1_goals_X1),zero)), inference(etableau_closure_rule, [i_0_122, ...])).
% 2.59/0.72 # End printing tableau
% 2.59/0.72 # SZS output end
% 2.59/0.72 # Branches closed with saturation will be marked with an "s"
% 2.59/0.72 # There were 1 total branch saturation attempts.
% 2.59/0.72 # There were 0 of these attempts blocked.
% 2.59/0.72 # There were 0 deferred branch saturation attempts.
% 2.59/0.72 # There were 0 free duplicated saturations.
% 2.59/0.72 # There were 1 total successful branch saturations.
% 2.59/0.72 # There were 0 successful branch saturations in interreduction.
% 2.59/0.72 # There were 0 successful branch saturations on the branch.
% 2.59/0.72 # There were 1 successful branch saturations after the branch.
% 2.59/0.72 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/0.72 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/0.72 # Begin clausification derivation
% 2.59/0.72
% 2.59/0.72 # End clausification derivation
% 2.59/0.72 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.59/0.72 cnf(i_0_49, negated_conjecture, (addition(sK2_goals_X0,sK1_goals_X1)=sK1_goals_X1)).
% 2.59/0.72 cnf(i_0_37, plain, (multiplication(X1,zero)=zero)).
% 2.59/0.72 cnf(i_0_38, plain, (multiplication(zero,X1)=zero)).
% 2.59/0.72 cnf(i_0_30, plain, (addition(X1,zero)=X1)).
% 2.59/0.72 cnf(i_0_33, plain, (multiplication(X1,one)=X1)).
% 2.59/0.72 cnf(i_0_34, plain, (multiplication(one,X1)=X1)).
% 2.59/0.72 cnf(i_0_31, plain, (addition(X1,X1)=X1)).
% 2.59/0.72 cnf(i_0_45, plain, (multiplication(X1,coantidomain(X1))=zero)).
% 2.59/0.72 cnf(i_0_41, plain, (multiplication(antidomain(X1),X1)=zero)).
% 2.59/0.72 cnf(i_0_29, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 2.59/0.72 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 2.59/0.72 cnf(i_0_43, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)).
% 2.59/0.72 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 2.59/0.72 cnf(i_0_47, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)).
% 2.59/0.72 cnf(i_0_32, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 2.59/0.72 cnf(i_0_40, plain, (ifeq2(addition(X1,X2),X2,leq(X1,X2),true)=true)).
% 2.59/0.72 cnf(i_0_39, plain, (ifeq(leq(X1,X2),true,addition(X1,X2),X2)=X2)).
% 2.59/0.72 cnf(i_0_35, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 2.59/0.72 cnf(i_0_36, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 2.59/0.72 cnf(i_0_42, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))).
% 2.59/0.72 cnf(i_0_46, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))).
% 2.59/0.72 cnf(i_0_28, plain, (addition(X1,X2)=addition(X2,X1))).
% 2.59/0.72 cnf(i_0_50, negated_conjecture, (addition(antidomain(sK2_goals_X0),antidomain(sK1_goals_X1))!=antidomain(sK2_goals_X0))).
% 2.59/0.72 cnf(i_0_53, plain, (X4=X4)).
% 2.59/0.72 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.59/0.72 # Begin printing tableau
% 2.59/0.72 # Found 6 steps
% 2.59/0.72 cnf(i_0_49, negated_conjecture, (addition(sK2_goals_X0,sK1_goals_X1)=sK1_goals_X1), inference(start_rule)).
% 2.59/0.72 cnf(i_0_64, plain, (addition(sK2_goals_X0,sK1_goals_X1)=sK1_goals_X1), inference(extension_rule, [i_0_61])).
% 2.59/0.72 cnf(i_0_113, plain, (addition(sK2_goals_X0,sK1_goals_X1)!=sK1_goals_X1), inference(closure_rule, [i_0_49])).
% 2.59/0.72 cnf(i_0_111, plain, (leq(addition(sK2_goals_X0,sK1_goals_X1),addition(sK2_goals_X0,sK1_goals_X1))=leq(sK1_goals_X1,sK1_goals_X1)), inference(extension_rule, [i_0_56])).
% 2.59/0.72 cnf(i_0_124, plain, (leq(sK1_goals_X1,sK1_goals_X1)!=addition(leq(sK1_goals_X1,sK1_goals_X1),zero)), inference(closure_rule, [i_0_30])).
% 2.59/0.72 cnf(i_0_122, plain, (leq(addition(sK2_goals_X0,sK1_goals_X1),addition(sK2_goals_X0,sK1_goals_X1))=addition(leq(sK1_goals_X1,sK1_goals_X1),zero)), inference(etableau_closure_rule, [i_0_122, ...])).
% 2.59/0.72 # End printing tableau
% 2.59/0.72 # SZS output end
% 2.59/0.72 # Branches closed with saturation will be marked with an "s"
% 2.59/0.73 # Child (30578) has found a proof.
% 2.59/0.73
% 2.59/0.73 # Proof search is over...
% 2.59/0.73 # Freeing feature tree
%------------------------------------------------------------------------------