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