TSTP Solution File: MSC010+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MSC010+1 : TPTP v8.1.0. Released v3.1.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 : n004.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 22:43:15 EDT 2022
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : MSC010+1 : TPTP v8.1.0. Released v3.1.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.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jul 1 15:47:23 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.14/0.40 # and selection function SelectUnlessUniqMax.
% 0.14/0.40 #
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40 # Number of axioms: 171 Number of unprocessed: 29
% 0.14/0.40 # Tableaux proof search.
% 0.14/0.40 # APR header successfully linked.
% 0.14/0.40 # Hello from C++
% 0.14/0.40 # The folding up rule is enabled...
% 0.14/0.40 # Local unification is enabled...
% 0.14/0.40 # Any saturation attempts will use folding labels...
% 0.14/0.40 # 29 beginning clauses after preprocessing and clausification
% 0.14/0.40 # Creating start rules for all 9 conjectures.
% 0.14/0.40 # There are 9 start rule candidates:
% 0.14/0.40 # Found 18 unit axioms.
% 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.40 # 9 start rule tableaux created.
% 0.14/0.40 # 11 extension rule candidate clauses
% 0.14/0.40 # 18 unit axiom clauses
% 0.14/0.40
% 0.14/0.40 # Requested 8, 32 cores available to the main process.
% 0.14/0.40 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done.
% 0.14/0.40 # There were 0 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 0 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 0 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_4, negated_conjecture, (esk1_0=pv63)).
% 0.14/0.40 cnf(i_0_10, negated_conjecture, (epred5_0)).
% 0.14/0.40 cnf(i_0_9, negated_conjecture, (leq(n0,pv63))).
% 0.14/0.40 cnf(i_0_171, plain, (epred4_0)).
% 0.14/0.40 cnf(i_0_138, plain, (epred3_0)).
% 0.14/0.40 cnf(i_0_8, negated_conjecture, (leq(n0,esk2_0))).
% 0.14/0.40 cnf(i_0_7, negated_conjecture, (leq(pv63,n5))).
% 0.14/0.40 cnf(i_0_3, negated_conjecture, (leq(esk2_0,pv64))).
% 0.14/0.40 cnf(i_0_6, negated_conjecture, (leq(esk2_0,n5))).
% 0.14/0.40 cnf(i_0_100, plain, (epred2_0)).
% 0.14/0.40 cnf(i_0_72, plain, (epred1_0)).
% 0.14/0.40 cnf(i_0_40, plain, (leq(pv5,n998))).
% 0.14/0.40 cnf(i_0_43, plain, (leq(n0,pv5))).
% 0.14/0.40 cnf(i_0_41, plain, (leq(n0,pv64))).
% 0.14/0.40 cnf(i_0_38, plain, (leq(pv64,n5))).
% 0.14/0.40 cnf(i_0_5, negated_conjecture, (esk2_0!=pv64)).
% 0.14/0.40 cnf(i_0_2, negated_conjecture, (a_select3(id_ds1_filter_init,pv63,esk2_0)!=init)).
% 0.14/0.40 cnf(i_0_44, plain, (pv64!=pv63)).
% 0.14/0.40 cnf(i_0_99, plain, (a_select3(r_ds1_filter_init,X1,X2)=init|~leq(X2,n2)|~leq(X1,n2)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_98, plain, (a_select3(xhatmin_ds1_filter_init,X1,X2)=init|~leq(X2,n0)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_137, plain, (a_select3(pminus_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_169, plain, (a_select3(id_ds1_filter_init,X1,X2)=init|~leq(X1,pred(pv63))|~leq(X2,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_170, plain, (a_select3(id_ds1_filter_init,X1,X2)=init|~gt(pv63,X1)|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_136, plain, (a_select3(id_ds1_filter_init,pv63,X1)=init|~gt(pv64,X1)|~leq(X1,n5)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_1, plain, (a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_70, plain, (a_select3(q_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_71, plain, (a_select3(dv_ds1_filter_init,X1,X2)=init|~leq(X2,n0)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_36, plain, (a_select3(phi_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_37, plain, (a_select3(h_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n2)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 6 steps
% 0.14/0.40 cnf(i_0_5, negated_conjecture, (esk2_0!=pv64), inference(start_rule)).
% 0.14/0.40 cnf(i_0_175, plain, (esk2_0!=pv64), inference(extension_rule, [i_0_1])).
% 0.14/0.40 cnf(i_0_213, plain, (a_select3(id_ds1_filter_init,pv63,esk2_0)=init), inference(closure_rule, [i_0_2])).
% 0.14/0.40 cnf(i_0_215, plain, (~leq(esk2_0,pv64)), inference(closure_rule, [i_0_3])).
% 0.14/0.40 cnf(i_0_216, plain, (~leq(esk2_0,n5)), inference(closure_rule, [i_0_6])).
% 0.14/0.40 cnf(i_0_217, plain, (~leq(n0,esk2_0)), inference(closure_rule, [i_0_8])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done.
% 0.14/0.40 # There were 0 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 0 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 0 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_4, negated_conjecture, (esk1_0=pv63)).
% 0.14/0.40 cnf(i_0_10, negated_conjecture, (epred5_0)).
% 0.14/0.40 cnf(i_0_9, negated_conjecture, (leq(n0,pv63))).
% 0.14/0.40 cnf(i_0_171, plain, (epred4_0)).
% 0.14/0.40 cnf(i_0_138, plain, (epred3_0)).
% 0.14/0.40 cnf(i_0_8, negated_conjecture, (leq(n0,esk2_0))).
% 0.14/0.40 cnf(i_0_7, negated_conjecture, (leq(pv63,n5))).
% 0.14/0.40 cnf(i_0_3, negated_conjecture, (leq(esk2_0,pv64))).
% 0.14/0.40 cnf(i_0_6, negated_conjecture, (leq(esk2_0,n5))).
% 0.14/0.40 cnf(i_0_100, plain, (epred2_0)).
% 0.14/0.40 cnf(i_0_72, plain, (epred1_0)).
% 0.14/0.40 cnf(i_0_40, plain, (leq(pv5,n998))).
% 0.14/0.40 cnf(i_0_43, plain, (leq(n0,pv5))).
% 0.14/0.40 cnf(i_0_41, plain, (leq(n0,pv64))).
% 0.14/0.40 cnf(i_0_38, plain, (leq(pv64,n5))).
% 0.14/0.40 cnf(i_0_5, negated_conjecture, (esk2_0!=pv64)).
% 0.14/0.40 cnf(i_0_2, negated_conjecture, (a_select3(id_ds1_filter_init,pv63,esk2_0)!=init)).
% 0.14/0.40 cnf(i_0_44, plain, (pv64!=pv63)).
% 0.14/0.40 cnf(i_0_99, plain, (a_select3(r_ds1_filter_init,X1,X2)=init|~leq(X2,n2)|~leq(X1,n2)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_98, plain, (a_select3(xhatmin_ds1_filter_init,X1,X2)=init|~leq(X2,n0)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_137, plain, (a_select3(pminus_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_169, plain, (a_select3(id_ds1_filter_init,X1,X2)=init|~leq(X1,pred(pv63))|~leq(X2,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_170, plain, (a_select3(id_ds1_filter_init,X1,X2)=init|~gt(pv63,X1)|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_136, plain, (a_select3(id_ds1_filter_init,pv63,X1)=init|~gt(pv64,X1)|~leq(X1,n5)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_1, plain, (a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_70, plain, (a_select3(q_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_71, plain, (a_select3(dv_ds1_filter_init,X1,X2)=init|~leq(X2,n0)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_36, plain, (a_select3(phi_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_37, plain, (a_select3(h_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n2)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 6 steps
% 0.14/0.40 cnf(i_0_3, negated_conjecture, (leq(esk2_0,pv64)), inference(start_rule)).
% 0.14/0.40 cnf(i_0_177, plain, (leq(esk2_0,pv64)), inference(extension_rule, [i_0_1])).
% 0.14/0.40 cnf(i_0_213, plain, (a_select3(id_ds1_filter_init,pv63,esk2_0)=init), inference(closure_rule, [i_0_2])).
% 0.14/0.40 cnf(i_0_214, plain, (pv64=esk2_0), inference(closure_rule, [i_0_5])).
% 0.14/0.40 cnf(i_0_216, plain, (~leq(esk2_0,n5)), inference(closure_rule, [i_0_6])).
% 0.14/0.40 cnf(i_0_217, plain, (~leq(n0,esk2_0)), inference(closure_rule, [i_0_8])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done.
% 0.14/0.40 # There were 0 total branch saturation attempts.
% 0.14/0.40 # There were 0 of these attempts blocked.
% 0.14/0.40 # There were 0 deferred branch saturation attempts.
% 0.14/0.40 # There were 0 free duplicated saturations.
% 0.14/0.40 # There were 0 total successful branch saturations.
% 0.14/0.40 # There were 0 successful branch saturations in interreduction.
% 0.14/0.40 # There were 0 successful branch saturations on the branch.
% 0.14/0.40 # There were 0 successful branch saturations after the branch.
% 0.14/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # Begin clausification derivation
% 0.14/0.40
% 0.14/0.40 # End clausification derivation
% 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.40 cnf(i_0_4, negated_conjecture, (esk1_0=pv63)).
% 0.14/0.40 cnf(i_0_10, negated_conjecture, (epred5_0)).
% 0.14/0.40 cnf(i_0_9, negated_conjecture, (leq(n0,pv63))).
% 0.14/0.40 cnf(i_0_171, plain, (epred4_0)).
% 0.14/0.40 cnf(i_0_138, plain, (epred3_0)).
% 0.14/0.40 cnf(i_0_8, negated_conjecture, (leq(n0,esk2_0))).
% 0.14/0.40 cnf(i_0_7, negated_conjecture, (leq(pv63,n5))).
% 0.14/0.40 cnf(i_0_3, negated_conjecture, (leq(esk2_0,pv64))).
% 0.14/0.40 cnf(i_0_6, negated_conjecture, (leq(esk2_0,n5))).
% 0.14/0.40 cnf(i_0_100, plain, (epred2_0)).
% 0.14/0.40 cnf(i_0_72, plain, (epred1_0)).
% 0.14/0.40 cnf(i_0_40, plain, (leq(pv5,n998))).
% 0.14/0.40 cnf(i_0_43, plain, (leq(n0,pv5))).
% 0.14/0.40 cnf(i_0_41, plain, (leq(n0,pv64))).
% 0.14/0.40 cnf(i_0_38, plain, (leq(pv64,n5))).
% 0.14/0.40 cnf(i_0_5, negated_conjecture, (esk2_0!=pv64)).
% 0.14/0.40 cnf(i_0_2, negated_conjecture, (a_select3(id_ds1_filter_init,pv63,esk2_0)!=init)).
% 0.14/0.40 cnf(i_0_44, plain, (pv64!=pv63)).
% 0.14/0.40 cnf(i_0_99, plain, (a_select3(r_ds1_filter_init,X1,X2)=init|~leq(X2,n2)|~leq(X1,n2)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_98, plain, (a_select3(xhatmin_ds1_filter_init,X1,X2)=init|~leq(X2,n0)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_137, plain, (a_select3(pminus_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_169, plain, (a_select3(id_ds1_filter_init,X1,X2)=init|~leq(X1,pred(pv63))|~leq(X2,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_170, plain, (a_select3(id_ds1_filter_init,X1,X2)=init|~gt(pv63,X1)|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_136, plain, (a_select3(id_ds1_filter_init,pv63,X1)=init|~gt(pv64,X1)|~leq(X1,n5)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_1, plain, (a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_70, plain, (a_select3(q_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_71, plain, (a_select3(dv_ds1_filter_init,X1,X2)=init|~leq(X2,n0)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_36, plain, (a_select3(phi_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 cnf(i_0_37, plain, (a_select3(h_ds1_filter_init,X1,X2)=init|~leq(X2,n5)|~leq(X1,n2)|~leq(n0,X2)|~leq(n0,X1))).
% 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.40 # Begin printing tableau
% 0.14/0.40 # Found 6 steps
% 0.14/0.40 cnf(i_0_2, negated_conjecture, (a_select3(id_ds1_filter_init,pv63,esk2_0)!=init), inference(start_rule)).
% 0.14/0.40 cnf(i_0_174, plain, (a_select3(id_ds1_filter_init,pv63,esk2_0)!=init), inference(extension_rule, [i_0_1])).
% 0.14/0.40 cnf(i_0_919, plain, (pv64=esk2_0), inference(closure_rule, [i_0_5])).
% 0.14/0.40 cnf(i_0_920, plain, (~leq(esk2_0,pv64)), inference(closure_rule, [i_0_3])).
% 0.14/0.40 cnf(i_0_921, plain, (~leq(esk2_0,n5)), inference(closure_rule, [i_0_6])).
% 0.14/0.40 cnf(i_0_922, plain, (~leq(n0,esk2_0)), inference(closure_rule, [i_0_8])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # Child (11731) has found a proof.
% 0.14/0.40
% 0.14/0.40 # Proof search is over...
% 0.14/0.40 # Freeing feature tree
%------------------------------------------------------------------------------