%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV282-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 : n006.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:06 EDT 2022 % Result : Unsatisfiable 9.64s 1.63s % Output : CNFRefutation 9.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWV282-2 : TPTP v8.1.0. Released v3.2.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n006.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Wed Jun 15 13:08:11 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # 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 # 13 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 # 5 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 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 8 tableaux to operate on % 9.64/1.58 # Creating equality axioms % 9.64/1.58 # Ran out of tableaux, making start rules for all clauses % 9.64/1.61 # Creating equality axioms % 9.64/1.61 # Ran out of tableaux, making start rules for all clauses % 9.64/1.62 # Creating equality axioms % 9.64/1.62 # Ran out of tableaux, making start rules for all clauses % 9.64/1.62 # Creating equality axioms % 9.64/1.62 # Ran out of tableaux, making start rules for all clauses % 9.64/1.63 # There were 1 total branch saturation attempts. % 9.64/1.63 # There were 0 of these attempts blocked. % 9.64/1.63 # There were 0 deferred branch saturation attempts. % 9.64/1.63 # There were 0 free duplicated saturations. % 9.64/1.63 # There were 1 total successful branch saturations. % 9.64/1.63 # There were 0 successful branch saturations in interreduction. % 9.64/1.63 # There were 0 successful branch saturations on the branch. % 9.64/1.63 # There were 1 successful branch saturations after the branch. % 9.64/1.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.64/1.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.64/1.63 # Begin clausification derivation % 9.64/1.63 % 9.64/1.63 # End clausification derivation % 9.64/1.63 # Begin listing active clauses obtained from FOF to CNF conversion % 9.64/1.63 cnf(i_0_18, plain, (c_Binomial_Obinomial(X1,c_0)=c_1)). % 9.64/1.63 cnf(i_0_21, plain, (c_minus(X1,X1,tc_nat)=c_0)). % 9.64/1.63 cnf(i_0_19, plain, (c_Finite__Set_Ocard(c_SetInterval_OatMost(c_0,tc_nat),tc_nat)=c_1)). % 9.64/1.63 cnf(i_0_16, plain, (c_Binomial_Obinomial(X1,c_1)=X1)). % 9.64/1.63 cnf(i_0_22, plain, (c_lessequals(X1,c_plus(X1,X2,tc_nat),tc_nat))). % 9.64/1.63 cnf(i_0_23, plain, (c_less(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat))). % 9.64/1.63 cnf(i_0_17, plain, (c_Binomial_Obinomial(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat))=c_plus(c_Binomial_Obinomial(X1,X2),c_Binomial_Obinomial(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat)),tc_nat))). % 9.64/1.63 cnf(i_0_26, plain, (~c_less(c_plus(X1,X2,tc_nat),X2,tc_nat))). % 9.64/1.63 cnf(i_0_27, plain, (~c_lessequals(v_sko__urX(X1),X2,tc_nat)|~c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(X1),tc_Message_Omsg))). % 9.64/1.63 cnf(i_0_20, plain, (c_lessequals(X1,X2,tc_nat)|c_minus(X1,X2,tc_nat)!=c_0)). % 9.64/1.63 cnf(i_0_25, plain, (c_lessequals(X1,X2,tc_nat)|~c_lessequals(c_plus(X3,X1,tc_nat),c_plus(X3,X2,tc_nat),tc_nat))). % 9.64/1.63 cnf(i_0_24, plain, (c_less(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat),tc_nat)|~c_lessequals(X1,X2,tc_nat))). % 9.64/1.63 cnf(i_0_15, negated_conjecture, (X1=X2|X1=X3|X2=X3|c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(X3),c_Event_Oused(v_evs_H),tc_Message_Omsg))). % 9.64/1.63 cnf(i_0_1467, plain, (X4=X4)). % 9.64/1.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 9.64/1.63 # Begin printing tableau % 9.64/1.63 # Found 5 steps % 9.64/1.63 cnf(i_0_1467, plain, (X2=X2), inference(start_rule)). % 9.64/1.63 cnf(i_0_1504, plain, (X2=X2), inference(extension_rule, [i_0_1471])). % 9.64/1.63 cnf(i_0_1526, plain, (c_Message_Omsg_ONonce(X2)=c_Message_Omsg_ONonce(X2)), inference(extension_rule, [i_0_1470])). % 9.64/1.63 cnf(i_0_1548, plain, (c_Message_Omsg_ONonce(X2)!=c_Binomial_Obinomial(c_Message_Omsg_ONonce(X2),c_1)), inference(closure_rule, [i_0_16])). % 9.64/1.63 cnf(i_0_1546, plain, (c_Message_Omsg_ONonce(X2)=c_Binomial_Obinomial(c_Message_Omsg_ONonce(X2),c_1)), inference(etableau_closure_rule, [i_0_1546, ...])). % 9.64/1.63 # End printing tableau % 9.64/1.63 # SZS output end % 9.64/1.63 # Branches closed with saturation will be marked with an "s" % 9.64/1.63 # Child (28717) has found a proof. % 9.64/1.63 % 9.64/1.63 # Proof search is over... % 9.64/1.63 # Freeing feature tree %------------------------------------------------------------------------------