TSTP Solution File: KLE173+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KLE173+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 : n019.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:28 EDT 2022
% Result : Timeout 292.26s 36.98s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : KLE173+1 : TPTP v8.1.0. Released v6.4.0.
% 0.04/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.06/0.26 % Computer : n019.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Thu Jun 16 09:23:39 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.06/0.29 # No SInE strategy applied
% 0.06/0.29 # Auto-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.06/0.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.06/0.29 #
% 0.06/0.29 # Presaturation interreduction done
% 0.06/0.29 # Number of axioms: 36 Number of unprocessed: 36
% 0.06/0.29 # Tableaux proof search.
% 0.06/0.29 # APR header successfully linked.
% 0.06/0.29 # Hello from C++
% 0.06/0.30 # The folding up rule is enabled...
% 0.06/0.30 # Local unification is enabled...
% 0.06/0.30 # Any saturation attempts will use folding labels...
% 0.06/0.30 # 36 beginning clauses after preprocessing and clausification
% 0.06/0.30 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.06/0.30 # No conjectures.
% 0.06/0.30 # There are 36 start rule candidates:
% 0.06/0.30 # Found 11 unit axioms.
% 0.06/0.30 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.06/0.30 # 36 start rule tableaux created.
% 0.06/0.30 # 25 extension rule candidate clauses
% 0.06/0.30 # 11 unit axiom clauses
% 0.06/0.30
% 0.06/0.30 # Requested 8, 32 cores available to the main process.
% 292.26/36.98 # 6488 Satisfiable branch
% 292.26/36.98 # Satisfiable branch found.
% 292.26/36.98 # There were 10 total branch saturation attempts.
% 292.26/36.98 # There were 5 of these attempts blocked.
% 292.26/36.98 # There were 0 deferred branch saturation attempts.
% 292.26/36.98 # There were 0 free duplicated saturations.
% 292.26/36.98 # There were 0 total successful branch saturations.
% 292.26/36.98 # There were 0 successful branch saturations in interreduction.
% 292.26/36.98 # There were 0 successful branch saturations on the branch.
% 292.26/36.98 # There were 0 successful branch saturations after the branch.
% 292.26/36.98 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 292.26/36.98 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 292.26/36.98 # Begin clausification derivation
% 292.26/36.98
% 292.26/36.98 # End clausification derivation
% 292.26/36.98 # Begin listing active clauses obtained from FOF to CNF conversion
% 292.26/36.98 cnf(i_0_4, plain, (addition(X1,X1)=X1)).
% 292.26/36.98 cnf(i_0_3, plain, (addition(X1,zero)=X1)).
% 292.26/36.98 cnf(i_0_6, plain, (multiplication(X1,one)=X1)).
% 292.26/36.98 cnf(i_0_7, plain, (multiplication(one,X1)=X1)).
% 292.26/36.98 cnf(i_0_10, plain, (multiplication(X1,zero)=zero)).
% 292.26/36.98 cnf(i_0_11, plain, (multiplication(zero,X1)=zero)).
% 292.26/36.98 cnf(i_0_2, plain, (addition(addition(X1,X2),X3)=addition(X1,addition(X2,X3)))).
% 292.26/36.98 cnf(i_0_5, plain, (multiplication(multiplication(X1,X2),X3)=multiplication(X1,multiplication(X2,X3)))).
% 292.26/36.98 cnf(i_0_8, plain, (addition(multiplication(X1,X2),multiplication(X1,X3))=multiplication(X1,addition(X2,X3)))).
% 292.26/36.98 cnf(i_0_9, plain, (addition(multiplication(X1,X2),multiplication(X3,X2))=multiplication(addition(X1,X3),X2))).
% 292.26/36.98 cnf(i_0_1, plain, (addition(X1,X2)=addition(X2,X1))).
% 292.26/36.98 cnf(i_0_22, plain, (c(X1)=zero|test(X1))).
% 292.26/36.98 cnf(i_0_14, plain, (test(X1)|~complement(X2,X1))).
% 292.26/36.98 cnf(i_0_15, plain, (complement(esk1_1(X1),X1)|~test(X1))).
% 292.26/36.98 cnf(i_0_13, plain, (addition(X1,X2)=X2|~leq(X1,X2))).
% 292.26/36.98 cnf(i_0_12, plain, (leq(X1,X2)|addition(X1,X2)!=X2)).
% 292.26/36.98 cnf(i_0_29, plain, (leq(X1,X2)|~ismeet(X1,X3,X2))).
% 292.26/36.98 cnf(i_0_30, plain, (leq(X1,X2)|~ismeet(X1,X2,X3))).
% 292.26/36.98 cnf(i_0_17, plain, (addition(X1,X2)=one|~complement(X2,X1))).
% 292.26/36.98 cnf(i_0_19, plain, (multiplication(X1,X2)=zero|~complement(X2,X1))).
% 292.26/36.98 cnf(i_0_18, plain, (multiplication(X1,X2)=zero|~complement(X1,X2))).
% 292.26/36.98 cnf(i_0_20, plain, (c(X1)=X2|~complement(X1,X2)|~test(X1))).
% 292.26/36.98 cnf(i_0_34, plain, (leq(X1,X2)|~ismeetu(X3,X4,X2)|~leq(X1,X3))).
% 292.26/36.98 cnf(i_0_35, plain, (leq(X1,X2)|~ismeetu(X3,X2,X4)|~leq(X1,X3))).
% 292.26/36.98 cnf(i_0_28, plain, (leq(X1,X2)|~ismeet(X2,X3,X4)|~leq(X1,X4)|~leq(X1,X3))).
% 292.26/36.98 cnf(i_0_23, plain, (c(addition(X1,X2))=multiplication(c(X1),c(X2))|~test(X2)|~test(X1))).
% 292.26/36.98 cnf(i_0_36, plain, (leq(X1,X2)|~ismeetu(X2,X3,X4)|~leq(X1,X4)|~leq(X1,X3))).
% 292.26/36.98 cnf(i_0_24, plain, (c(multiplication(X1,X2))=addition(c(X1),c(X2))|~test(X2)|~test(X1))).
% 292.26/36.98 cnf(i_0_31, plain, (ismeetu(X1,X2,X3)|leq(esk3_3(X2,X3,X1),X3)|leq(esk3_3(X2,X3,X1),X1))).
% 292.26/36.98 cnf(i_0_32, plain, (ismeetu(X1,X2,X3)|leq(esk3_3(X2,X3,X1),X2)|leq(esk3_3(X2,X3,X1),X1))).
% 292.26/36.98 cnf(i_0_16, plain, (complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero)).
% 292.26/36.98 cnf(i_0_26, plain, (ismeet(X1,X2,X3)|leq(esk2_3(X2,X3,X1),X3)|~leq(X1,X3)|~leq(X1,X2))).
% 292.26/36.98 cnf(i_0_27, plain, (ismeet(X1,X2,X3)|leq(esk2_3(X2,X3,X1),X2)|~leq(X1,X3)|~leq(X1,X2))).
% 292.26/36.98 cnf(i_0_25, plain, (ismeet(X1,X2,X3)|~leq(esk2_3(X2,X3,X1),X1)|~leq(X1,X3)|~leq(X1,X2))).
% 292.26/36.98 cnf(i_0_33, 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))).
% 292.26/36.98 cnf(i_0_21, plain, (complement(X1,c(X1))|~test(X1))).
% 292.26/36.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 292.26/36.98 # Begin printing tableau
% 292.26/36.98 # Found 30 steps
% 292.26/36.98 cnf(i_0_27, plain, (ismeet(one,zero,zero)|leq(esk2_3(zero,zero,one),zero)|~leq(one,zero)|~leq(one,zero)), inference(start_rule)).
% 292.26/36.98 cnf(i_0_106, plain, (ismeet(one,zero,zero)), inference(extension_rule, [i_0_28])).
% 292.26/36.98 cnf(i_0_1063841, plain, (leq(zero,one)), inference(extension_rule, [i_0_13])).
% 292.26/36.98 cnf(i_0_1063867, plain, (addition(zero,one)=one), inference(extension_rule, [i_0_16])).
% 292.26/36.98 cnf(i_0_1063885, plain, (multiplication(one,zero)!=zero), inference(closure_rule, [i_0_7])).
% 292.26/36.98 cnf(i_0_1063886, plain, (multiplication(zero,one)!=zero), inference(closure_rule, [i_0_6])).
% 292.26/36.98 cnf(i_0_1063844, plain, (~leq(zero,zero)), inference(extension_rule, [i_0_12])).
% 292.26/36.98 cnf(i_0_1064031, plain, (addition(zero,zero)!=zero), inference(closure_rule, [i_0_4])).
% 292.26/36.98 cnf(i_0_1063843, plain, (~leq(zero,zero)), inference(closure_rule, [i_0_1063844])).
% 292.26/36.98 cnf(i_0_107, plain, (leq(esk2_3(zero,zero,one),zero)), inference(extension_rule, [i_0_25])).
% 292.26/36.98 cnf(i_0_1637600, plain, (~leq(esk2_3(zero,zero,one),zero)), inference(closure_rule, [i_0_107])).
% 292.26/36.98 cnf(i_0_1637597, plain, (ismeet(esk2_3(zero,zero,one),zero,zero)), inference(extension_rule, [i_0_28])).
% 292.26/36.98 cnf(i_0_2125196, plain, (~leq(esk2_3(zero,zero,one),zero)), inference(closure_rule, [i_0_107])).
% 292.26/36.98 cnf(i_0_2125197, plain, (~leq(esk2_3(zero,zero,one),zero)), inference(closure_rule, [i_0_107])).
% 292.26/36.98 cnf(i_0_2125194, plain, (leq(esk2_3(zero,zero,one),esk2_3(zero,zero,one))), inference(extension_rule, [i_0_27])).
% 292.26/36.98 cnf(i_0_2125228, plain, (~leq(esk2_3(zero,zero,one),esk2_3(zero,zero,one))), inference(closure_rule, [i_0_2125194])).
% 292.26/36.98 cnf(i_0_1637598, plain, (~leq(esk2_3(zero,zero,esk2_3(zero,zero,one)),esk2_3(zero,zero,one))), inference(extension_rule, [i_0_36])).
% 292.26/36.98 cnf(i_0_2125367, plain, (~ismeetu(esk2_3(zero,zero,one),X6,zero)), inference(extension_rule, [i_0_33])).
% 292.26/36.98 cnf(i_0_2125368, plain, (~leq(esk2_3(zero,zero,esk2_3(zero,zero,one)),zero)), inference(extension_rule, [i_0_26])).
% 292.26/36.98 cnf(i_0_2125417, plain, (~leq(esk2_3(zero,zero,one),zero)), inference(closure_rule, [i_0_107])).
% 292.26/36.98 cnf(i_0_2125418, plain, (~leq(esk2_3(zero,zero,one),zero)), inference(closure_rule, [i_0_107])).
% 292.26/36.98 cnf(i_0_2125369, plain, (~leq(esk2_3(zero,zero,esk2_3(zero,zero,one)),X6)), inference(extension_rule, [i_0_30])).
% 292.26/36.98 cnf(i_0_108, plain, (~leq(one,zero)), inference(extension_rule, [i_0_34])).
% 292.26/36.98 cnf(i_0_2125492, plain, (~ismeetu(one,X8,zero)), inference(extension_rule, [i_0_32])).
% 292.26/36.98 cnf(i_0_2125518, plain, (leq(esk3_3(X8,zero,one),X8)), inference(extension_rule, [i_0_13])).
% 292.26/36.98 cnf(i_0_2125519, plain, (leq(esk3_3(X8,zero,one),one)), inference(extension_rule, [i_0_25])).
% 292.26/36.98 cnf(i_0_2125589, plain, (~leq(esk3_3(X8,zero,one),one)), inference(closure_rule, [i_0_2125519])).
% 292.26/36.98 cnf(i_0_2125493, plain, (~leq(one,one)), inference(extension_rule, [i_0_12])).
% 292.26/36.98 cnf(i_0_2125624, plain, (addition(one,one)!=one), inference(closure_rule, [i_0_4])).
% 292.26/36.98 cnf(i_0_109, plain, (~leq(one,zero)), inference(extension_rule, [i_0_35])).
% 292.26/36.98 # End printing tableau
% 292.26/36.98 # SZS output end
% 292.26/36.98 # Branches closed with saturation will be marked with an "s"
% 292.26/37.03 # Child (6488) has found a proof.
% 292.26/37.03
% 292.26/37.03 # Proof search is over...
% 292.26/37.03 # Freeing feature tree
%------------------------------------------------------------------------------