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