%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS101+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 : n026.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:32 EDT 2022 % Result : Unsatisfiable 0.14s 0.38s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n026.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jun 7 20:56:16 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.14/0.37 # and selection function SelectNewComplexAHP. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 21 Number of unprocessed: 21 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 21 beginning clauses after preprocessing and clausification % 0.14/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.14/0.37 # No conjectures. % 0.14/0.37 # There are 21 start rule candidates: % 0.14/0.37 # Found 2 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 21 start rule tableaux created. % 0.14/0.37 # 19 extension rule candidate clauses % 0.14/0.37 # 2 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There were 7 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 7 total successful branch saturations. % 0.14/0.38 # There were 4 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 3 successful branch saturations after the branch. % 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_33, plain, (cUnsatisfiable(i2003_11_14_17_20_36582))). % 0.14/0.38 cnf(i_0_12, plain, (~cowlNothing(X1))). % 0.14/0.38 cnf(i_0_32, plain, (~cd(X1)|~cc(X1))). % 0.14/0.38 cnf(i_0_15, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.14/0.38 cnf(i_0_26, plain, (esk3_1(X1)!=esk2_1(X1)|~cUnsatisfiable(X1))). % 0.14/0.38 cnf(i_0_14, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.14/0.38 cnf(i_0_29, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.14/0.38 cnf(i_0_31, plain, (cd(X1)|~rr(X2,X1)|~cUnsatisfiable(X2))). % 0.14/0.38 cnf(i_0_28, plain, (rs(esk1_1(X1),esk2_1(X1))|~cUnsatisfiable(X1))). % 0.14/0.38 cnf(i_0_27, plain, (rs(esk1_1(X1),esk3_1(X1))|~cUnsatisfiable(X1))). % 0.14/0.38 cnf(i_0_30, plain, (X1=X2|cc(X3)|~rs(X3,X2)|~rs(X3,X1)|~rr(X4,X3)|~cUnsatisfiable(X4))). % 0.14/0.38 cnf(i_0_17, plain, (X1=X2|cUnsatisfiable(X3)|esk7_1(X3)!=esk6_1(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4)|~cd(esk4_1(X3)))). % 0.14/0.38 cnf(i_0_16, plain, (X1=X2|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4)|~cd(esk4_1(X3))|~cc(esk5_1(X3)))). % 0.14/0.38 cnf(i_0_22, plain, (X1=X2|rr(X3,esk4_1(X3))|cUnsatisfiable(X3)|esk7_1(X3)!=esk6_1(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4))). % 0.14/0.38 cnf(i_0_21, plain, (X1=X2|rr(X3,esk4_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4)|~cc(esk5_1(X3)))). % 0.14/0.38 cnf(i_0_20, plain, (X1=X2|rr(X3,esk5_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4)|~cd(esk4_1(X3)))). % 0.14/0.38 cnf(i_0_25, plain, (X1=X2|rr(X3,esk5_1(X3))|rr(X3,esk4_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4))). % 0.14/0.38 cnf(i_0_19, plain, (X1=X2|rs(esk5_1(X3),esk6_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4)|~cd(esk4_1(X3)))). % 0.14/0.38 cnf(i_0_18, plain, (X1=X2|rs(esk5_1(X3),esk7_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4)|~cd(esk4_1(X3)))). % 0.14/0.38 cnf(i_0_24, plain, (X1=X2|rs(esk5_1(X3),esk6_1(X3))|rr(X3,esk4_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4))). % 0.14/0.38 cnf(i_0_23, plain, (X1=X2|rs(esk5_1(X3),esk7_1(X3))|rr(X3,esk4_1(X3))|cUnsatisfiable(X3)|~rs(X4,X2)|~rs(X4,X1)|~rr(X3,X4))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 16 steps % 0.14/0.38 cnf(i_0_32, plain, (~cd(esk1_1(i2003_11_14_17_20_36582))|~cc(esk1_1(i2003_11_14_17_20_36582))), inference(start_rule)). % 0.14/0.38 cnf(i_0_37, plain, (~cc(esk1_1(i2003_11_14_17_20_36582))), inference(extension_rule, [i_0_30])). % 0.14/0.38 cnf(i_0_347, plain, (~cUnsatisfiable(i2003_11_14_17_20_36582)), inference(closure_rule, [i_0_33])). % 0.14/0.38 cnf(i_0_342, plain, (esk3_1(i2003_11_14_17_20_36582)=esk2_1(i2003_11_14_17_20_36582)), inference(extension_rule, [i_0_26])). % 0.14/0.38 cnf(i_0_353, plain, (~cUnsatisfiable(i2003_11_14_17_20_36582)), inference(extension_rule, [i_0_17])). % 0.14/0.38 cnf(i_0_344, plain, (~rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582))), inference(extension_rule, [i_0_28])). % 0.14/0.38 cnf(i_0_475, plain, (~cUnsatisfiable(i2003_11_14_17_20_36582)), inference(closure_rule, [i_0_33])). % 0.14/0.38 cnf(i_0_462, plain, (~rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582))), inference(closure_rule, [i_0_344])). % 0.14/0.38 cnf(i_0_463, plain, (~rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582))), inference(closure_rule, [i_0_344])). % 0.14/0.38 cnf(i_0_36, plain, (~cd(esk1_1(i2003_11_14_17_20_36582))), inference(etableau_closure_rule, [i_0_36, ...])). % 0.14/0.38 cnf(i_0_345, plain, (~rs(esk1_1(i2003_11_14_17_20_36582),esk3_1(i2003_11_14_17_20_36582))), inference(etableau_closure_rule, [i_0_345, ...])). % 0.14/0.38 cnf(i_0_346, plain, (~rr(i2003_11_14_17_20_36582,esk1_1(i2003_11_14_17_20_36582))), inference(etableau_closure_rule, [i_0_346, ...])). % 0.14/0.38 cnf(i_0_459, plain, (esk2_1(i2003_11_14_17_20_36582)=esk2_1(i2003_11_14_17_20_36582)), inference(etableau_closure_rule, [i_0_459, ...])). % 0.14/0.38 cnf(i_0_461, plain, (esk7_1(i2003_11_14_17_20_36582)!=esk6_1(i2003_11_14_17_20_36582)), inference(etableau_closure_rule, [i_0_461, ...])). % 0.14/0.38 cnf(i_0_464, plain, (~rr(i2003_11_14_17_20_36582,esk1_1(i2003_11_14_17_20_36582))), inference(etableau_closure_rule, [i_0_464, ...])). % 0.14/0.38 cnf(i_0_465, plain, (~cd(esk4_1(i2003_11_14_17_20_36582))), inference(etableau_closure_rule, [i_0_465, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # Child (32368) has found a proof. % 0.14/0.38 % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------