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