TSTP Solution File: KLE131+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE131+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 : n022.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:12 EDT 2022
% Result : Theorem 7.78s 1.37s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : KLE131+1 : TPTP v8.1.0. Released v4.0.0.
% 0.15/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 09:47:32 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.40 # No SInE strategy applied
% 0.22/0.40 # Auto-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.22/0.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.22/0.40 #
% 0.22/0.40 # Presaturation interreduction done
% 0.22/0.40 # Number of axioms: 23 Number of unprocessed: 23
% 0.22/0.40 # Tableaux proof search.
% 0.22/0.40 # APR header successfully linked.
% 0.22/0.40 # Hello from C++
% 0.22/0.40 # The folding up rule is enabled...
% 0.22/0.40 # Local unification is enabled...
% 0.22/0.40 # Any saturation attempts will use folding labels...
% 0.22/0.40 # 23 beginning clauses after preprocessing and clausification
% 0.22/0.40 # Creating start rules for all 2 conjectures.
% 0.22/0.40 # There are 2 start rule candidates:
% 0.22/0.40 # Found 20 unit axioms.
% 0.22/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.40 # 2 start rule tableaux created.
% 0.22/0.40 # 3 extension rule candidate clauses
% 0.22/0.40 # 20 unit axiom clauses
% 0.22/0.40
% 0.22/0.40 # Requested 8, 32 cores available to the main process.
% 0.22/0.40 # There are not enough tableaux to fork, creating more from the initial 2
% 0.22/0.40 # Creating equality axioms
% 0.22/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.22/0.40 # Returning from population with 35 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.40 # We now have 35 tableaux to operate on
% 7.78/1.37 # There were 1 total branch saturation attempts.
% 7.78/1.37 # There were 0 of these attempts blocked.
% 7.78/1.37 # There were 0 deferred branch saturation attempts.
% 7.78/1.37 # There were 0 free duplicated saturations.
% 7.78/1.37 # There were 1 total successful branch saturations.
% 7.78/1.37 # There were 0 successful branch saturations in interreduction.
% 7.78/1.37 # There were 0 successful branch saturations on the branch.
% 7.78/1.37 # There were 1 successful branch saturations after the branch.
% 7.78/1.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.78/1.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.78/1.37 # Begin clausification derivation
% 7.78/1.37
% 7.78/1.37 # End clausification derivation
% 7.78/1.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 7.78/1.37 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 7.78/1.37 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 7.78/1.37 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 7.78/1.37 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 7.78/1.37 cnf(i_0_14, plain, (multiplication(antidomain(X1),X1)=zero)).
% 7.78/1.37 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 7.78/1.37 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 7.78/1.37 cnf(i_0_18, plain, (multiplication(X1,coantidomain(X1))=zero)).
% 7.78/1.37 cnf(i_0_16, plain, (addition(antidomain(X1),antidomain(antidomain(X1)))=one)).
% 7.78/1.37 cnf(i_0_28, plain, (antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1))))))=divergence(X1))).
% 7.78/1.37 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 7.78/1.37 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 7.78/1.37 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 7.78/1.37 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 7.78/1.37 cnf(i_0_20, plain, (addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one)).
% 7.78/1.37 cnf(i_0_15, plain, (addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2)))))).
% 7.78/1.37 cnf(i_0_19, plain, (addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))=coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)))).
% 7.78/1.37 cnf(i_0_31, negated_conjecture, (addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(X1)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))))))))))=antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(X1)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))))))))))).
% 7.78/1.37 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 7.78/1.37 cnf(i_0_30, negated_conjecture, (divergence(esk1_0)!=zero)).
% 7.78/1.37 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 7.78/1.37 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 7.78/1.37 cnf(i_0_29, plain, (addition(antidomain(antidomain(X1)),addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3)))))))))=addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))|addition(antidomain(antidomain(X1)),addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))))!=addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))))).
% 7.78/1.37 cnf(i_0_52, plain, (X56=X56)).
% 7.78/1.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 7.78/1.37 # Begin printing tableau
% 7.78/1.37 # Found 12 steps
% 7.78/1.37 cnf(i_0_10, plain, (multiplication(X7,zero)=zero), inference(start_rule)).
% 7.78/1.37 cnf(i_0_63, plain, (multiplication(X7,zero)=zero), inference(extension_rule, [i_0_58])).
% 7.78/1.37 cnf(i_0_110, plain, (multiplication(X7,zero)!=zero), inference(closure_rule, [i_0_10])).
% 7.78/1.37 cnf(i_0_109, plain, (leq(zero,zero)), inference(extension_rule, [i_0_13])).
% 7.78/1.37 cnf(i_0_121, plain, (addition(zero,zero)=zero), inference(extension_rule, [i_0_55])).
% 7.78/1.37 cnf(i_0_133, plain, (zero!=multiplication(X7,zero)), inference(closure_rule, [i_0_10])).
% 7.78/1.37 cnf(i_0_112, plain, (~leq(multiplication(X7,zero),multiplication(X7,zero))), inference(extension_rule, [i_0_58])).
% 7.78/1.37 cnf(i_0_209, plain, (multiplication(X7,zero)!=zero), inference(closure_rule, [i_0_10])).
% 7.78/1.37 cnf(i_0_210, plain, (multiplication(X7,zero)!=zero), inference(closure_rule, [i_0_10])).
% 7.78/1.37 cnf(i_0_211, plain, (~leq(zero,zero)), inference(extension_rule, [i_0_12])).
% 7.78/1.37 cnf(i_0_235, plain, (addition(zero,zero)!=zero), inference(closure_rule, [i_0_3])).
% 7.78/1.37 cnf(i_0_131, plain, (addition(zero,zero)=multiplication(X7,zero)), inference(etableau_closure_rule, [i_0_131, ...])).
% 7.78/1.37 # End printing tableau
% 7.78/1.37 # SZS output end
% 7.78/1.37 # Branches closed with saturation will be marked with an "s"
% 7.78/1.38 # Child (18188) has found a proof.
% 7.78/1.38
% 7.78/1.38 # Proof search is over...
% 7.78/1.38 # Freeing feature tree
%------------------------------------------------------------------------------