%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS073+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:28 EDT 2022 % Result : Unsatisfiable 0.15s 0.34s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : KRS073+1 : TPTP v8.1.0. Released v3.1.0. % 0.00/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Tue Jun 7 11:58:05 EDT 2022 % 0.10/0.30 % CPUTime : % 0.15/0.33 # No SInE strategy applied % 0.15/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.15/0.33 # and selection function SelectUnlessUniqMax. % 0.15/0.33 # % 0.15/0.33 # Presaturation interreduction done % 0.15/0.33 # Number of axioms: 24 Number of unprocessed: 24 % 0.15/0.33 # Tableaux proof search. % 0.15/0.33 # APR header successfully linked. % 0.15/0.33 # Hello from C++ % 0.15/0.33 # The folding up rule is enabled... % 0.15/0.33 # Local unification is enabled... % 0.15/0.33 # Any saturation attempts will use folding labels... % 0.15/0.33 # 24 beginning clauses after preprocessing and clausification % 0.15/0.33 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.15/0.33 # No conjectures. % 0.15/0.33 # There are 24 start rule candidates: % 0.15/0.33 # Found 2 unit axioms. % 0.15/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.33 # 24 start rule tableaux created. % 0.15/0.33 # 22 extension rule candidate clauses % 0.15/0.33 # 2 unit axiom clauses % 0.15/0.33 % 0.15/0.33 # Requested 8, 32 cores available to the main process. % 0.15/0.34 # There were 1 total branch saturation attempts. % 0.15/0.34 # There were 0 of these attempts blocked. % 0.15/0.34 # There were 0 deferred branch saturation attempts. % 0.15/0.34 # There were 0 free duplicated saturations. % 0.15/0.34 # There were 1 total successful branch saturations. % 0.15/0.34 # There were 0 successful branch saturations in interreduction. % 0.15/0.34 # There were 0 successful branch saturations on the branch. % 0.15/0.34 # There were 1 successful branch saturations after the branch. % 0.15/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.34 # Begin clausification derivation % 0.15/0.34 % 0.15/0.34 # End clausification derivation % 0.15/0.34 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.34 cnf(i_0_41, plain, (cUnsatisfiable(i2003_11_14_17_18_54369))). % 0.15/0.34 cnf(i_0_19, plain, (~cowlNothing(X1))). % 0.15/0.34 cnf(i_0_27, plain, (~cp(X1)|~cUnsatisfiable(X1))). % 0.15/0.34 cnf(i_0_22, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.15/0.34 cnf(i_0_21, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.15/0.34 cnf(i_0_31, plain, (rf(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.15/0.34 cnf(i_0_35, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.15/0.34 cnf(i_0_43, plain, (rf(X1,X2)|~rs(X1,X2))). % 0.15/0.34 cnf(i_0_37, plain, (rf1(X1,X2)|~rinvF1(X2,X1))). % 0.15/0.34 cnf(i_0_39, plain, (rs(X1,X2)|~rinvS(X2,X1))). % 0.15/0.34 cnf(i_0_42, plain, (rf1(X1,X2)|~rs(X1,X2))). % 0.15/0.34 cnf(i_0_34, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.15/0.34 cnf(i_0_36, plain, (rinvF1(X1,X2)|~rf1(X2,X1))). % 0.15/0.34 cnf(i_0_38, plain, (rinvS(X1,X2)|~rs(X2,X1))). % 0.15/0.34 cnf(i_0_30, plain, (cp(X1)|~rinvS(esk1_1(X2),X1)|~cUnsatisfiable(X2))). % 0.15/0.34 cnf(i_0_32, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.15/0.34 cnf(i_0_33, plain, (X1=X2|~rf1(X3,X2)|~rf1(X3,X1))). % 0.15/0.34 cnf(i_0_40, plain, (X1=X2|~rs(X3,X2)|~rs(X3,X1))). % 0.15/0.34 cnf(i_0_28, plain, (cp(esk2_2(X1,X2))|~rinvF(esk1_1(X1),X2)|~cUnsatisfiable(X1))). % 0.15/0.34 cnf(i_0_29, plain, (rs(X1,esk2_2(X2,X1))|~rinvF(esk1_1(X2),X1)|~cUnsatisfiable(X2))). % 0.15/0.34 cnf(i_0_23, plain, (cp(X1)|cUnsatisfiable(X1)|~rs(esk4_2(X1,X2),X3)|~rf(X1,X2)|~cp(esk3_2(X1,X2))|~cp(X3))). % 0.15/0.34 cnf(i_0_24, plain, (rinvF(X1,esk4_2(X2,X1))|cp(X2)|cUnsatisfiable(X2)|~rf(X2,X1)|~cp(esk3_2(X2,X1)))). % 0.15/0.34 cnf(i_0_26, plain, (rinvS(X1,esk3_2(X2,X1))|rinvF(X1,esk4_2(X2,X1))|cp(X2)|cUnsatisfiable(X2)|~rf(X2,X1))). % 0.15/0.34 cnf(i_0_25, plain, (rinvS(X1,esk3_2(X2,X1))|cp(X2)|cUnsatisfiable(X2)|~rs(esk4_2(X2,X1),X3)|~rf(X2,X1)|~cp(X3))). % 0.15/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.34 # Begin printing tableau % 0.15/0.34 # Found 6 steps % 0.15/0.34 cnf(i_0_27, plain, (~cp(i2003_11_14_17_18_54369)|~cUnsatisfiable(i2003_11_14_17_18_54369)), inference(start_rule)). % 0.15/0.34 cnf(i_0_47, plain, (~cUnsatisfiable(i2003_11_14_17_18_54369)), inference(closure_rule, [i_0_41])). % 0.15/0.34 cnf(i_0_46, plain, (~cp(i2003_11_14_17_18_54369)), inference(extension_rule, [i_0_30])). % 0.15/0.34 cnf(i_0_136, plain, (~cUnsatisfiable(i2003_11_14_17_18_54369)), inference(closure_rule, [i_0_41])). % 0.15/0.34 cnf(i_0_135, plain, (~rinvS(esk1_1(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369)), inference(extension_rule, [i_0_38])). % 0.15/0.34 cnf(i_0_160, plain, (~rs(i2003_11_14_17_18_54369,esk1_1(i2003_11_14_17_18_54369))), inference(etableau_closure_rule, [i_0_160, ...])). % 0.15/0.34 # End printing tableau % 0.15/0.34 # SZS output end % 0.15/0.34 # Branches closed with saturation will be marked with an "s" % 0.15/0.34 # There were 1 total branch saturation attempts. % 0.15/0.34 # There were 0 of these attempts blocked. % 0.15/0.34 # There were 0 deferred branch saturation attempts. % 0.15/0.34 # There were 0 free duplicated saturations. % 0.15/0.34 # There were 1 total successful branch saturations. % 0.15/0.34 # There were 0 successful branch saturations in interreduction. % 0.15/0.34 # There were 0 successful branch saturations on the branch. % 0.15/0.34 # There were 1 successful branch saturations after the branch. % 0.15/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.34 # Begin clausification derivation % 0.15/0.34 % 0.15/0.34 # End clausification derivation % 0.15/0.34 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.34 cnf(i_0_41, plain, (cUnsatisfiable(i2003_11_14_17_18_54369))). % 0.15/0.34 cnf(i_0_19, plain, (~cowlNothing(X1))). % 0.15/0.34 cnf(i_0_27, plain, (~cp(X1)|~cUnsatisfiable(X1))). % 0.15/0.34 cnf(i_0_22, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.15/0.34 cnf(i_0_21, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.15/0.34 cnf(i_0_31, plain, (rf(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.15/0.34 cnf(i_0_35, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.15/0.34 cnf(i_0_43, plain, (rf(X1,X2)|~rs(X1,X2))). % 0.15/0.34 cnf(i_0_37, plain, (rf1(X1,X2)|~rinvF1(X2,X1))). % 0.15/0.34 cnf(i_0_39, plain, (rs(X1,X2)|~rinvS(X2,X1))). % 0.15/0.34 cnf(i_0_42, plain, (rf1(X1,X2)|~rs(X1,X2))). % 0.15/0.34 cnf(i_0_34, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.15/0.34 cnf(i_0_36, plain, (rinvF1(X1,X2)|~rf1(X2,X1))). % 0.15/0.34 cnf(i_0_38, plain, (rinvS(X1,X2)|~rs(X2,X1))). % 0.15/0.34 cnf(i_0_30, plain, (cp(X1)|~rinvS(esk1_1(X2),X1)|~cUnsatisfiable(X2))). % 0.15/0.34 cnf(i_0_32, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.15/0.34 cnf(i_0_33, plain, (X1=X2|~rf1(X3,X2)|~rf1(X3,X1))). % 0.15/0.34 cnf(i_0_40, plain, (X1=X2|~rs(X3,X2)|~rs(X3,X1))). % 0.15/0.34 cnf(i_0_28, plain, (cp(esk2_2(X1,X2))|~rinvF(esk1_1(X1),X2)|~cUnsatisfiable(X1))). % 0.15/0.34 cnf(i_0_29, plain, (rs(X1,esk2_2(X2,X1))|~rinvF(esk1_1(X2),X1)|~cUnsatisfiable(X2))). % 0.15/0.34 cnf(i_0_23, plain, (cp(X1)|cUnsatisfiable(X1)|~rs(esk4_2(X1,X2),X3)|~rf(X1,X2)|~cp(esk3_2(X1,X2))|~cp(X3))). % 0.15/0.34 cnf(i_0_24, plain, (rinvF(X1,esk4_2(X2,X1))|cp(X2)|cUnsatisfiable(X2)|~rf(X2,X1)|~cp(esk3_2(X2,X1)))). % 0.15/0.34 cnf(i_0_26, plain, (rinvS(X1,esk3_2(X2,X1))|rinvF(X1,esk4_2(X2,X1))|cp(X2)|cUnsatisfiable(X2)|~rf(X2,X1))). % 0.15/0.34 cnf(i_0_25, plain, (rinvS(X1,esk3_2(X2,X1))|cp(X2)|cUnsatisfiable(X2)|~rs(esk4_2(X2,X1),X3)|~rf(X2,X1)|~cp(X3))). % 0.15/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.34 # Begin printing tableau % 0.15/0.34 # Found 5 steps % 0.15/0.34 cnf(i_0_41, plain, (cUnsatisfiable(i2003_11_14_17_18_54369)), inference(start_rule)). % 0.15/0.34 cnf(i_0_44, plain, (cUnsatisfiable(i2003_11_14_17_18_54369)), inference(extension_rule, [i_0_27])). % 0.15/0.34 cnf(i_0_110, plain, (~cp(i2003_11_14_17_18_54369)), inference(extension_rule, [i_0_30])). % 0.15/0.34 cnf(i_0_136, plain, (~cUnsatisfiable(i2003_11_14_17_18_54369)), inference(closure_rule, [i_0_41])). % 0.15/0.34 cnf(i_0_135, plain, (~rinvS(esk1_1(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369)), inference(etableau_closure_rule, [i_0_135, ...])). % 0.15/0.34 # End printing tableau % 0.15/0.34 # SZS output end % 0.15/0.34 # Branches closed with saturation will be marked with an "s" % 0.15/0.34 # Child (20947) has found a proof. % 0.15/0.34 % 0.15/0.34 # Proof search is over... % 0.15/0.34 # Freeing feature tree %------------------------------------------------------------------------------