TSTP Solution File: KLE037+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE037+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 : 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:45 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE037+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 09:25:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 18 Number of unprocessed: 18
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 18 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 1 conjectures.
% 0.20/0.37 # There are 1 start rule candidates:
% 0.20/0.37 # Found 14 unit axioms.
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 4 extension rule candidate clauses
% 0.20/0.37 # 14 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.37 # Creating equality axioms
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 26 tableaux to operate on
% 0.20/0.38 # There were 1 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 1 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 1 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 0.20/0.38 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 0.20/0.38 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 0.20/0.38 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 0.20/0.38 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 0.20/0.38 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 0.20/0.38 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 0.20/0.38 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))).
% 0.20/0.38 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))).
% 0.20/0.38 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 0.20/0.38 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 0.20/0.38 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 0.20/0.38 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 0.20/0.38 cnf(i_0_18, negated_conjecture, (~leq(one,star(esk1_0)))).
% 0.20/0.38 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 0.20/0.38 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 0.20/0.38 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))).
% 0.20/0.38 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))).
% 0.20/0.38 cnf(i_0_36, plain, (X36=X36)).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 6 steps
% 0.20/0.38 cnf(i_0_6, plain, (multiplication(one,one)=one), inference(start_rule)).
% 0.20/0.38 cnf(i_0_44, plain, (multiplication(one,one)=one), inference(extension_rule, [i_0_42])).
% 0.20/0.38 cnf(i_0_88, plain, (leq(one,star(esk1_0))), inference(closure_rule, [i_0_18])).
% 0.20/0.38 cnf(i_0_90, plain, (multiplication(star(esk1_0),one)!=star(esk1_0)), inference(closure_rule, [i_0_6])).
% 0.20/0.38 cnf(i_0_91, plain, (~leq(multiplication(one,one),multiplication(star(esk1_0),one))), inference(extension_rule, [i_0_12])).
% 0.20/0.38 cnf(i_0_97, plain, (addition(multiplication(one,one),multiplication(star(esk1_0),one))!=multiplication(star(esk1_0),one)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Child (14563) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------