%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV973-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 : n009.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 : Wed Jul 20 18:24:07 EDT 2022 % Result : Satisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV973-1 : TPTP v8.1.0. Released v4.1.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n009.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 15 22:38:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 16 Number of unprocessed: 10 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 10 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 8 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 2 extension rule candidate clauses % 0.13/0.37 # 8 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # 2733 Satisfiable branch % 0.13/0.37 # Satisfiable branch found. % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 0 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_31, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT))). % 0.13/0.37 cnf(i_0_32, negated_conjecture, (v_v____!=c_Value_Oval_ONull)). % 0.13/0.37 cnf(i_0_25, plain, (c_Value_Oval_OUnit!=c_Value_Oval_ONull)). % 0.13/0.37 cnf(i_0_30, plain, (c_Value_Oval_OAddr(X1)!=c_Value_Oval_ONull)). % 0.13/0.37 cnf(i_0_28, plain, (c_Value_Oval_OIntg(X1)!=c_Value_Oval_ONull)). % 0.13/0.37 cnf(i_0_17, plain, (c_Value_Oval_OAddr(X1)!=c_Value_Oval_OUnit)). % 0.13/0.37 cnf(i_0_21, plain, (c_Value_Oval_OIntg(X1)!=c_Value_Oval_OUnit)). % 0.13/0.37 cnf(i_0_19, plain, (c_Value_Oval_OIntg(X1)!=c_Value_Oval_OAddr(X2))). % 0.13/0.37 cnf(i_0_22, plain, (X1=X2|c_Value_Oval_OAddr(X1)!=c_Value_Oval_OAddr(X2))). % 0.13/0.37 cnf(i_0_24, plain, (X1=X2|c_Value_Oval_OIntg(X1)!=c_Value_Oval_OIntg(X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 3 steps % 0.13/0.37 cnf(i_0_32, negated_conjecture, (v_v____!=c_Value_Oval_ONull), inference(start_rule)). % 0.13/0.37 cnf(i_0_33, plain, (v_v____!=c_Value_Oval_ONull), inference(extension_rule, [i_0_24])). % 0.13/0.37 cnf(i_0_37, plain, (c_Value_Oval_OIntg(v_v____)!=c_Value_Oval_OIntg(c_Value_Oval_ONull)), inference(extension_rule, [i_0_22])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 2 tableaux to operate on % 0.13/0.37 # Found closed tableau during pool population. % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------