%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS048+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 : n025.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:24 EDT 2022 % Result : Satisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : KRS048+1 : TPTP v8.1.0. Released v3.1.0. % 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n025.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 08:19:48 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 39 Number of unprocessed: 39 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 39 beginning clauses after preprocessing and clausification % 0.12/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.12/0.36 # No conjectures. % 0.12/0.36 # There are 39 start rule candidates: % 0.12/0.36 # Found 2 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 39 start rule tableaux created. % 0.12/0.36 # 37 extension rule candidate clauses % 0.12/0.36 # 2 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # 24562 Satisfiable branch % 0.12/0.37 # 24565 Satisfiable branch % 0.12/0.37 # Satisfiable branch found. % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # 24563 Satisfiable branch % 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_67, plain, (cSatisfiable(i2003_11_14_17_16_32989))). % 0.12/0.37 cnf(i_0_28, plain, (~cowlNothing(X1))). % 0.12/0.37 cnf(i_0_31, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.37 cnf(i_0_35, plain, (cp1(X1)|~cSatisfiable(X1))). % 0.12/0.37 cnf(i_0_43, plain, (cp1(X1)|~ca_Ax4(X1))). % 0.12/0.37 cnf(i_0_30, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.37 cnf(i_0_47, plain, (ca_Cx3(X1)|~ca_Cx2xcomp(X1))). % 0.12/0.37 cnf(i_0_45, plain, (~ra_Px2(X1,X2)|~ca_Cx2(X1))). % 0.12/0.37 cnf(i_0_52, plain, (~ra_Px3(X1,X2)|~ca_Cx3(X1))). % 0.12/0.37 cnf(i_0_37, plain, (~ra_Px1(X1,X2)|~cp1(X1))). % 0.12/0.37 cnf(i_0_48, plain, (cp1(X1)|~ca_Cx2xcomp(X1))). % 0.12/0.37 cnf(i_0_59, plain, (ca_Ax4(esk10_1(X1))|~ca_Vx5(X1))). % 0.12/0.37 cnf(i_0_49, plain, (ca_Cx2xcomp(X1)|~ra_Px2(X1,X2))). % 0.12/0.37 cnf(i_0_53, plain, (ca_Cx3xcomp(X1)|~ra_Px3(X1,X2))). % 0.12/0.37 cnf(i_0_55, plain, (ca_Cx3xcomp(X1)|~cp1(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_38, plain, (cp1xcomp(X1)|~ra_Px1(X1,X2))). % 0.12/0.37 cnf(i_0_33, plain, (ca_Vx5(esk1_1(X1))|~cSatisfiable(X1))). % 0.12/0.37 cnf(i_0_56, plain, (rr(X1,esk9_1(X1))|ca_Cx3xcomp(X1))). % 0.12/0.37 cnf(i_0_46, plain, (ca_Cx2xcomp(X1)|~cp1(X1)|~ca_Cx3(X1))). % 0.12/0.37 cnf(i_0_57, plain, (cp1(X1)|~rr(X2,X1)|~ca_Cx3xcomp(X2))). % 0.12/0.37 cnf(i_0_40, plain, (ca_Ax4(X1)|~cp1(X1)|~ca_Cx2(esk4_1(X1)))). % 0.12/0.37 cnf(i_0_42, plain, (ca_Cx2(X1)|~rinvR(X2,X1)|~ca_Ax4(X2))). % 0.12/0.37 cnf(i_0_39, plain, (ra_Px1(X1,esk3_1(X1))|~cp1xcomp(X1))). % 0.12/0.37 cnf(i_0_34, plain, (rr(X1,esk1_1(X1))|~cSatisfiable(X1))). % 0.12/0.37 cnf(i_0_60, plain, (rr(X1,esk10_1(X1))|~ca_Vx5(X1))). % 0.12/0.37 cnf(i_0_63, plain, (rf(X1,X2)|~rinvF(X2,X1))). % 0.12/0.37 cnf(i_0_65, plain, (rr(X1,X2)|~rinvR(X2,X1))). % 0.12/0.37 cnf(i_0_44, plain, (ra_Px2(X1,esk5_1(X1))|ca_Cx2(X1))). % 0.12/0.37 cnf(i_0_62, plain, (rinvF(X1,X2)|~rf(X2,X1))). % 0.12/0.37 cnf(i_0_58, plain, (ca_Vx5(X1)|~rr(X1,X2)|~ca_Ax4(X2))). % 0.12/0.37 cnf(i_0_64, plain, (rinvR(X1,X2)|~rr(X2,X1))). % 0.12/0.37 cnf(i_0_32, plain, (cSatisfiable(X1)|~rr(X1,X2)|~cp1(X1)|~ca_Vx5(X2))). % 0.12/0.37 cnf(i_0_50, plain, (ra_Px2(X1,esk6_1(X1))|~ca_Cx2xcomp(X1))). % 0.12/0.37 cnf(i_0_51, plain, (ra_Px3(X1,esk7_1(X1))|ca_Cx3(X1))). % 0.12/0.37 cnf(i_0_54, plain, (ra_Px3(X1,esk8_1(X1))|~ca_Cx3xcomp(X1))). % 0.12/0.37 cnf(i_0_61, plain, (X1=X2|~rf(X3,X2)|~rf(X3,X1))). % 0.12/0.37 cnf(i_0_36, plain, (ra_Px1(X1,esk2_1(X1))|cp1(X1))). % 0.12/0.37 cnf(i_0_41, plain, (rinvR(X1,esk4_1(X1))|ca_Ax4(X1)|~cp1(X1))). % 0.12/0.37 cnf(i_0_66, plain, (rr(X1,X2)|~rr(X3,X2)|~rr(X1,X3))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 3 steps % 0.12/0.37 cnf(i_0_67, plain, (cSatisfiable(i2003_11_14_17_16_32989)), inference(start_rule)). % 0.12/0.37 cnf(i_0_68, plain, (cSatisfiable(i2003_11_14_17_16_32989)), inference(extension_rule, [i_0_35])). % 0.12/0.37 cnf(i_0_156, plain, (cp1(i2003_11_14_17_16_32989)), inference(extension_rule, [i_0_37])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # 24566 Satisfiable branch % 0.12/0.37 # Satisfiable branch found. % 0.12/0.37 # Child (24562) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------