%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS111+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:34 EDT 2022 % Result : Unsatisfiable 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0. % 0.13/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 : n029.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 13:47:35 EDT 2022 % 0.14/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.20/0.37 # and selection function SelectCQIPrecWNTNp. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 25 Number of unprocessed: 25 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 25 beginning clauses after preprocessing and clausification % 0.20/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.20/0.37 # No conjectures. % 0.20/0.37 # There are 25 start rule candidates: % 0.20/0.37 # Found 2 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 25 start rule tableaux created. % 0.20/0.37 # 23 extension rule candidate clauses % 0.20/0.37 # 2 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_46, plain, (cUnsatisfiable(i2003_11_14_17_21_15425))). % 0.20/0.38 cnf(i_0_22, plain, (~cowlNothing(X1))). % 0.20/0.38 cnf(i_0_25, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.20/0.38 cnf(i_0_34, plain, (~ra_Px1(X1,X2)|~cp(X1))). % 0.20/0.38 cnf(i_0_35, plain, (cpxcomp(X1)|~ra_Px1(X1,X2))). % 0.20/0.38 cnf(i_0_24, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.20/0.38 cnf(i_0_27, plain, (cp(esk3_1(X1))|~cUnsatisfiable(X1))). % 0.20/0.38 cnf(i_0_40, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.20/0.38 cnf(i_0_42, plain, (rf1(X1,X2)|~rinvF1(X2,X1))). % 0.20/0.38 cnf(i_0_44, plain, (rs(X1,X2)|~rinvS(X2,X1))). % 0.20/0.38 cnf(i_0_47, plain, (rf(X1,X2)|~rs(X1,X2))). % 0.20/0.38 cnf(i_0_31, plain, (cpxcomp(esk1_1(X1))|~cUnsatisfiable(X1))). % 0.20/0.38 cnf(i_0_48, plain, (rf1(X1,X2)|~rs(X1,X2))). % 0.20/0.38 cnf(i_0_39, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.20/0.38 cnf(i_0_41, plain, (rinvF1(X1,X2)|~rf1(X2,X1))). % 0.20/0.38 cnf(i_0_43, plain, (rinvS(X1,X2)|~rs(X2,X1))). % 0.20/0.38 cnf(i_0_33, plain, (ra_Px1(X1,esk4_1(X1))|cp(X1))). % 0.20/0.38 cnf(i_0_36, plain, (ra_Px1(X1,esk5_1(X1))|~cpxcomp(X1))). % 0.20/0.38 cnf(i_0_28, plain, (rf(X1,esk3_1(X1))|~cUnsatisfiable(X1))). % 0.20/0.38 cnf(i_0_32, plain, (rf1(X1,esk1_1(X1))|~cUnsatisfiable(X1))). % 0.20/0.38 cnf(i_0_30, plain, (rs(X1,esk2_1(X1))|~cUnsatisfiable(X1))). % 0.20/0.38 cnf(i_0_37, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.20/0.38 cnf(i_0_38, plain, (X1=X2|~rf1(X3,X2)|~rf1(X3,X1))). % 0.20/0.38 cnf(i_0_45, plain, (X1=X2|~rs(X3,X2)|~rs(X3,X1))). % 0.20/0.38 cnf(i_0_26, plain, (cUnsatisfiable(X1)|~rs(X1,X2)|~rf1(X1,X3)|~rf(X1,X4)|~cpxcomp(X3)|~cp(X4))). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 5 steps % 0.20/0.38 cnf(i_0_27, plain, (cp(esk3_1(i2003_11_14_17_21_15425))|~cUnsatisfiable(i2003_11_14_17_21_15425)), inference(start_rule)). % 0.20/0.38 cnf(i_0_60, plain, (~cUnsatisfiable(i2003_11_14_17_21_15425)), inference(closure_rule, [i_0_46])). % 0.20/0.38 cnf(i_0_59, plain, (cp(esk3_1(i2003_11_14_17_21_15425))), inference(extension_rule, [i_0_34])). % 0.20/0.38 cnf(i_0_106, plain, (~ra_Px1(esk3_1(i2003_11_14_17_21_15425),esk5_1(esk3_1(i2003_11_14_17_21_15425)))), inference(extension_rule, [i_0_36])). % 0.20/0.38 cnf(i_0_137, plain, (~cpxcomp(esk3_1(i2003_11_14_17_21_15425))), inference(etableau_closure_rule, [i_0_137, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (23111) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------