TSTP Solution File: KLE179+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE179+1 : TPTP v8.1.0. Released v6.4.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 : n025.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:29 EDT 2022
% Result : Satisfiable 138.01s 17.81s
% Output : CNFRefutation 138.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE179+1 : TPTP v8.1.0. Released v6.4.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.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 10:54:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 42 Number of unprocessed: 42
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 42 beginning clauses after preprocessing and clausification
% 0.13/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.13/0.38 # No conjectures.
% 0.13/0.38 # There are 42 start rule candidates:
% 0.13/0.38 # Found 14 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 42 start rule tableaux created.
% 0.13/0.38 # 28 extension rule candidate clauses
% 0.13/0.38 # 14 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 138.01/17.81 # 21844 Satisfiable branch
% 138.01/17.81 # Satisfiable branch found.
% 138.01/17.81 # There were 14 total branch saturation attempts.
% 138.01/17.81 # There were 2 of these attempts blocked.
% 138.01/17.81 # There were 0 deferred branch saturation attempts.
% 138.01/17.81 # There were 0 free duplicated saturations.
% 138.01/17.81 # There were 1 total successful branch saturations.
% 138.01/17.81 # There were 0 successful branch saturations in interreduction.
% 138.01/17.81 # There were 0 successful branch saturations on the branch.
% 138.01/17.81 # There were 1 successful branch saturations after the branch.
% 138.01/17.81 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 138.01/17.81 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 138.01/17.81 # Begin clausification derivation
% 138.01/17.81
% 138.01/17.81 # End clausification derivation
% 138.01/17.81 # Begin listing active clauses obtained from FOF to CNF conversion
% 138.01/17.81 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 138.01/17.81 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 138.01/17.81 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 138.01/17.81 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 138.01/17.81 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 138.01/17.81 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 138.01/17.81 cnf(i_0_18, plain, (multiplication(X1,omega(X1))=omega(X1))).
% 138.01/17.81 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 138.01/17.81 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 138.01/17.81 cnf(i_0_14, plain, (leq(addition(one,multiplication(X1,star(X1))),star(X1)))).
% 138.01/17.81 cnf(i_0_15, plain, (leq(addition(one,multiplication(star(X1),X1)),star(X1)))).
% 138.01/17.81 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 138.01/17.81 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 138.01/17.81 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 138.01/17.81 cnf(i_0_28, plain, (c(X1)=zero|test(X1))).
% 138.01/17.81 cnf(i_0_20, plain, (test(X1)|~complement(X2,X1))).
% 138.01/17.81 cnf(i_0_35, plain, (leq(X1,X2)|~ismeet(X1,X3,X2))).
% 138.01/17.81 cnf(i_0_36, plain, (leq(X1,X2)|~ismeet(X1,X2,X3))).
% 138.01/17.81 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 138.01/17.81 cnf(i_0_23, plain, (addition(X1,X2)=one|~complement(X2,X1))).
% 138.01/17.81 cnf(i_0_25, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
% 138.01/17.81 cnf(i_0_24, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
% 138.01/17.81 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 138.01/17.81 cnf(i_0_21, plain, (complement(esk1_1(X1),X1)|~test(X1))).
% 138.01/17.81 cnf(i_0_26, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
% 138.01/17.81 cnf(i_0_27, plain, (complement(X1,c(X1))|~test(X1))).
% 138.01/17.81 cnf(i_0_40, plain, (leq(X1,X2)|~ismeetu(X3,X4,X2)|~leq(X1,X3))).
% 138.01/17.81 cnf(i_0_22, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)).
% 138.01/17.81 cnf(i_0_41, plain, (leq(X1,X2)|~ismeetu(X3,X2,X4)|~leq(X1,X3))).
% 138.01/17.81 cnf(i_0_29, plain, (multiplication(c(X1),c(X2))=c(addition(X1,X2))|~test(X2)|~test(X1))).
% 138.01/17.81 cnf(i_0_31, plain, (ismeet(X1,X2,X3)|~leq(esk2_3(X2,X3,X1),X1)|~leq(X1,X3)|~leq(X1,X2))).
% 138.01/17.81 cnf(i_0_34, plain, (leq(X1,X2)|~ismeet(X2,X3,X4)|~leq(X1,X4)|~leq(X1,X3))).
% 138.01/17.81 cnf(i_0_42, plain, (leq(X1,X2)|~ismeetu(X2,X3,X4)|~leq(X1,X4)|~leq(X1,X3))).
% 138.01/17.81 cnf(i_0_30, plain, (addition(c(X1),c(X2))=c(multiplication(X1,X2))|~test(X2)|~test(X1))).
% 138.01/17.81 cnf(i_0_17, plain, (leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3))).
% 138.01/17.81 cnf(i_0_16, plain, (leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3))).
% 138.01/17.81 cnf(i_0_32, plain, (ismeet(X1,X2,X3)|leq(esk2_3(X2,X3,X1),X3)|~leq(X1,X3)|~leq(X1,X2))).
% 138.01/17.81 cnf(i_0_33, plain, (ismeet(X1,X2,X3)|leq(esk2_3(X2,X3,X1),X2)|~leq(X1,X3)|~leq(X1,X2))).
% 138.01/17.81 cnf(i_0_37, plain, (ismeetu(X1,X2,X3)|leq(esk3_3(X2,X3,X1),X3)|leq(esk3_3(X2,X3,X1),X1))).
% 138.01/17.81 cnf(i_0_39, plain, (ismeetu(X1,X2,X3)|~leq(esk3_3(X2,X3,X1),X1)|~leq(esk3_3(X2,X3,X1),X3)|~leq(esk3_3(X2,X3,X1),X2))).
% 138.01/17.81 cnf(i_0_19, plain, (leq(X1,addition(omega(X2),multiplication(star(X2),X3)))|~leq(X1,addition(multiplication(X2,X1),X3)))).
% 138.01/17.81 cnf(i_0_38, plain, (ismeetu(X1,X2,X3)|leq(esk3_3(X2,X3,X1),X2)|leq(esk3_3(X2,X3,X1),X1))).
% 138.01/17.81 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 138.01/17.81 # Begin printing tableau
% 138.01/17.81 # Found 6 steps
% 138.01/17.81 cnf(i_0_27, plain, (complement(one,c(one))|~test(one)), inference(start_rule)).
% 138.01/17.81 cnf(i_0_81, plain, (complement(one,c(one))), inference(extension_rule, [i_0_23])).
% 138.01/17.81 cnf(i_0_1423508, plain, (addition(c(one),one)=one), inference(extension_rule, [i_0_12])).
% 138.01/17.81 cnf(i_0_82, plain, (~test(one)), inference(etableau_closure_rule, [i_0_82, ...])).
% 138.01/17.81 cnf(i_0_1423551, plain, (leq(c(one),one)), inference(extension_rule, [i_0_33])).
% 138.01/17.81 cnf(i_0_1575954, plain, (~leq(c(one),one)), inference(closure_rule, [i_0_1423551])).
% 138.01/17.81 # End printing tableau
% 138.01/17.81 # SZS output end
% 138.01/17.81 # Branches closed with saturation will be marked with an "s"
% 138.01/17.82 # Child (21844) has found a proof.
% 138.01/17.82
% 138.01/17.82 # Proof search is over...
% 138.01/17.82 # Freeing feature tree
%------------------------------------------------------------------------------