%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SCT029-1 : TPTP v8.1.0. Released v4.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 : n004.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 : Mon Jul 18 21:24:15 EDT 2022 % Result : Satisfiable 0.21s 0.39s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SCT029-1 : TPTP v8.1.0. Released v4.1.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sat Jul 2 05:33:23 EDT 2022 % 0.14/0.36 % CPUTime : % 0.21/0.38 # No SInE strategy applied % 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.38 # % 0.21/0.38 # Presaturation interreduction done % 0.21/0.38 # Number of axioms: 13 Number of unprocessed: 13 % 0.21/0.38 # Tableaux proof search. % 0.21/0.38 # APR header successfully linked. % 0.21/0.38 # Hello from C++ % 0.21/0.39 # The folding up rule is enabled... % 0.21/0.39 # Local unification is enabled... % 0.21/0.39 # Any saturation attempts will use folding labels... % 0.21/0.39 # 13 beginning clauses after preprocessing and clausification % 0.21/0.39 # Creating start rules for all 1 conjectures. % 0.21/0.39 # There are 1 start rule candidates: % 0.21/0.39 # Found 4 unit axioms. % 0.21/0.39 # 1 start rule tableaux created. % 0.21/0.39 # 9 extension rule candidate clauses % 0.21/0.39 # 4 unit axiom clauses % 0.21/0.39 % 0.21/0.39 # Requested 8, 32 cores available to the main process. % 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.21/0.39 # 2105 Satisfiable branch % 0.21/0.39 # Satisfiable branch found. % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 0 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 0 successful branch saturations after the branch. % 0.21/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_21, plain, (c_Arrow__Order__Mirabelle_OIIA(v_F))). % 0.21/0.39 cnf(i_0_23, plain, (c_Arrow__Order__Mirabelle_Ounanimity(v_F))). % 0.21/0.39 cnf(i_0_25, plain, (c_fequal(X1,X1,X2))). % 0.21/0.39 cnf(i_0_24, negated_conjecture, (~c_Arrow__Order__Mirabelle_Odictator(v_F,X1))). % 0.21/0.39 cnf(i_0_26, plain, (X1=X2|~c_fequal(X1,X2,X3))). % 0.21/0.39 cnf(i_0_17, plain, (c_in(X1,X2,X3)|~hBOOL(hAPP(X2,X1)))). % 0.21/0.39 cnf(i_0_18, plain, (hBOOL(hAPP(X1,X2))|~c_in(X2,X1,X3))). % 0.21/0.39 cnf(i_0_22, plain, (c_Arrow__Order__Mirabelle_Odictator(X1,X2)|hAPP(X1,v_sko__Arrow__Order__Mirabelle__Xdictator__def__1(X1,X2))!=hAPP(v_sko__Arrow__Order__Mirabelle__Xdictator__def__1(X1,X2),X2))). % 0.21/0.39 cnf(i_0_16, plain, (hAPP(X1,X2)=hAPP(X2,X3)|~c_Arrow__Order__Mirabelle_Odictator(X1,X3)|~c_in(X2,c_Arrow__Order__Mirabelle_OProf,tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))))). % 0.21/0.39 cnf(i_0_14, plain, (c_in(v_sko__Arrow__Order__Mirabelle__XIIA__def__2(X1),c_Arrow__Order__Mirabelle_OProf,tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)))|c_Arrow__Order__Mirabelle_OIIA(X1))). % 0.21/0.39 cnf(i_0_19, plain, (c_in(v_sko__Arrow__Order__Mirabelle__XIIA__def__3(X1),c_Arrow__Order__Mirabelle_OProf,tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)))|c_Arrow__Order__Mirabelle_OIIA(X1))). % 0.21/0.39 cnf(i_0_15, plain, (c_Arrow__Order__Mirabelle_Ounanimity(X1)|c_in(v_sko__Arrow__Order__Mirabelle__Xunanimity__def__2(X1),c_Arrow__Order__Mirabelle_OProf,tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))))). % 0.21/0.39 cnf(i_0_20, plain, (c_Arrow__Order__Mirabelle_Odictator(X1,X2)|c_in(v_sko__Arrow__Order__Mirabelle__Xdictator__def__1(X1,X2),c_Arrow__Order__Mirabelle_OProf,tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))))). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 3 steps % 0.21/0.39 cnf(i_0_24, negated_conjecture, (~c_Arrow__Order__Mirabelle_Odictator(v_F,X8)), inference(start_rule)). % 0.21/0.39 cnf(i_0_27, plain, (~c_Arrow__Order__Mirabelle_Odictator(v_F,X8)), inference(extension_rule, [i_0_20])). % 0.21/0.39 cnf(i_0_46, plain, (c_in(v_sko__Arrow__Order__Mirabelle__Xdictator__def__1(v_F,X8),c_Arrow__Order__Mirabelle_OProf,tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)))), inference(extension_rule, [i_0_18])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.21/0.39 # We now have 2 tableaux to operate on % 0.21/0.39 # Found closed tableau during pool population. % 0.21/0.39 # Proof search is over... % 0.21/0.39 # Freeing feature tree %------------------------------------------------------------------------------