%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV284-2 : TPTP v8.1.0. Released v3.2.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 : n015.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:20:07 EDT 2022 % Result : Unsatisfiable 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV284-2 : TPTP v8.1.0. Released v3.2.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 : n015.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 10:29:10 EDT 2022 % 0.13/0.35 % 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: 6 Number of unprocessed: 6 % 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.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 6 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 3 conjectures. % 0.13/0.38 # There are 3 start rule candidates: % 0.13/0.38 # Found 1 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 3 start rule tableaux created. % 0.13/0.38 # 5 extension rule candidate clauses % 0.13/0.38 # 1 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_7, negated_conjecture, (c_lessequals(X1,v_x(X1),tc_nat))). % 0.13/0.38 cnf(i_0_8, negated_conjecture, (~c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)|~c_lessequals(v_N,X1,tc_nat))). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_x(X1)),c_Event_Oused(v_list),tc_Message_Omsg))). % 0.13/0.38 cnf(i_0_10, plain, (~c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)|~c_lessequals(v_sko__upX(X2),X1,tc_nat))). % 0.13/0.38 cnf(i_0_11, plain, (c_lessequals(X1,X2,tc_nat)|~c_lessequals(c_plus(X3,X1,tc_nat),X2,tc_nat))). % 0.13/0.38 cnf(i_0_12, plain, (c_lessequals(X1,X2,tc_nat)|~c_lessequals(c_plus(X1,X3,tc_nat),X2,tc_nat))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 4 steps % 0.13/0.38 cnf(i_0_7, negated_conjecture, (c_lessequals(v_N,v_x(v_N),tc_nat)), inference(start_rule)). % 0.13/0.38 cnf(i_0_17, plain, (c_lessequals(v_N,v_x(v_N),tc_nat)), inference(extension_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_56, plain, (~c_in(c_Message_Omsg_ONonce(v_x(v_N)),c_Event_Oused(v_list),tc_Message_Omsg)), inference(extension_rule, [i_0_9])). % 0.13/0.38 cnf(i_0_64, plain, (c_in(c_Message_Omsg_ONonce(v_x(v_N)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)), inference(etableau_closure_rule, [i_0_64, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 7 tableaux to operate on % 0.13/0.38 # Found closed tableau during pool population. % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------