%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS042+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 : n032.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 03:00:23 EDT 2022 % Result : Satisfiable 0.15s 0.33s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.09 % Problem : KRS042+1 : TPTP v8.1.0. Released v3.1.0. % 0.06/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.29 % Computer : n032.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 600 % 0.10/0.29 % DateTime : Tue Jun 7 05:39:35 EDT 2022 % 0.10/0.29 % CPUTime : % 0.15/0.32 # No SInE strategy applied % 0.15/0.32 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.15/0.32 # and selection function SelectNewComplexAHP. % 0.15/0.32 # % 0.15/0.32 # Presaturation interreduction done % 0.15/0.32 # Number of axioms: 33 Number of unprocessed: 33 % 0.15/0.32 # Tableaux proof search. % 0.15/0.32 # APR header successfully linked. % 0.15/0.32 # Hello from C++ % 0.15/0.32 # The folding up rule is enabled... % 0.15/0.32 # Local unification is enabled... % 0.15/0.32 # Any saturation attempts will use folding labels... % 0.15/0.32 # 33 beginning clauses after preprocessing and clausification % 0.15/0.32 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.15/0.32 # No conjectures. % 0.15/0.32 # There are 33 start rule candidates: % 0.15/0.32 # Found 2 unit axioms. % 0.15/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.32 # 33 start rule tableaux created. % 0.15/0.32 # 31 extension rule candidate clauses % 0.15/0.32 # 2 unit axiom clauses % 0.15/0.32 % 0.15/0.32 # Requested 8, 32 cores available to the main process. % 0.15/0.33 # 32467 Satisfiable branch % 0.15/0.33 # 32464 Satisfiable branch % 0.15/0.33 # 32463 Satisfiable branch % 0.15/0.33 # Satisfiable branch found. % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 0 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 0 successful branch saturations after the branch. % 0.15/0.33 # 32466 Satisfiable branch % 0.15/0.33 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_58, plain, (cSatisfiable(i2003_11_14_17_16_10980))). % 0.15/0.33 cnf(i_0_33, plain, (~cowlNothing(X1))). % 0.15/0.33 cnf(i_0_36, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.15/0.33 cnf(i_0_52, plain, (~ra_Px1(X1,X2)|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_40, plain, (ca_Cx1(X1)|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_35, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.15/0.33 cnf(i_0_44, plain, (cc1(X1)|~ca_Ax2(X1))). % 0.15/0.33 cnf(i_0_45, plain, (cc2(X1)|~ca_Ax2(X1))). % 0.15/0.33 cnf(i_0_46, plain, (ca_Cx1(X1)|~ra_Px1(X1,X2))). % 0.15/0.33 cnf(i_0_43, plain, (ca_Ax2(X1)|~cc2(X1)|~cc1(X1))). % 0.15/0.33 cnf(i_0_48, plain, (ca_Cx1xcomp(X1)|~rrx3a(X1,X2)|~ca_Ax2(X2))). % 0.15/0.33 cnf(i_0_49, plain, (ca_Ax2(esk4_1(X1))|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_41, plain, (cc1(esk1_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_38, plain, (cc2(esk2_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_42, plain, (rrx3a(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_50, plain, (rrx3a(X1,esk4_1(X1))|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_51, plain, (ra_Px1(X1,esk5_1(X1))|ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_61, plain, (rrx(X1,X2)|~rrx3(X1,X2))). % 0.15/0.33 cnf(i_0_60, plain, (rrx(X1,X2)|~rrx4(X1,X2))). % 0.15/0.33 cnf(i_0_64, plain, (rrx1(X1,X2)|~rrx3(X1,X2))). % 0.15/0.33 cnf(i_0_59, plain, (rrx1a(X1,X2)|~rrx3a(X1,X2))). % 0.15/0.33 cnf(i_0_66, plain, (rrx2(X1,X2)|~rrx4(X1,X2))). % 0.15/0.33 cnf(i_0_65, plain, (rrx2a(X1,X2)|~rrx4a(X1,X2))). % 0.15/0.33 cnf(i_0_63, plain, (rrxa(X1,X2)|~rrx3a(X1,X2))). % 0.15/0.33 cnf(i_0_62, plain, (rrxa(X1,X2)|~rrx4a(X1,X2))). % 0.15/0.33 cnf(i_0_47, plain, (ra_Px1(X1,esk3_1(X1))|~ca_Cx1(X1))). % 0.15/0.33 cnf(i_0_39, plain, (rrx4a(X1,esk2_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_53, plain, (X1=X2|~rrx(X3,X2)|~rrx(X3,X1))). % 0.15/0.33 cnf(i_0_54, plain, (X1=X2|~rrx3(X3,X2)|~rrx3(X3,X1))). % 0.15/0.33 cnf(i_0_55, plain, (X1=X2|~rrx3a(X3,X2)|~rrx3a(X3,X1))). % 0.15/0.33 cnf(i_0_56, plain, (X1=X2|~rrx4(X3,X2)|~rrx4(X3,X1))). % 0.15/0.33 cnf(i_0_57, plain, (X1=X2|~rrx4a(X3,X2)|~rrx4a(X3,X1))). % 0.15/0.33 cnf(i_0_37, plain, (cSatisfiable(X1)|~rrx4a(X1,X2)|~rrx3a(X1,X3)|~cc2(X2)|~cc1(X3)|~ca_Cx1(X1))). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 4 steps % 0.15/0.33 cnf(i_0_40, plain, (ca_Cx1(i2003_11_14_17_16_10980)|~cSatisfiable(i2003_11_14_17_16_10980)), inference(start_rule)). % 0.15/0.33 cnf(i_0_74, plain, (~cSatisfiable(i2003_11_14_17_16_10980)), inference(closure_rule, [i_0_58])). % 0.15/0.33 cnf(i_0_73, plain, (ca_Cx1(i2003_11_14_17_16_10980)), inference(extension_rule, [i_0_47])). % 0.15/0.33 cnf(i_0_190, plain, (ra_Px1(i2003_11_14_17_16_10980,esk3_1(i2003_11_14_17_16_10980))), inference(extension_rule, [i_0_52])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # Satisfiable branch found. % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 0 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 0 successful branch saturations after the branch. % 0.15/0.33 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_58, plain, (cSatisfiable(i2003_11_14_17_16_10980))). % 0.15/0.33 cnf(i_0_33, plain, (~cowlNothing(X1))). % 0.15/0.33 cnf(i_0_36, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.15/0.33 cnf(i_0_52, plain, (~ra_Px1(X1,X2)|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_40, plain, (ca_Cx1(X1)|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_35, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.15/0.33 cnf(i_0_44, plain, (cc1(X1)|~ca_Ax2(X1))). % 0.15/0.33 cnf(i_0_45, plain, (cc2(X1)|~ca_Ax2(X1))). % 0.15/0.33 cnf(i_0_46, plain, (ca_Cx1(X1)|~ra_Px1(X1,X2))). % 0.15/0.33 cnf(i_0_43, plain, (ca_Ax2(X1)|~cc2(X1)|~cc1(X1))). % 0.15/0.33 cnf(i_0_48, plain, (ca_Cx1xcomp(X1)|~rrx3a(X1,X2)|~ca_Ax2(X2))). % 0.15/0.33 cnf(i_0_49, plain, (ca_Ax2(esk4_1(X1))|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_41, plain, (cc1(esk1_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_38, plain, (cc2(esk2_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_42, plain, (rrx3a(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_50, plain, (rrx3a(X1,esk4_1(X1))|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_51, plain, (ra_Px1(X1,esk5_1(X1))|ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_61, plain, (rrx(X1,X2)|~rrx3(X1,X2))). % 0.15/0.33 cnf(i_0_60, plain, (rrx(X1,X2)|~rrx4(X1,X2))). % 0.15/0.33 cnf(i_0_64, plain, (rrx1(X1,X2)|~rrx3(X1,X2))). % 0.15/0.33 cnf(i_0_59, plain, (rrx1a(X1,X2)|~rrx3a(X1,X2))). % 0.15/0.33 cnf(i_0_66, plain, (rrx2(X1,X2)|~rrx4(X1,X2))). % 0.15/0.33 cnf(i_0_65, plain, (rrx2a(X1,X2)|~rrx4a(X1,X2))). % 0.15/0.33 cnf(i_0_63, plain, (rrxa(X1,X2)|~rrx3a(X1,X2))). % 0.15/0.33 cnf(i_0_62, plain, (rrxa(X1,X2)|~rrx4a(X1,X2))). % 0.15/0.33 cnf(i_0_47, plain, (ra_Px1(X1,esk3_1(X1))|~ca_Cx1(X1))). % 0.15/0.33 cnf(i_0_39, plain, (rrx4a(X1,esk2_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_53, plain, (X1=X2|~rrx(X3,X2)|~rrx(X3,X1))). % 0.15/0.33 cnf(i_0_54, plain, (X1=X2|~rrx3(X3,X2)|~rrx3(X3,X1))). % 0.15/0.33 cnf(i_0_55, plain, (X1=X2|~rrx3a(X3,X2)|~rrx3a(X3,X1))). % 0.15/0.33 cnf(i_0_56, plain, (X1=X2|~rrx4(X3,X2)|~rrx4(X3,X1))). % 0.15/0.33 cnf(i_0_57, plain, (X1=X2|~rrx4a(X3,X2)|~rrx4a(X3,X1))). % 0.15/0.33 cnf(i_0_37, plain, (cSatisfiable(X1)|~rrx4a(X1,X2)|~rrx3a(X1,X3)|~cc2(X2)|~cc1(X3)|~ca_Cx1(X1))). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 6 steps % 0.15/0.33 cnf(i_0_43, plain, (ca_Ax2(esk1_1(i2003_11_14_17_16_10980))|~cc2(esk1_1(i2003_11_14_17_16_10980))|~cc1(esk1_1(i2003_11_14_17_16_10980))), inference(start_rule)). % 0.15/0.33 cnf(i_0_83, plain, (ca_Ax2(esk1_1(i2003_11_14_17_16_10980))), inference(extension_rule, [i_0_48])). % 0.15/0.33 cnf(i_0_232, plain, (ca_Cx1xcomp(i2003_11_14_17_16_10980)), inference(extension_rule, [i_0_52])). % 0.15/0.33 cnf(i_0_237, plain, (~ra_Px1(i2003_11_14_17_16_10980,esk3_1(i2003_11_14_17_16_10980))), inference(extension_rule, [i_0_47])). % 0.15/0.33 cnf(i_0_233, plain, (~rrx3a(i2003_11_14_17_16_10980,esk1_1(i2003_11_14_17_16_10980))), inference(extension_rule, [i_0_42])). % 0.15/0.33 cnf(i_0_306, plain, (~cSatisfiable(i2003_11_14_17_16_10980)), inference(closure_rule, [i_0_58])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # 32465 Satisfiable branch % 0.15/0.33 # Satisfiable branch found. % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 0 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 0 successful branch saturations after the branch. % 0.15/0.33 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_58, plain, (cSatisfiable(i2003_11_14_17_16_10980))). % 0.15/0.33 cnf(i_0_33, plain, (~cowlNothing(X1))). % 0.15/0.33 cnf(i_0_36, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.15/0.33 cnf(i_0_52, plain, (~ra_Px1(X1,X2)|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_40, plain, (ca_Cx1(X1)|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_35, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.15/0.33 cnf(i_0_44, plain, (cc1(X1)|~ca_Ax2(X1))). % 0.15/0.33 cnf(i_0_45, plain, (cc2(X1)|~ca_Ax2(X1))). % 0.15/0.33 cnf(i_0_46, plain, (ca_Cx1(X1)|~ra_Px1(X1,X2))). % 0.15/0.33 cnf(i_0_43, plain, (ca_Ax2(X1)|~cc2(X1)|~cc1(X1))). % 0.15/0.33 cnf(i_0_48, plain, (ca_Cx1xcomp(X1)|~rrx3a(X1,X2)|~ca_Ax2(X2))). % 0.15/0.33 cnf(i_0_49, plain, (ca_Ax2(esk4_1(X1))|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_41, plain, (cc1(esk1_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_38, plain, (cc2(esk2_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_42, plain, (rrx3a(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_50, plain, (rrx3a(X1,esk4_1(X1))|~ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_51, plain, (ra_Px1(X1,esk5_1(X1))|ca_Cx1xcomp(X1))). % 0.15/0.33 cnf(i_0_61, plain, (rrx(X1,X2)|~rrx3(X1,X2))). % 0.15/0.33 cnf(i_0_60, plain, (rrx(X1,X2)|~rrx4(X1,X2))). % 0.15/0.33 cnf(i_0_64, plain, (rrx1(X1,X2)|~rrx3(X1,X2))). % 0.15/0.33 cnf(i_0_59, plain, (rrx1a(X1,X2)|~rrx3a(X1,X2))). % 0.15/0.33 cnf(i_0_66, plain, (rrx2(X1,X2)|~rrx4(X1,X2))). % 0.15/0.33 cnf(i_0_65, plain, (rrx2a(X1,X2)|~rrx4a(X1,X2))). % 0.15/0.33 cnf(i_0_63, plain, (rrxa(X1,X2)|~rrx3a(X1,X2))). % 0.15/0.33 cnf(i_0_62, plain, (rrxa(X1,X2)|~rrx4a(X1,X2))). % 0.15/0.33 cnf(i_0_47, plain, (ra_Px1(X1,esk3_1(X1))|~ca_Cx1(X1))). % 0.15/0.33 cnf(i_0_39, plain, (rrx4a(X1,esk2_1(X1))|~cSatisfiable(X1))). % 0.15/0.33 cnf(i_0_53, plain, (X1=X2|~rrx(X3,X2)|~rrx(X3,X1))). % 0.15/0.33 cnf(i_0_54, plain, (X1=X2|~rrx3(X3,X2)|~rrx3(X3,X1))). % 0.15/0.33 cnf(i_0_55, plain, (X1=X2|~rrx3a(X3,X2)|~rrx3a(X3,X1))). % 0.15/0.33 cnf(i_0_56, plain, (X1=X2|~rrx4(X3,X2)|~rrx4(X3,X1))). % 0.15/0.33 cnf(i_0_57, plain, (X1=X2|~rrx4a(X3,X2)|~rrx4a(X3,X1))). % 0.15/0.33 cnf(i_0_37, plain, (cSatisfiable(X1)|~rrx4a(X1,X2)|~rrx3a(X1,X3)|~cc2(X2)|~cc1(X3)|~ca_Cx1(X1))). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 3 steps % 0.15/0.33 cnf(i_0_58, plain, (cSatisfiable(i2003_11_14_17_16_10980)), inference(start_rule)). % 0.15/0.33 cnf(i_0_67, plain, (cSatisfiable(i2003_11_14_17_16_10980)), inference(extension_rule, [i_0_40])). % 0.15/0.33 cnf(i_0_146, plain, (ca_Cx1(i2003_11_14_17_16_10980)), inference(extension_rule, [i_0_47])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # Child (32467) has found a proof. % 0.15/0.33 % 0.15/0.33 # Proof search is over... % 0.15/0.33 # Freeing feature tree %------------------------------------------------------------------------------