%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS100+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 : n023.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.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS100+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.13/0.34 % Computer : n023.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 7 14:49:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 15 Number of unprocessed: 15 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 15 beginning clauses after preprocessing and clausification % 0.13/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.37 # No conjectures. % 0.13/0.37 # There are 15 start rule candidates: % 0.13/0.37 # Found 2 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 15 start rule tableaux created. % 0.13/0.37 # 13 extension rule candidate clauses % 0.13/0.37 # 2 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_16, plain, (cUnsatisfiable(i2003_11_14_17_20_32704))). % 0.13/0.37 cnf(i_0_1, plain, (~cowlNothing(X1))). % 0.13/0.37 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))). % 0.13/0.37 cnf(i_0_15, plain, (~cc(X1)|~cd(X1))). % 0.13/0.37 cnf(i_0_11, plain, (~ce(esk1_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.37 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))). % 0.13/0.37 cnf(i_0_12, plain, (rr(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.13/0.37 cnf(i_0_13, plain, (cd(X1)|~rr(X2,X1)|~cUnsatisfiable(X2))). % 0.13/0.37 cnf(i_0_14, plain, (ce(X1)|~rr(X2,X1)|~cUnsatisfiable(X2))). % 0.13/0.37 cnf(i_0_7, plain, (ce(X1)|~cd(esk3_1(X2))|~ce(esk2_1(X2))|~rr(X2,X1))). % 0.13/0.37 cnf(i_0_5, plain, (cd(esk2_1(X1))|ce(X2)|~cd(esk3_1(X1))|~rr(X1,X2))). % 0.13/0.37 cnf(i_0_10, plain, (ce(X1)|rr(X2,esk3_1(X2))|rr(X2,esk2_1(X2))|~rr(X2,X1))). % 0.13/0.37 cnf(i_0_9, plain, (ce(X1)|rr(X2,esk2_1(X2))|~cd(esk3_1(X2))|~rr(X2,X1))). % 0.13/0.37 cnf(i_0_8, plain, (ce(X1)|rr(X2,esk3_1(X2))|~ce(esk2_1(X2))|~rr(X2,X1))). % 0.13/0.37 cnf(i_0_6, plain, (cd(esk2_1(X1))|ce(X2)|rr(X1,esk3_1(X1))|~rr(X1,X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_16, plain, (cUnsatisfiable(i2003_11_14_17_20_32704)), inference(start_rule)). % 0.13/0.37 cnf(i_0_17, plain, (cUnsatisfiable(i2003_11_14_17_20_32704)), inference(extension_rule, [i_0_11])). % 0.13/0.37 cnf(i_0_63, plain, (~ce(esk1_1(i2003_11_14_17_20_32704))), inference(extension_rule, [i_0_14])). % 0.13/0.37 cnf(i_0_78, plain, (~cUnsatisfiable(i2003_11_14_17_20_32704)), inference(closure_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_77, plain, (~rr(i2003_11_14_17_20_32704,esk1_1(i2003_11_14_17_20_32704))), inference(etableau_closure_rule, [i_0_77, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (8287) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------