%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS128+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 : n024.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:37 EDT 2022 % Result : Unsatisfiable 0.18s 0.38s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 13:37:34 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.38 # No SInE strategy applied % 0.18/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.38 # % 0.18/0.38 # Presaturation interreduction done % 0.18/0.38 # Number of axioms: 28 Number of unprocessed: 28 % 0.18/0.38 # Tableaux proof search. % 0.18/0.38 # APR header successfully linked. % 0.18/0.38 # Hello from C++ % 0.18/0.38 # The folding up rule is enabled... % 0.18/0.38 # Local unification is enabled... % 0.18/0.38 # Any saturation attempts will use folding labels... % 0.18/0.38 # 28 beginning clauses after preprocessing and clausification % 0.18/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.18/0.38 # No conjectures. % 0.18/0.38 # There are 28 start rule candidates: % 0.18/0.38 # Found 2 unit axioms. % 0.18/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.38 # 28 start rule tableaux created. % 0.18/0.38 # 26 extension rule candidate clauses % 0.18/0.38 # 2 unit axiom clauses % 0.18/0.38 % 0.18/0.38 # Requested 8, 32 cores available to the main process. % 0.18/0.38 # There were 2 total branch saturation attempts. % 0.18/0.38 # There were 0 of these attempts blocked. % 0.18/0.38 # There were 0 deferred branch saturation attempts. % 0.18/0.38 # There were 0 free duplicated saturations. % 0.18/0.38 # There were 2 total successful branch saturations. % 0.18/0.38 # There were 0 successful branch saturations in interreduction. % 0.18/0.38 # There were 0 successful branch saturations on the branch. % 0.18/0.38 # There were 2 successful branch saturations after the branch. % 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.38 # Begin clausification derivation % 0.18/0.38 % 0.18/0.38 # End clausification derivation % 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.38 cnf(i_0_29, plain, (cUnsatisfiable(i2003_11_14_17_22_31584))). % 0.18/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))). % 0.18/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))). % 0.18/0.38 cnf(i_0_27, plain, (cexcomp(X1)|~ca_Cx4xcomp(X1))). % 0.18/0.38 cnf(i_0_28, plain, (cd(X1)|~ca_Cx4xcomp(X1))). % 0.18/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))). % 0.18/0.38 cnf(i_0_13, plain, (cdxcomp(X1)|~cc(X1))). % 0.18/0.38 cnf(i_0_25, plain, (~ca_Cx4xcomp(X1)|~ra_Px4(X1,X2))). % 0.18/0.38 cnf(i_0_17, plain, (~ra_Px2(X1,X2)|~cdxcomp(X1))). % 0.18/0.38 cnf(i_0_19, plain, (~ra_Px1(X1,X2)|~ce(X1))). % 0.18/0.38 cnf(i_0_20, plain, (cexcomp(X1)|~ra_Px1(X1,X2))). % 0.18/0.38 cnf(i_0_11, plain, (cexcomp(esk1_1(X1))|~cUnsatisfiable(X1))). % 0.18/0.38 cnf(i_0_14, plain, (cd(X1)|~ra_Px2(X1,X2))). % 0.18/0.38 cnf(i_0_22, plain, (ca_Cx4(X1)|~ra_Px4(X1,X2))). % 0.18/0.38 cnf(i_0_26, plain, (ca_Cx4xcomp(X1)|~cd(X1)|~cexcomp(X1))). % 0.18/0.38 cnf(i_0_12, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.18/0.38 cnf(i_0_16, plain, (ra_Px2(X1,esk5_1(X1))|cdxcomp(X1))). % 0.18/0.38 cnf(i_0_18, plain, (ra_Px1(X1,esk6_1(X1))|ce(X1))). % 0.18/0.38 cnf(i_0_10, plain, (cd(X1)|~rr(X2,X1)|~cUnsatisfiable(X2))). % 0.18/0.38 cnf(i_0_9, plain, (ca_Cx4(X1)|~rr(X2,X1)|~cUnsatisfiable(X2))). % 0.18/0.38 cnf(i_0_15, plain, (ra_Px2(X1,esk4_1(X1))|~cd(X1))). % 0.18/0.38 cnf(i_0_21, plain, (ra_Px1(X1,esk7_1(X1))|~cexcomp(X1))). % 0.18/0.38 cnf(i_0_24, plain, (ca_Cx4xcomp(X1)|ra_Px4(X1,esk9_1(X1)))). % 0.18/0.38 cnf(i_0_23, plain, (ra_Px4(X1,esk8_1(X1))|~ca_Cx4(X1))). % 0.18/0.38 cnf(i_0_5, plain, (cUnsatisfiable(X1)|~ca_Cx4(esk3_1(X1))|~cd(esk2_1(X1))|~cexcomp(X2)|~rr(X1,X2))). % 0.18/0.38 cnf(i_0_7, plain, (rr(X1,esk2_1(X1))|cUnsatisfiable(X1)|~ca_Cx4(esk3_1(X1))|~cexcomp(X2)|~rr(X1,X2))). % 0.18/0.38 cnf(i_0_6, plain, (rr(X1,esk3_1(X1))|cUnsatisfiable(X1)|~cd(esk2_1(X1))|~cexcomp(X2)|~rr(X1,X2))). % 0.18/0.38 cnf(i_0_8, plain, (rr(X1,esk3_1(X1))|rr(X1,esk2_1(X1))|cUnsatisfiable(X1)|~cexcomp(X2)|~rr(X1,X2))). % 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.38 # Begin printing tableau % 0.18/0.38 # Found 5 steps % 0.18/0.38 cnf(i_0_29, plain, (cUnsatisfiable(i2003_11_14_17_22_31584)), inference(start_rule)). % 0.18/0.38 cnf(i_0_30, plain, (cUnsatisfiable(i2003_11_14_17_22_31584)), inference(extension_rule, [i_0_11])). % 0.18/0.38 cnf(i_0_117, plain, (cexcomp(esk1_1(i2003_11_14_17_22_31584))), inference(extension_rule, [i_0_26])). % 0.18/0.38 cnf(i_0_141, plain, (ca_Cx4xcomp(esk1_1(i2003_11_14_17_22_31584))), inference(etableau_closure_rule, [i_0_141, ...])). % 0.18/0.38 cnf(i_0_142, plain, (~cd(esk1_1(i2003_11_14_17_22_31584))), inference(etableau_closure_rule, [i_0_142, ...])). % 0.18/0.38 # End printing tableau % 0.18/0.38 # SZS output end % 0.18/0.38 # Branches closed with saturation will be marked with an "s" % 0.18/0.38 # Child (22902) has found a proof. % 0.18/0.38 % 0.18/0.38 # Proof search is over... % 0.18/0.38 # Freeing feature tree %------------------------------------------------------------------------------