%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS104+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 : n029.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:33 EDT 2022 % Result : Unsatisfiable 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS104+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/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 : n029.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 09:22:35 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 50 Number of unprocessed: 50 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 50 beginning clauses after preprocessing and clausification % 0.12/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.12/0.37 # No conjectures. % 0.12/0.37 # There are 50 start rule candidates: % 0.12/0.37 # Found 2 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 50 start rule tableaux created. % 0.12/0.37 # 48 extension rule candidate clauses % 0.12/0.37 # 2 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_51, plain, (cUnsatisfiable(i2003_11_14_17_20_50869))). % 0.12/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))). % 0.12/0.38 cnf(i_0_10, plain, (ca_Cx7(X1)|~cUnsatisfiablexcomp(X1))). % 0.12/0.38 cnf(i_0_9, plain, (ca_Cx8(X1)|~cUnsatisfiablexcomp(X1))). % 0.12/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))). % 0.12/0.38 cnf(i_0_8, plain, (ca_Cx6(X1)|~cUnsatisfiablexcomp(X1))). % 0.12/0.38 cnf(i_0_6, plain, (~ra_Px5(X1,X2)|~cUnsatisfiable(X1))). % 0.12/0.38 cnf(i_0_45, plain, (~ra_Px8(X1,X2)|~ca_Cx8(X1))). % 0.12/0.38 cnf(i_0_31, plain, (~ra_Px6(X1,X2)|~ca_Cx6(X1))). % 0.12/0.38 cnf(i_0_22, plain, (~ra_Px2(X1,X2)|~ccxcomp(X1))). % 0.12/0.38 cnf(i_0_34, plain, (ca(X1)|~ca_Cx6xcomp(X1))). % 0.12/0.38 cnf(i_0_49, plain, (cb(X1)|~ca_Cx8xcomp(X1))). % 0.12/0.38 cnf(i_0_24, plain, (ccxcomp(X1)|~ca_Cx1(X1))). % 0.12/0.38 cnf(i_0_16, plain, (ccxcomp(X1)|~cb(X1))). % 0.12/0.38 cnf(i_0_25, plain, (cbxcomp(X1)|~ca_Cx1(X1))). % 0.12/0.38 cnf(i_0_40, plain, (ca(X1)|~ca_Cx7xcomp(X1))). % 0.12/0.38 cnf(i_0_13, plain, (ca_Cx1(X1)|~ca(X1))). % 0.12/0.38 cnf(i_0_18, plain, (~cbxcomp(X1)|~ra_Px3(X1,X2))). % 0.12/0.38 cnf(i_0_29, plain, (~ca_Cx1xcomp(X1)|~ra_Px1(X1,X2))). % 0.12/0.38 cnf(i_0_43, plain, (~ca_Cx7xcomp(X1)|~ra_Px7(X1,X2))). % 0.12/0.38 cnf(i_0_33, plain, (cb(X1)|~ca_Cx6xcomp(X1))). % 0.12/0.38 cnf(i_0_41, plain, (cc(X1)|~ca_Cx7xcomp(X1))). % 0.12/0.38 cnf(i_0_50, plain, (cc(X1)|~ca_Cx8xcomp(X1))). % 0.12/0.38 cnf(i_0_11, plain, (cUnsatisfiablexcomp(X1)|~ra_Px5(X1,X2))). % 0.12/0.38 cnf(i_0_37, plain, (ca_Cx7(X1)|~ra_Px7(X1,X2))). % 0.12/0.38 cnf(i_0_26, plain, (ca_Cx1(X1)|~ra_Px1(X1,X2))). % 0.12/0.38 cnf(i_0_23, plain, (ca_Cx1(X1)|~cbxcomp(X1)|~ccxcomp(X1))). % 0.12/0.38 cnf(i_0_14, plain, (cb(X1)|~ra_Px3(X1,X2))). % 0.12/0.38 cnf(i_0_19, plain, (cc(X1)|~ra_Px2(X1,X2))). % 0.12/0.38 cnf(i_0_35, plain, (ca_Cx6xcomp(X1)|~ra_Px6(X1,X2))). % 0.12/0.38 cnf(i_0_46, plain, (ca_Cx8xcomp(X1)|~ra_Px8(X1,X2))). % 0.12/0.38 cnf(i_0_32, plain, (ca_Cx6xcomp(X1)|~cb(X1)|~ca(X1))). % 0.12/0.38 cnf(i_0_39, plain, (ca_Cx7xcomp(X1)|~cc(X1)|~ca(X1))). % 0.12/0.38 cnf(i_0_48, plain, (ca_Cx8xcomp(X1)|~cc(X1)|~cb(X1))). % 0.12/0.38 cnf(i_0_12, plain, (ra_Px5(X1,esk2_1(X1))|~cUnsatisfiablexcomp(X1))). % 0.12/0.38 cnf(i_0_15, plain, (ra_Px3(X1,esk3_1(X1))|~cb(X1))). % 0.12/0.38 cnf(i_0_20, plain, (ra_Px2(X1,esk5_1(X1))|~cc(X1))). % 0.12/0.38 cnf(i_0_5, plain, (ra_Px5(X1,esk1_1(X1))|cUnsatisfiable(X1))). % 0.12/0.38 cnf(i_0_44, plain, (ra_Px8(X1,esk13_1(X1))|ca_Cx8(X1))). % 0.12/0.38 cnf(i_0_7, plain, (cUnsatisfiablexcomp(X1)|~ca_Cx6(X1)|~ca_Cx8(X1)|~ca_Cx7(X1))). % 0.12/0.38 cnf(i_0_27, plain, (ra_Px1(X1,esk7_1(X1))|~ca_Cx1(X1))). % 0.12/0.38 cnf(i_0_36, plain, (ra_Px6(X1,esk10_1(X1))|~ca_Cx6xcomp(X1))). % 0.12/0.38 cnf(i_0_38, plain, (ra_Px7(X1,esk11_1(X1))|~ca_Cx7(X1))). % 0.12/0.38 cnf(i_0_30, plain, (ra_Px6(X1,esk9_1(X1))|ca_Cx6(X1))). % 0.12/0.38 cnf(i_0_47, plain, (ra_Px8(X1,esk14_1(X1))|~ca_Cx8xcomp(X1))). % 0.12/0.38 cnf(i_0_21, plain, (ra_Px2(X1,esk6_1(X1))|ccxcomp(X1))). % 0.12/0.38 cnf(i_0_17, plain, (cbxcomp(X1)|ra_Px3(X1,esk4_1(X1)))). % 0.12/0.38 cnf(i_0_28, plain, (ca_Cx1xcomp(X1)|ra_Px1(X1,esk8_1(X1)))). % 0.12/0.38 cnf(i_0_42, plain, (ca_Cx7xcomp(X1)|ra_Px7(X1,esk12_1(X1)))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 4 steps % 0.12/0.38 cnf(i_0_51, plain, (cUnsatisfiable(i2003_11_14_17_20_50869)), inference(start_rule)). % 0.12/0.38 cnf(i_0_52, plain, (cUnsatisfiable(i2003_11_14_17_20_50869)), inference(extension_rule, [i_0_6])). % 0.12/0.38 cnf(i_0_166, plain, (~ra_Px5(i2003_11_14_17_20_50869,esk2_1(i2003_11_14_17_20_50869))), inference(extension_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_237, plain, (~cUnsatisfiablexcomp(i2003_11_14_17_20_50869)), inference(etableau_closure_rule, [i_0_237, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (7420) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------