%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS036+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.14s 0.32s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : KRS036+1 : TPTP v8.1.0. Released v3.1.0. % 0.10/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 09:44:35 EDT 2022 % 0.10/0.29 % CPUTime : % 0.14/0.32 # No SInE strategy applied % 0.14/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.14/0.32 # and selection function SelectCQIPrecWNTNp. % 0.14/0.32 # % 0.14/0.32 # Presaturation interreduction done % 0.14/0.32 # Number of axioms: 18 Number of unprocessed: 18 % 0.14/0.32 # Tableaux proof search. % 0.14/0.32 # APR header successfully linked. % 0.14/0.32 # Hello from C++ % 0.14/0.32 # The folding up rule is enabled... % 0.14/0.32 # Local unification is enabled... % 0.14/0.32 # Any saturation attempts will use folding labels... % 0.14/0.32 # 18 beginning clauses after preprocessing and clausification % 0.14/0.32 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.14/0.32 # No conjectures. % 0.14/0.32 # There are 18 start rule candidates: % 0.14/0.32 # Found 2 unit axioms. % 0.14/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.32 # 18 start rule tableaux created. % 0.14/0.32 # 16 extension rule candidate clauses % 0.14/0.32 # 2 unit axiom clauses % 0.14/0.32 % 0.14/0.32 # Requested 8, 32 cores available to the main process. % 0.14/0.32 # 9244 Satisfiable branch % 0.14/0.32 # 9248 Satisfiable branch % 0.14/0.32 # Satisfiable branch found. % 0.14/0.32 # There were 1 total branch saturation attempts. % 0.14/0.32 # There were 0 of these attempts blocked. % 0.14/0.32 # There were 0 deferred branch saturation attempts. % 0.14/0.32 # There were 0 free duplicated saturations. % 0.14/0.32 # There were 0 total successful branch saturations. % 0.14/0.32 # There were 0 successful branch saturations in interreduction. % 0.14/0.32 # There were 0 successful branch saturations on the branch. % 0.14/0.32 # There were 0 successful branch saturations after the branch. % 0.14/0.32 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # Begin clausification derivation % 0.14/0.32 % 0.14/0.32 # End clausification derivation % 0.14/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.32 cnf(i_0_32, plain, (cSatisfiable(i2003_11_14_17_15_47436))). % 0.14/0.32 cnf(i_0_15, plain, (~cowlNothing(X1))). % 0.14/0.32 cnf(i_0_25, plain, (~ca(X1)|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.14/0.32 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.14/0.32 cnf(i_0_22, plain, (ca(esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_20, plain, (ca(esk3_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_27, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.14/0.32 cnf(i_0_30, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.14/0.32 cnf(i_0_33, plain, (rr(X1,X2)|~rf(X1,X2))). % 0.14/0.32 cnf(i_0_28, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.14/0.32 cnf(i_0_29, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.14/0.32 cnf(i_0_21, plain, (rinvF(X1,esk3_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_24, plain, (rinvR(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_23, plain, (rinvF(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_26, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.14/0.32 cnf(i_0_31, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))). % 0.14/0.32 cnf(i_0_19, plain, (ca(X1)|cSatisfiable(X1)|~rinvR(X1,X2)|~rinvF(X2,X3)|~rinvF(X1,X4)|~ca(X4)|~ca(X3))). % 0.14/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.32 # Begin printing tableau % 0.14/0.32 # Found 9 steps % 0.14/0.32 cnf(i_0_32, plain, (cSatisfiable(i2003_11_14_17_15_47436)), inference(start_rule)). % 0.14/0.32 cnf(i_0_156, plain, (~ca(X6)), inference(closure_rule, [i_0_0])). % 0.14/0.32 cnf(i_0_34, plain, (cSatisfiable(i2003_11_14_17_15_47436)), inference(extension_rule, [i_0_22])). % 0.14/0.32 cnf(i_0_120, plain, (ca(esk2_1(i2003_11_14_17_15_47436))), inference(extension_rule, [i_0_19])). % 0.14/0.32 cnf(i_0_151, plain, (cSatisfiable(esk1_1(i2003_11_14_17_15_47436))), inference(extension_rule, [i_0_20])). % 0.14/0.32 cnf(i_0_152, plain, (~rinvR(esk1_1(i2003_11_14_17_15_47436),X5)), inference(extension_rule, [i_0_29])). % 0.14/0.32 cnf(i_0_153, plain, (~rinvF(X5,X6)), inference(extension_rule, [i_0_27])). % 0.14/0.32 cnf(i_0_154, plain, (~rinvF(esk1_1(i2003_11_14_17_15_47436),esk2_1(i2003_11_14_17_15_47436))), inference(extension_rule, [i_0_23])). % 0.14/0.32 cnf(i_0_237, plain, (~cSatisfiable(i2003_11_14_17_15_47436)), inference(closure_rule, [i_0_32])). % 0.14/0.32 # End printing tableau % 0.14/0.32 # SZS output end % 0.14/0.32 # Branches closed with saturation will be marked with an "s" % 0.14/0.32 # Satisfiable branch found. % 0.14/0.32 # There were 1 total branch saturation attempts. % 0.14/0.32 # There were 0 of these attempts blocked. % 0.14/0.32 # There were 0 deferred branch saturation attempts. % 0.14/0.32 # There were 0 free duplicated saturations. % 0.14/0.32 # There were 0 total successful branch saturations. % 0.14/0.32 # There were 0 successful branch saturations in interreduction. % 0.14/0.32 # There were 0 successful branch saturations on the branch. % 0.14/0.32 # There were 0 successful branch saturations after the branch. % 0.14/0.32 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # Begin clausification derivation % 0.14/0.32 % 0.14/0.32 # End clausification derivation % 0.14/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.32 cnf(i_0_32, plain, (cSatisfiable(i2003_11_14_17_15_47436))). % 0.14/0.32 cnf(i_0_15, plain, (~cowlNothing(X1))). % 0.14/0.32 cnf(i_0_25, plain, (~ca(X1)|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.14/0.32 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.14/0.32 cnf(i_0_22, plain, (ca(esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_20, plain, (ca(esk3_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_27, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.14/0.32 cnf(i_0_30, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.14/0.32 cnf(i_0_33, plain, (rr(X1,X2)|~rf(X1,X2))). % 0.14/0.32 cnf(i_0_28, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.14/0.32 cnf(i_0_29, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.14/0.32 cnf(i_0_21, plain, (rinvF(X1,esk3_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_24, plain, (rinvR(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_23, plain, (rinvF(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))). % 0.14/0.32 cnf(i_0_26, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.14/0.32 cnf(i_0_31, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))). % 0.14/0.32 cnf(i_0_19, plain, (ca(X1)|cSatisfiable(X1)|~rinvR(X1,X2)|~rinvF(X2,X3)|~rinvF(X1,X4)|~ca(X4)|~ca(X3))). % 0.14/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.32 # Begin printing tableau % 0.14/0.32 # Found 4 steps % 0.14/0.32 cnf(i_0_21, plain, (rinvF(i2003_11_14_17_15_47436,esk3_1(i2003_11_14_17_15_47436))|~cSatisfiable(i2003_11_14_17_15_47436)), inference(start_rule)). % 0.14/0.32 cnf(i_0_57, plain, (~cSatisfiable(i2003_11_14_17_15_47436)), inference(closure_rule, [i_0_32])). % 0.14/0.32 cnf(i_0_56, plain, (rinvF(i2003_11_14_17_15_47436,esk3_1(i2003_11_14_17_15_47436))), inference(extension_rule, [i_0_28])). % 0.14/0.32 cnf(i_0_130, plain, (rf(esk3_1(i2003_11_14_17_15_47436),i2003_11_14_17_15_47436)), inference(extension_rule, [i_0_33])). % 0.14/0.32 # End printing tableau % 0.14/0.32 # SZS output end % 0.14/0.32 # Branches closed with saturation will be marked with an "s" % 0.14/0.32 # Child (9244) has found a proof. % 0.14/0.32 % 0.14/0.32 # Proof search is over... % 0.14/0.32 # Freeing feature tree %------------------------------------------------------------------------------